CATEGORICAL ABSTRACT MACHINE LANGUAGE
\kˌatɪɡˈɒɹɪkə͡l ˈabstɹakt məʃˈiːn lˈaŋɡwɪd͡ʒ], \kˌatɪɡˈɒɹɪkəl ˈabstɹakt məʃˈiːn lˈaŋɡwɪdʒ], \k_ˌa_t_ɪ_ɡ_ˈɒ_ɹ_ɪ_k_əl ˈa_b_s_t_ɹ_a_k_t m_ə_ʃ_ˈiː_n l_ˈa_ŋ_ɡ_w_ɪ_dʒ]\
Definitions of CATEGORICAL ABSTRACT MACHINE LANGUAGE
Sort: Oldest first
(Originally "CAML" - Categorical Abstract MachineLanguage) A version of ML by G. Huet, G. Cousineau, AscanderSuarez, Pierre Weis, Michel Mauny and others of INRIA andENS. CAML is intermediate between LCF ML and SML [inwhat sense?]. It has first-class functions, static typeinference with polymorphic types, user-defined varianttypes and product types, and pattern matching. It isbuilt on a proprietary run-time system.The CAML V3.1 implementation added lazy and mutable datastructures, a "grammar" mechanism for interfacing with theYacc parser generator, pretty-printing tools,high-performance arbitrary-precision arithmetic, and acomplete library. CAML V3 is often nicknamed "heavy CAML",because of its heavy memory and CPU requirements compared toCaml Light.in 1990 Xavier Leroy and Damien Doligez designed a newimplementation called Caml Light, freeing the previousimplementation from too many experimental high-level features,and more importantly, from the old Le_Lisp back-end.Following the addition of a native-code compiler and apowerful module system in 1995 and of the object andclass layer in 1996, the project's name was changed toObjective Caml.["The CAML Reference Manual", P. Weis et al, TR INRIA-ENS,1989].
By Denis Howe