OCaml is the most popular variant of the Caml language. From a language standpoint, it extends the core Caml language with a fully-fledged object-oriented layer, as well as a powerful module system, all connected by a sound, polymorphic type system featuring type inference. The OCaml system is an industrial-strength implementation of this language, featuring a high-performance native-code compiler (ocamlopt) for 9 processor architectures (IA32, PowerPC, AMD64, Alpha, Sparc, Mips, IA64, HPPA, StrongArm), as well as a bytecode compiler (ocamlc) and an interactive read-eval-print loop (ocaml) for quick development and portability. The OCaml distribution includes a comprehensive standard library, a replay debugger (ocamldebug), lexer (ocamllex) and parser (ocamlyacc) generators, a pre-processor pretty-printer (camlp4) and a documentation generator (ocamldoc)

References in zbMATH (referenced in 256 articles )

Showing results 241 to 256 of 256.
Sorted by year (citations)

previous 1 2 3 ... 11 12 13

  1. Le Fessant, Fabrice; Maranget, Luc: Optimizing pattern matching (2001)
  2. Michaelson, Greg; Scaife, Norman; Bristow, Paul; King, Peter: Nested algorithmic skeletons from higher order functions (2001)
  3. Pointon, R. F.; Trinder, P. W.; Loidl, H.-W.: The design and implementation of Glasgow distributed Haskell (2001)
  4. Rhiger, Morten: Higher-order program generation (2001)
  5. Rothe, Jan; Tews, Hendrik; Jacobs, Bart: The coalgebraic class specification language CCSL (2001)
  6. Serjantov, Andrei; Sewell, Peter; Wansbrough, Keith: The UDP calculus: Rigorous semantics for real networking (2001)
  7. Tews, Hendrik: Coalgebras for binary methods: Properties of bisimulations and invariants (2001)
  8. Delahaye, David: Information retrieval in a Coq proof library using type isomorphisms (2000)
  9. Dufourd, Jean-François; Puitg, François: Functional specification and prototyping with oriented combinatorial maps (2000)
  10. Fisher, Kathleen; Reppy, John; Riecke, Jon G.: A calculus for compiling and linking classes (2000)
  11. Hofmann, Martin: A type system for bounded space and functional in-place update (2000)
  12. Hofmann, Martin: A type system for bounded space and functional in-place update. (Extended abstract) (2000)
  13. Boulmé, S.; Hardin, T.; Hirschkoff, D.; Ménissier-Morain, V.; Rioboo, R.: On the way to certify computer algebra systems (1999)
  14. Fèvre, Stéphane; Wang, Dongming: Combining Clifford algebraic computing and term-rewriting for geometric theorem proving (1999)
  15. Caspi, Paul; Pouzet, Marc: A co-iterative characterization of synchronous stream functions (1998)
  16. Fèvre, Stéphane; Wang, Dongming: Combining algebraic computing and term-rewriting for geometry theorem proving (1998)

previous 1 2 3 ... 11 12 13