An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus. (English) Zbl 0335.02016


03B40 Combinatory logic and lambda calculus
Full Text: DOI


[1] Barendregt, H.P., Some extensional term models for combinatory logics and lambda-calculi, Ph.D. thesis, (1971), Utrecht
[2] Church, A., The calculi of lambda conversion, () · JFM 67.0041.01
[3] Curry, H.B.; Feys, R., Combinatory logic, Vol. 1, (1958), North-Holland Amsterdam · Zbl 0175.27601
[4] Hyland, M., Proc. of the Rome conference, (1975), to appear in the
[5] M. Hyland, A syntactic characterization of the equality in some models for the lambda calculus, J. London Math. Soc., to appear. · Zbl 0329.02010
[6] Lévy, J.-J., Réductions sures dans le lambda calcul, 3∘ cycle, 7, (1974), Univ. of Paris
[7] J.-J. Lévy, Réductions sures et optimales dans le lambda calcul, to appear.
[8] Milner, R., Processes; A model of computing agents, () · Zbl 0316.68017
[9] Morris, J.H., Lambda calculus models of programming languages, ()
[10] Nivat, M., Langages algébriques sue le magma libre et sémantique des schémas de programme, () · Zbl 0279.68010
[11] Scott, D., Continuous lattices, Technical monograph, (1971), PRG-7, Oxford
[12] D. Scott, Data Types as Lattices, to appear in Springer Lecture Notes. · Zbl 0322.02024
[13] Vuillemin, J., Syntaxe, sémantique et axiomatique d’un langage de programmation simple, () · Zbl 0327.68006
[14] Wadsworth, C.P., Semantics and pragmatics of the lambda calculus, Ph.D. thesis, (1971), Oxford
[15] Welch, P., Another problem of the lambda calculus, (1973), Univ. of Kent, Private communication
[16] Welch, P., Proc. of the Rome conference, (1975), to appear in the
[17] C.P. Wadsworth, Approximate reduction and λ-calculus models, SIAM J., to appear. · Zbl 0407.03021
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.