From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
OCaml Logo.svg
ParadigmMulti-paradigm: functional, imperative, object-oriented
Designed byXavier Leroy, Jérôme Vouillon, Damien Doligez, Didier Rémy, Ascánder Suárez
First appeared1996; 23 years ago (1996)
Stable release
4.07.0 / July 10, 2018; 6 months ago (2018-07-10)[1]
Typing disciplineInferred, static, strong, structural
Implementation languageOCaml, C
PlatformIA-32, x86-64, Power, SPARC, ARM 32-64
OSCross-platform: Unix, macOS, Windows
Filename extensions.ml, .mli
Influenced by
Caml, Standard ML, Pascal
ATS, Coq, Elm, F#, F*, Haxe, Opa, Rust, Scala

OCaml (/ˈkæməl/ oh-KAM-əl) (formerly Objective Caml) is the main implementation of the Caml programming language created by Xavier Leroy, Jérôme Vouillon, Damien Doligez, Didier Rémy, Ascánder Suárez, and others in 1996. A member of the ML family, OCaml extends Caml with object-oriented features.

The OCaml toolchain includes an interactive top-level interpreter, a bytecode compiler, an optimizing native code compiler, a reversible debugger, and a package manager (OPAM). It has a large standard library, making it useful for many of the same applications as Python or Perl, and has robust modular and object-oriented programming constructs that make it applicable for large-scale software engineering.

The acronym CAML originally stood for Categorical Abstract Machine Language, although OCaml omits this abstract machine.[2] OCaml is a free and open-source software project managed and principally maintained by the French Institute for Research in Computer Science and Automation (INRIA). In the early 2000s, many languages adopted elements from OCaml, notably F# and Scala.


ML-derived languages are best known for their static type systems and type-inferring compilers. OCaml unifies functional, imperative, and object-oriented programming under an ML-like type system. Thus, programmers need not be highly familiar with the pure functional language paradigm to use OCaml.

OCaml's static type system can help eliminate problems at runtime. However, it also forces the programmer to conform to the constraints of the type system, which can require careful thought and close attention. A type-inferring compiler greatly reduces the need for manual type annotations. For example, the data type of variables and the signature of functions usually need not be declared explicitly, as they do in languages like Java or C#. Nonetheless, effective use of OCaml's type system can require some sophistication on the part of a programmer.

OCaml is perhaps most distinguished from other languages with origins in academia by its emphasis on performance. Its static type system prevents runtime type mismatches and thus obviates runtime type and safety checks that burden the performance of dynamically typed languages, while still guaranteeing runtime safety, except when array bounds checking is turned off or when some type-unsafe features like serialization are used. These are rare enough that avoiding them is quite possible in practice.

Aside from type-checking overhead, functional programming languages are, in general, challenging to compile to efficient machine language code, due to issues such as the funarg problem. Along with standard loop, register, and instruction optimizations, OCaml's optimizing compiler employs static program analysis methods to optimize value boxing and closure allocation, helping to maximize the performance of the resulting code even if it makes extensive use of functional programming constructs.

Xavier Leroy has stated that "OCaml delivers at least 50% of the performance of a decent C compiler",[3] but a direct comparison is impossible. Some functions in the OCaml standard library are implemented with faster algorithms than equivalent functions in the standard libraries of other languages. For example, the implementation of set union in the OCaml standard library in theory is asymptotically faster than the equivalent function in the standard libraries of imperative languages (e.g., C++, Java) because the OCaml implementation exploits the immutability of sets to reuse parts of input sets in the output (see persistent data structure).


OCaml features: a static type system, type inference, parametric polymorphism, tail recursion, pattern matching, first class lexical closures, functors (parametric modules), exception handling, and incremental generational automatic garbage collection.

OCaml is notable for extending ML-style type inference to an object system in a general-purpose language. This permits structural subtyping, where object types are compatible if their method signatures are compatible, regardless of their declared inheritance (an unusual feature in statically typed languages).

