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 41 to 60 of 256.
Sorted by year (citations)

previous 1 2 3 4 5 ... 11 12 13 next

  1. Tan, Gang: JNI light: an operational model for the core JNI (2015)
  2. Barkati, Karim; Wang, Haisheng; Jouvelot, Pierre: Faustine: a vector faust interpreter test bed for multimedia signal processing. System description (2014)
  3. Bodin, Martin; Chargueraud, Arthur; Filaretti, Daniele; Gardner, Philippa; Maffeis, Sergio; Naudziuniene, Daiva; Schmitt, Alan; Smith, Gareth: A trusted mechanised JavaSript specification (2014)
  4. Braibant, Thomas; Jourdan, Jacques-Henri; Monniaux, David: Implementing and reasoning about hash-consed data structures in Coq (2014)
  5. Breitner, Joachim; Eisenberg, Richard A.; Peyton Jones, Simon; Weirich, Stephanie: Safe zero-cost coercions for Haskell (2014)
  6. Colvin, Robert J.: An operational semantics for object-oriented concepts based on the class hierarchy (2014)
  7. Gao, Jianhua; Jiang, Ying: Coinduction-based solution for minimization of Kripke structures (2014)
  8. Kiselyov, Oleg: The design and implementation of BER metaocaml. System description (2014)
  9. Kuwahara, Takuya; Terauchi, Tachio; Unno, Hiroshi; Kobayashi, Naoki: Automatic termination verification for higher-order functional programs (2014)
  10. Li, Liyi; Gunter, Elsa; Mansky, William: Symbolic analysis tools for CSP (2014)
  11. Miller, Andrew; Hicks, Michael; Katz, Jonathan; Shi, Elaine: Authenticated data structures, generically (2014)
  12. Mulligan, Dominic P.; Owens, Scott; Gray, Kathryn E.; Ridge, Tom; Sewell, Peter: Lem: reusable engineering of real-world semantics (2014)
  13. Rossberg, Andreas; Russo, Claudio; Dreyer, Derek: F-ing modules (2014)
  14. Yallop, Jeremy; White, Leo: Lightweight higher-kinded polymorphism (2014)
  15. Zhang, Danfeng; Myers, Andrew C.: Toward general diagnosis of static errors (2014)
  16. Braibant, Thomas; Jourdan, Jacques-Henri; Monniaux, David: Implementing hash-consed structures in Coq (2013)
  17. Brun, Christophe; Dufourd, Jean-François; Magaud, Nicolas: Formal proof in Coq and derivation of an imperative program to compute convex hulls (2013)
  18. Cadé, David; Blanchet, Bruno: Proved generation of implementations from computationally secure protocol specifications (2013)
  19. Chen, Yu-Fang; Wang, Bow-Yaw: BULL: a library for learning algorithms of Boolean functions (2013) ioport
  20. Filliâtre, Jean-Christophe; Paskevich, Andrei: Why3 -- where programs meet provers (2013) ioport

previous 1 2 3 4 5 ... 11 12 13 next