Objective CAML
(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. 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. 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. In 2000, JacqueS Garrigue added labeled and optional argumentS and anonymouS variantS. Objective CAML Start . USenet newSgroup: newS:comp.lang.ml. ["The CAML Reference Manual", P. WeiS et al, TR INRIA-ENS, 1989]. (2002-05-21) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ AM ] [ am ] [ AML ] [ an ] [ ar ] [ arc ] [ arg ] [ argument ] [ aS ] [ at ] [ au ] [ av ] [ az ] [ b ] [ ba ] [ back-end ] [ be ] [ bi ] [ bit ] [ bj ] [ br ] [ bS ] [ by ] [ C ] [ CA ] [ ca ] [ CAM ] [ CAML ] [ Categorical AbStract Machine Language ] [ cc ] [ ch ] [ ci ] [ ck ] [ cl ] [ claSS ] [ co ] [ code ] [ com ] [ compiler ] [ complete ] [ 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 ] [ group ] [ gu ] [ h ] [ hang ] [ hat ] [ hing ] [ hm ] [ hr ] [ ht ] [ IA ] [ id ] [ ie ] [ il ] [ import ] [ in ] [ inference ] [ INRIA ] [ int ] [ io ] [ ir ] [ iS ] [ it ] [ J ] [ la ] [ language ] [ layer ] [ LCF ] [ ld ] [ Lex ] [ li ] [ library ] [ LiSp ] [ lS ] [ lt ] [ ly ] [ M ] [ ma ] [ Mac ] [ Mach ] [ man ] [ ML ] [ ml ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ net ] [ newS ] [ newSgroup ] [ nf ] [ ng ] [ ni ] [ no ] [ nS ] [ nu ] [ nym ] [ O ] [ object ] [ om ] [ op ] [ option ] [ org ] [ pa ] [ parSer ] [ parSer generator ] [ pattern matching ] [ pe ] [ perf ] [ ph ] [ pl ] [ polymorphic ] [ port ] [ pr ] [ preciSion ] [ product ] [ proprietary ] [ pt ] [ query ] [ queS ] [ rc ] [ re ] [ ro ] [ ru ] [ run ] [ run-time SyStem ] [ S ] [ Sc ] [ Scan ] [ Se ] [ Sg ] [ Si ] [ Sig ] [ Sm ] [ SML ] [ St ] [ Struct ] [ Sy ] [ SyStem ] [ T ] [ table ] [ tar ] [ tc ] [ th ] [ to ] [ tool ] [ tp ] [ tr ] [ tt ] [ tty ] [ tw ] [ type ] [ type inference ] [ ua ] [ um ] [ up ] [ uS ] [ USenet ] [ uSer ] [ V ] [ va ] [ var ] [ ve ] [ verSion ] [ vi ] [ win ] [ wS ] [ X ] [ Y ] [ ye ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (14764 Reads) |