A foreign function interface for linking to C primitives is provided, including language support for efficient numerical arrays in formats compatible with both C and Fortran. OCaml also supports creating libraries of OCaml functions that can be linked to a main program in C, so that an OCaml library can be distributed to C programmers who have no knowledge or installation of OCaml.

The OCaml distribution contains:

The native code compiler is available for many platforms, including Unix, Microsoft Windows, and Apple macOS. Portability is achieved through native code generation support for major architectures: IA-32, X86-64 (AMD64), Power, SPARC, ARM, and ARM64.[4]

OCaml bytecode and native code programs can be written in a multithreaded style, with preemptive context switching. However, because the garbage collector of the INRIA OCaml system (which is the only currently available full implementation of the language) is not designed for concurrency, symmetric multiprocessing is unsupported.[5] OCaml threads in the same process execute by time sharing only. There are however several libraries for distributed computing such as Functory and ocamlnet/Plasma.

Development environment[edit]

Since 2011, many new tools and libraries have been contributed to the OCaml development environment:

  • OCaml Package Manager (OPAM), developed by OCamlPro, is now an easy way to install OCaml and many of its tools and libraries
  • Optimizing compilers for OCaml:
    • ocamlcc is a compiler from OCaml to C, to complement the native code compiler for unsupported platforms.
    • OCamlJava, developed by INRIA, is a compiler from OCaml to the Java virtual machine (JVM).
    • OCaPic, developed by Lip6, is an OCaml compiler for PIC microcontrollers.
    • js_of_ocaml, developed by the Ocsigen team, is an optimizing compiler from OCaml to JavaScript.
  • Development tools
    • TypeRex is a set of open-source tools and libraries for OCaml, developed and maintained by OCamlPro.
    • Merlin is an auto-completion tool for editing OCaml code in Emacs and Vim.
  • Web sites:
    • OCaml.org is a website managed by the OCaml community.
    • Try OCaml, developed by OCamlPro, is a website containing a complete OCaml REPL in a webpage.

Code examples[edit]

Snippets of OCaml code are most easily studied by entering them into the top-level. This is an interactive OCaml session that prints the inferred types of resulting or defined expressions. The OCaml top-level is started by simply executing the OCaml program:

$ ocaml
     Objective Caml version 3.09.0

Code can then be entered at the "#" prompt. For example, to calculate 1+2*3:

# 1 + 2 * 3;;
- : int = 7

OCaml infers the type of the expression to be "int" (a machine-precision integer) and gives the result "7".

Hello World[edit]

The following program "hello.ml":

print_endline "Hello World!"

can be compiled into a bytecode executable:

$ ocamlc hello.ml -o hello

or compiled into an optimized native-code executable:

$ ocamlopt hello.ml -o hello

and executed:

$ ./hello
Hello World!

Summing a list of integers[edit]

Lists are one of the fundamental datatypes in OCaml. The following code example defines a recursive function sum that accepts one argument xs. (Note the keyword rec.) The function recursively iterates over a given list and provides a sum of integer elements. The match statement has similarities to C's switch element, though it is far more general.

let rec sum xs =
  match xs with
  | [] -> 0                        (* yield 0 if xs has the form [] *)
  | x :: xs' -> x + sum xs';;      (* recursive call if xs has the form x::xs' for suitable x and xs' *)
  # sum [1;2;3;4;5];;
  - : int = 15

Another way is to use standard fold function that works with lists.

let sum xs =
  List.fold_left (fun acc x -> acc + x) 0 xs;;
  # sum [1;2;3;4;5];;
  - : int = 15

Since the anonymous function is simply the application of the + operator, this can be shortened to:

let sum xs =
  List.fold_left (+) 0 xs

Furthermore, one can omit the list argument by making use of a partial application:

let sum =
  List.fold_left (+) 0


OCaml lends itself to concisely expressing recursive algorithms. The following code example implements an algorithm similar to quicksort that sorts a list in increasing order.

 let rec qsort = function
   | [] -> []
   | pivot :: rest ->
     let is_less x = x < pivot in
     let left, right = List.partition is_less rest in
     qsort left @ [pivot] @ qsort right

Birthday problem[edit]

