LCF considered as a programming language. (English) Zbl 0369.68006


68N01 General topics in the theory of software


Full Text: DOI


[1] Gordon, M., Evaluation and denotation of pure LISP programs: a worked example in semantics, ()
[2] Howard, W.A., Assignment of ordinals to terms for primitive recursive functionals of finite type, () · Zbl 0206.28202
[3] Milner, R., Models of LCF, () · Zbl 0364.02018
[4] Milne, R., The formal semantics of computer languages and their implementations, ()
[5] Newey, M., Axioms and theorems for integers, lists and finite sets in LCF, ()
[6] Plotkin, G.D., Call-by-name, call-by-value and the λ-calculus, Theoret. comput. sci, 1, (1975) · Zbl 0325.68006
[7] Scott, D., A theory of computable functions of higher type, (1969), University of Oxford Oxford, unpublished seminar notes
[8] Scott, D., Lattice theory, data types and semantics, () · Zbl 0279.68042
[9] Troelstra, A.S., Metamathematical investigation of intuitionistic arithmetic and analysis, () · Zbl 0275.02025
[10] Vuillemin, J., Correct and optimal implementations of recursion in a simple programming language, Proc. fifth ACM symposium on theory of computing, 224-239, (1973)
[11] Wadsworth, C.P., Semantics and pragmatics of the lambda-calculus, (1971), University of Oxford Oxford
[12] C.P. Wadsworth, The relationships between lambda-expressions and their denotations in Scott’s models for the lambda-calculus (to appear).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.