Categorical Abstract Machine Language
(Originally "CAML" - Categorical Abstract Machine Language) A version of ML by G. Huet, G. Cousineau, Ascander Suarez, Pierre Weis, Michel Mauny and others of INRIA and ENS. CAML is intermediate between LCF ML and SML [in what sense?]. It has first-class functions, static type inference with polymorphic types, user-defined variant types and {product types}, and {pattern matching}. It is built on a proprietary run-time system. The CAML V3.1 implementation added lazy and mutable data structures, a "grammar" mechanism for interfacing with the Yacc parser generator, pretty-printing tools, high-performance arbitrary-precision arithmetic, and a complete library. CAML V3 is often nicknamed "heavy CAML", because of its heavy memory and CPU requirements compared to Caml Light. in 1990 Xavier Leroy and Damien Doligez designed a new implementation called Caml Light, freeing the previous implementation 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 a powerful module system in 1995 and of the object and class layer in 1996, the project' s name was changed to Objective Caml. ["The CAML Reference Manual", P. Weis et al, TR INRIA-ENS, 1989]. (2003-04-12) In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ AM ] [ am ] [ AML ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ av ] [ az ] [ b ] [ ba ] [ back-end ] [ be ] [ bi ] [ bit ] [ bj ] [ br ] [ bs ] [ by ] [ C ] [ CA ] [ ca ] [ CAM ] [ CAML ] [ Caml Light ] [ cc ] [ ch ] [ ci ] [ ck ] [ cl ] [ class ] [ co ] [ code ] [ com ] [ compiler ] [ complete ] [ CP ] [ CPU ] [ D ] [ data ] [ data structure ] [ dd ] [ de ] [ design ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ eg ] [ ENS ] [ er ] [ era ] [ es ] [ et ] [ feature ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ free ] [ function ] [ G ] [ ge ] [ gen ] [ gh ] [ gi ] [ gn ] [ gr ] [ grammar ] [ gu ] [ h ] [ hang ] [ hat ] [ hing ] [ hm ] [ hr ] [ ht ] [ IA ] [ id ] [ ie ] [ il ] [ import ] [ in ] [ inference ] [ INRIA ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ kn ] [ la ] [ language ] [ layer ] [ LCF ] [ ld ] [ Lex ] [ li ] [ library ] [ Lisp ] [ ls ] [ lt ] [ ly ] [ M ] [ ma ] [ Mac ] [ Mach ] [ man ] [ memory ] [ ML ] [ ml ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ N ] [ na ] [ named ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ nick ] [ ns ] [ nu ] [ O ] [ object ] [ om ] [ op ] [ pa ] [ parser ] [ parser generator ] [ pattern matching ] [ pe ] [ perf ] [ ph ] [ pl ] [ polymorphic ] [ port ] [ pr ] [ precision ] [ product ] [ proprietary ] [ query ] [ rc ] [ re ] [ requirements ] [ ro ] [ ru ] [ run ] [ run-time system ] [ S ] [ sc ] [ scan ] [ se ] [ si ] [ sig ] [ sm ] [ SML ] [ st ] [ struct ] [ sy ] [ system ] [ T ] [ table ] [ tar ] [ tc ] [ th ] [ to ] [ tool ] [ tr ] [ tt ] [ tty ] [ tw ] [ type ] [ type inference ] [ ua ] [ us ] [ user ] [ V ] [ va ] [ var ] [ ve ] [ version ] [ vi ] [ win ] [ X ] [ Y ] [ ye ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (14651 Reads) |