The following program calculates the smallest number of people in a room for whom the probability of completely unique birthdays is less than 50% (the birthday problem, where for 1 person the probability is 365/365 (or 100%), for 2 it is 364/365, for 3 it is 364/365 × 363/365, etc.) (answer = 23).

let year_size = 365.

let rec birthday_paradox prob people =
  let prob' = (year_size -. float people) /. year_size *. prob  in
  if prob' < 0.5 then
    Printf.printf "answer = %d\n" (people+1)
    birthday_paradox prob' (people+1)

birthday_paradox 1.0 1

Church numerals[edit]

The following code defines a Church encoding of natural numbers, with successor (succ) and addition (add). A Church numeral n is a higher-order function that accepts a function f and a value x and applies f to x exactly n times. To convert a Church numeral from a functional value to a string, we pass it a function that prepends the string "S" to its input and the constant string "0".

let zero f x = x
let succ n f x = f (n f x)
let one = succ zero
let two = succ (succ zero)
let add n1 n2 f x = n1 f (n2 f x)
let to_string n = n (fun k -> "S" ^ k) "0"
let _ = to_string (add (succ two) two)

Arbitrary-precision factorial function (libraries)[edit]

A variety of libraries are directly accessible from OCaml. For example, OCaml has a built-in library for arbitrary-precision arithmetic. As the factorial function grows very rapidly, it quickly overflows machine-precision numbers (typically 32- or 64-bits). Thus, factorial is a suitable candidate for arbitrary-precision arithmetic.

In OCaml, the Num module (now superseded by the ZArith module) provides arbitrary-precision arithmetic and can be loaded into a running top-level using:

# #use "topfind";;
# #require "num";;
# open Num;;

The factorial function may then be written using the arbitrary-precision numeric operators =/, */ and -/ :

# let rec fact n =
    if n =/ Int 0 then Int 1 else n */ fact(n -/ Int 1);;
val fact : Num.num -> Num.num = <fun>

This function can compute much larger factorials, such as 120!:

# string_of_num (fact (Int 120));;
- : string =

Triangle (graphics)[edit]

The following program "simple.ml" renders a rotating triangle in 2D using OpenGL:

