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 271 articles )

Showing results 1 to 20 of 271.
Sorted by year (citations)

1 2 3 ... 12 13 14 next

  1. Abrahamsson, Oskar: A verified proof checker for higher-order logic (2020)
  2. Brachthäuser, Jonathan Immanuel; Schuster, Philipp; Ostermann, Klaus: Effekt: capability-passing style for type- and effect-safe, extensible effect handlers in Scala (2020)
  3. Charguéraud, Arthur; Pottier, François: Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (2019)
  4. Marcello Seri; Ta-Chu Kao: OwlDE: making ODEs first-class Owl citizens (2019) not zbMATH
  5. Nipkow, Tobias; Brinkop, Hauke: Amortized complexity verified (2019)
  6. Bonifati, Angela; Dumbrava, Stefania; Arias, Emilio Jesús Gallego: Certified graph view maintenance with regular Datalog (2018)
  7. Gross, Jason; Erbsen, Andres; Chlipala, Adam: Reification by parametricity -- fast setup for proof by reflection, in two lines of Ltac (2018)
  8. Larchey-Wendling, Dominique: Proof pearl: constructive extraction of cycle finding algorithms (2018)
  9. Moore, Brandon; Peña, Lucas; Rosu, Grigore: Program verification by coinduction (2018)
  10. Saleh, Amr Hany; Karachalias, Georgios; Pretnar, Matija; Schrijvers, Tom: Explicit effect subtyping (2018)
  11. Castagna, Giuseppe (ed.); Gordon, Andrew D. (ed.): Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15--21, 2017 (2017)
  12. Ferreira, Francisco; Pientka, Brigitte: Programs using syntax with first-class binders (2017)
  13. Guéneau, Armaël; Myreen, Magnus O.; Kumar, Ramana; Norrish, Michael: Verified characteristic formulae for CakeML (2017)
  14. Hoffmann, Jan; Das, Ankush; Weng, Shu-Chun: Towards automatic resource bound analysis for OCaml (2017)
  15. Jeannin, Jean-Baptiste; Kozen, Dexter; Silva, Alexandra: CoCaml: functional programming with regular coinductive types (2017)
  16. Kiselyov, Oleg; Biboudis, Aggelos; Palladinos, Nick; Smaragdakis, Yannis: Stream fusion, to completeness (2017)
  17. Liang Wang: Owl: A General-Purpose Numerical Library in OCaml (2017) arXiv
  18. Magron, Victor; Constantinides, George; Donaldson, Alastair: Certified roundoff error bounds using semidefinite programming (2017)
  19. Padovani, Luca: Context-free session type inference (2017)
  20. Padovani, Luca: A simple library implementation of binary sessions (2017)

1 2 3 ... 12 13 14 next