Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H., Lambda Calculus and its Models. To appear in the proceedings of the Logic Colloquium'82, Florence, Italy.
Clark, K.L. and Tärnlund, S.-A. (editors), Logic Programming. Academic Press, 1982.
Clocksin, W.F. and Mellish, C.S., Programming in Prolog. Springer-Verlag, 1981.
Engeler, E., Algebras and Combinators. Algebra Universalis 13 (1981), 389–392.
Fehlmann, T., Theorie und Anwendung des Graphmodells der kombinatorischen Logik. Berichte des Instituts für Informatik, ETH Zürich, Nr. 41, 1981.
Fehlmann, T., Concat Reference Manual and Implementation Notes. ETH Zürich, 1981, 48 pp.
Kowalski, R.A., Logic for Problem Solving. North-Holland Publ. Co., 1979.
Longo, G., Set-theoretical Models for the λ-calculus: Theories, Expansions, Isomorphisms. To appear in the Annals of Mathematical Logic.
Meyer, A.R., What is a Model of the Lambda Calculus? Preprint MIT/LCS/TM-201, 1981.
Plotkin, G.D., A Set-theoretical Definition of Application. Memorandum MIP-R-95, University of Edinburgh, 1972.
Scott, D.S., Relating Theories of the λ-calculus. In: Essays on Combinatory Logic, Lambda Calculus and Formalism (to H.B. Curry), Seldin & Hindley, eds. Academic Press, New York, 1980, pp. 403–450.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engeler, E. (1984). Equations in combinatory algebras. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_364
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_364
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive