From Seo Wiki - Search Engine Optimization and Programming Languages
Lazy ML (LML) is a functional programming language developed in the early 1980s by Lennart Augustsson and Thomas Johnsson at Chalmers University of Technology, prior to Miranda and Haskell. LML is a strongly typed, statically scoped implementation of ML, with lazy evaluation.
The key innovation of LML was to demonstrate how to compile a lazy functional language. Until then, lazy languages had been implemented via interpreted graph reduction. LML compiled to G-machine code.
LML is also notable as the language in which HBC, the Haskell B Compiler, was implemented.
let rec fact 0 = 1 || fact n = n*fact(n-1)
- Lazy ML (LML) Examples
- A Compiler for Lazy ML, Lennart Augustsson, Proceedings of the 1984 ACM Symposium on LISP and functional programming, 1984.
|File:HelloWorld.svg||This programming language-related article is a stub. You can help Wikipedia by expanding it.|