1. Lazy ML. A lazy, purely functional variant of ML designed by Thomas Johnson and Lennart Augustsson at the Chalmers University of Technology, Gothenburg, Sweden in 1984. LML is implemented on the G-machine, and was used to implement the first Haskell B compiler. There is a compiler (lmlc) and interpreter. . (1994-12-14) 2. Logical ML. Adds to Lazy ML a data type of "theories" whose objects represent logic programs. ["Logic Programming within a Functional Framework", A. Brogi et al, in Programming Language Implementation and Logic Programming, P. Deransart et al eds, LNCS 456, Springer 1990]. (1994-12-14)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ az ] [ B ] [ b ] [ bj ] [ by ] [ C ] [ ca ] [ Ch ] [ ch ] [ Chalmers University of Technology ] [ co ] [ com ] [ compiler ] [ D ] [ data ] [ data type ] [ dd ] [ de ] [ design ] [ du ] [ ec ] [ ed ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ Fun ] [ function ] [ functional ] [ G ] [ ge ] [ gi ] [ gn ] [ Go ] [ gr ] [ gu ] [ gy ] [ h ] [ Haskell B ] [ hn ] [ hose ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ interpreter ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ ke ] [ la ] [ lc ] [ Lex ] [ ly ] [ M ] [ ma ] [ machine ] [ ML ] [ ml ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ NC ] [ nc ] [ NCS ] [ ne ] [ ng ] [ ni ] [ nn ] [ no ] [ ns ] [ object ] [ om ] [ pe ] [ ph ] [ pl ] [ pr ] [ program ] [ query ] [ rc ] [ re ] [ rete ] [ ro ] [ S ] [ sa ] [ se ] [ si ] [ sig ] [ sit ] [ sk ] [ so ] [ st ] [ T ] [ th ] [ Thomas ] [ to ] [ tp ] [ type ] [ ua ] [ ug ] [ us ] [ va ] [ var ] [ ve ]