let () =
  ignore (Glut.init Sys.argv);
  Glut.initDisplayMode ~double_buffer:true ();
  ignore (Glut.createWindow ~title:"OpenGL Demo");
  let angle t = 10. *. t *. t in
  let render () =
    GlClear.clear [ `color ];
    GlMat.load_identity ();
    GlMat.rotate ~angle: (angle (Sys.time ())) ~z:1. ();
    GlDraw.begins `triangles;
    List.iter GlDraw.vertex2 [-1., -1.; 0., 1.; 1., -1.];
    GlDraw.ends ();
    Glut.swapBuffers () in
  GlMat.mode `modelview;
  Glut.displayFunc ~cb:render;
  Glut.idleFunc ~cb:(Some Glut.postRedisplay);
  Glut.mainLoop ()

The LablGL bindings to OpenGL are required. The program may then be compiled to bytecode with:

  $ ocamlc -I +lablGL lablglut.cma lablgl.cma simple.ml -o simple

or to nativecode with:

  $ ocamlopt -I +lablGL lablglut.cmxa lablgl.cmxa simple.ml -o simple

or, more simply, using the ocamlfind build command

  $ ocamlfind opt simple.ml -package lablgl.glut -linkpkg -o simple

and run:

  $ ./simple

Far more sophisticated, high-performance 2D and 3D graphical programs can be developed in OCaml. Thanks to the use of OpenGL and OCaml, the resulting programs can be cross-platform, compiling without any changes on many major platforms.

Fibonacci sequence[edit]

The following code calculates the Fibonacci sequence of a number n inputted. It uses tail recursion and pattern matching.

let fib n =
  let rec fib_aux m a b =
    match m with
    | 0 -> a
    | _ -> fib_aux (m - 1) b (a + b)
  in fib_aux n 0 1

Higher-order functions[edit]

Functions may take functions as input and return functions as result. For example, applying twice to a function f yields a function that applies f two times to its argument.

let twice (f : 'a -> 'a) = fun (x : 'a) -> f (f x);;
let inc (x : int) : int = x + 1;;
let add2 = twice inc;;
let inc_str (x : string) : string = x ^ " " ^ x;;
let add_str = twice(inc_str);;
  # add2 98;;
  - : int = 100
  # add_str "Test";;
  - : string = "Test Test Test Test"

The function twice uses a type variable 'a to indicate that it can be applied to any function f mapping from a type 'a to itself, rather than only to int->int functions. In particular, twice can even be applied to itself.

  # let fourtimes f = (twice twice) f;;
  val fourtimes : ('a -> 'a) -> 'a -> 'a = <fun>
  # let add4 = fourtimes inc;;
  val add4 : int -> int = <fun>
  # add4 98;;
  - : int = 102

Derived languages[edit]


MetaOCaml[6] is a multi-stage programming extension of OCaml enabling incremental compiling of new machine code during runtime. Under some circumstances, significant speedups are possible using multistage programming, because more detailed information about the data to process is available at runtime than at the regular compile time, so the incremental compiler can optimize away many cases of condition checking, etc.

As an example: if at compile time it is known that some power function x -> x^n is needed often, but the value of n is known only at runtime, a two-stage power function can be used in MetaOCaml:

 let rec power n x =
   if n = 0
   then .<1>.
     if even n
     then sqr (power (n/2) x)
     else .<.~x *. .~(power (n - 1) x)>.

As soon as n is known at runtime, a specialized and very fast power function can be created:

 .<fun x -> .~(power 5 .<x>.)>.

The result is:

 fun x_1 -> (x_1 *
     let y_3 = 
         let y_2 = (x_1 * 1)
         in (y_2 * y_2)
     in (y_3 * y_3))

The new function is automatically compiled.

Other derived languages[edit]

  • AtomCaml provides a synchronization primitive for atomic (transactional) execution of code.
  • Emily is a subset of OCaml that uses a design rule verifier to enforce object-capability model security principles.
  • F# is a .NET Framework language based on OCaml.
  • Fresh OCaml facilitates manipulating names and binders.
  • GCaml adds extensional polymorphism to OCaml, thus allowing overloading and type-safe marshalling.
  • JoCaml integrates constructions for developing concurrent and distributed programs.
  • OCamlDuce extends OCaml with features such as XML expressions and regular-expression types.
  • OCamlP3l is a parallel programming system based on OCaml and the P3L language.

Software written in OCaml[edit]


Several dozen companies use OCaml to some degree.[12] Notable examples include:

See also[edit]


  1. ^ "Releases – OCaml". ocaml.org.
  2. ^ "A History of OCaml". Retrieved 24 December 2016.
  3. ^ Linux Weekly News.
  4. ^ "ocaml/asmcomp at trunk · ocaml/ocaml · GitHub". GitHub. Retrieved 2 May 2015.
  5. ^ "Archives of the Caml mailing list > Message from Xavier Leroy". Retrieved 2 May 2015.
  6. ^ oleg-at-okmij.org. "BER MetaOCaml". okmij.org.
  7. ^ "Messenger.com Now 50% Converted to Reason · Reason". reasonml.github.io. Retrieved 2018-02-27.
  8. ^ "Flow: A Static Type Checker for JavaScript". Flow.
  9. ^ "Infer static analyzer". Infer.
  10. ^ "Performant type-checking for python. Contribute to facebook/pyre-check development by creating an account on GitHub". 9 February 2019 – via GitHub.
  11. ^ "WebAssembly specification, reference interpreter, and test suite.: WebAssembly/spec". 10 February 2019 – via GitHub.
  12. ^ "Companies using OCaml". OCaml.org. Retrieved 17 August 2014.
  13. ^ "BuckleScript: The 1.0 release has arrived! | Tech at Bloomberg". Tech at Bloomberg. 8 September 2016. Retrieved 21 May 2017.
  14. ^ Yaron Minsky (1 November 2011). "OCaml for the Masses". Retrieved 2 May 2015.

External links[edit]