Fully abstract models of typed \(\lambda\)-calculi. (English) Zbl 0386.03006


03B40 Combinatory logic and lambda calculus
68N01 General topics in the theory of software
68Q60 Specification and verification (program logics, model checking, etc.)
Full Text: DOI Link


[1] Hyland, J. M.E., A survey of some useful partial order relations on terms of the lambda calculus, Proc. Symp. on λ-calculus Comput. Sci. Theory (March 1975), Rome
[2] Milne, R., The formal semantics of computer languages and their implementations, (Technical Monograph PRG-13 (1975), Oxford University Computing Laboratory, Programming Research Group)
[3] Milner, R., Process; a mathematical model for computing agents, (Rose; Shepherdson, Logic Colloquium ’73, Studies in Logic and the Foundations of Mathematics, Vol. 80 (1975), North Holland/American Elsevier)
[4] Plotkin, G., LCF as a programming language, Theoret. Comput. Sci.. Theoret. Comput. Sci., Proc. Conf. Program Proving and Improving (1975), (to appear) · Zbl 0369.68006
[5] Plotkin, G., Lambda definability and logical relations, (Memo SAI-RM-4 (1973), School of Artificial Intelligence: School of Artificial Intelligence Edinburgh)
[6] Reynolds, J. C., On the relation between direct and continuation semantics, (Loeckx, Automata, Languages and Programming. Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 14 (1974), Springer-Verlag), 2nd Colloquium, University of Saarbrucken · Zbl 0313.68023
[7] Scott, D., Lattice theoretic models for various type-free calculi, Proc. \(4\) th Internl. Congress for Logic, Methodology and Philosophy of Science (1972), Bucharest
[8] Scott, D.; Strachey, C., Towards a Mathematical semantics for computer languages, (Proc. Symp. on Comput. Automata. Proc. Symp. on Comput. Automata, Microwave Research Institute Symposia Series, Vol. 21 (1972), Polytechnic Institute of Brooklyn) · Zbl 0268.68004
[9] Stenlund, S., Combinators, λ-terms and Proof Theory (1972), Reidel Co: Reidel Co Holland · Zbl 0248.02032
[10] Vuillemin, J., Proof techniques for recursive programs, (Research Report, IRIA, 78150 (1973), Le Chesnay: Le Chesnay France)
[11] Wadsworth, C., Relation between computational and denotational properties for Scott’s \(D^∞\) models of the λ-calculus, SIAM J. Comput., 5, 3 (1976) · Zbl 0346.02013
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.