LCF considered as a programming language
Gordon D. Plotkin · Theoretical Computer Science · 1977
Cited by 1,083 works. doi:10.1016/0304-3975(77)90044-5
Authors
References
- Call-by-name, call-by-value and the λ-calculus
- Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
- Models of LCF
- Correct and optimal implementations of recursion in a simple programming language
- Formal Semantics of Programming Languages
- Assignment of Ordinals to Terms for Primitive Recursive Functionals of Finite Type
- Evaluation and denotation of pure LISP programs: a worked example in semantics
- Axioms and theorems for integers, lists and finite sets in LCF.