# zbMATH — the first resource for mathematics

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

##### MSC:
 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:
##### References:
 [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, () [3] Milner, R., Process; a mathematical model for computing agents, () [4] Plotkin, G., LCF as a programming language, Theoret. comput. sci., Proc. conf. program proving and improving, (1975), (to appear) · Zbl 0369.68006 [5] Plotkin, G., Lambda definability and logical relations, () [6] Reynolds, J.C., On the relation between direct and continuation semantics, (), 2nd Colloquium, University of Saarbrucken · Zbl 0313.68023 [7] Scott, D., Lattice theoretic models for various type-free calculi, Proc. 4th internl. congress for logic, methodology and philosophy of science, (1972), Bucharest [8] Scott, D.; Strachey, C., Towards a mathematical semantics for computer languages, () · Zbl 0268.68004 [9] Stenlund, S., Combinators, λ-terms and proof theory, (1972), Reidel Co Holland · Zbl 0248.02032 [10] Vuillemin, J., Proof techniques for recursive programs, () [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.