Abstract
Church's λ-calculus is modified by introducing a new mechanism, the lambda-bar operator “#”, which neutralizes the effect of one preceeding λ-binding. This operator can be used in such a way that renaming of bound variables in any reduction sequence can be avoided, with the effect that efficient interpreters with comparatively simple machine organization can be designed.
Any semantic model of the pure λ-calculus also serves as a model for this modified reduction calculus, which guarantees smooth semantical theories.
The Berkling Reduction Language BRL is a new functional programming language based upon this modification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Backus, J.: “Can Programming Be Liberated from the von Neumann Style ?”, CACM 21 (8), pp. 613–641, (1978)
Berkling, K. J.: “A symmetric complement to the Lambda calculus”, Interner Bericht ISF-76-7, GMD, D-5205 St. Augustin 1, 1976
Berkling, K. J.: “Reduction languages for reduction machines”, Interner Bericht ISF-76-8, GMD, D-5205 St. Augustin 1, 1976
De Bruijn, N. G.: “Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation”, Indag. Math. 34
Fehr, E.: “The lambda-semantics of LISP”, Schriften zur Informatik und Mathematik, Bericht Nr. 72, RWTH Aachen, Mai 1981
Gordon, M.: “Operational reasoning and denotational semantics” Stanford Artificial Intelligence Laboratory, Memo AIM-264, 1975
Mc Gowan, C.:“The modified SECD-machine” Second ACM Symposium on Theory of Computing, 1970
Hommes, F.: “The internal structure of the reduction machine”, Interner Bericht ISF-77-3, GMD, D-5205 St. Augustin 1, 1977
Hommes, F., Schlütter, H.: “Reduction machine system. User's guide” GMD-ISF, D-5205 St. Augustin 1, 1979
Kluge, W.E.: “The architecture of a reduction language machine hardware model,” Interner Bericht ISF-79-3, GMD, 5205 St. Augustin-1, 1979
Scott, D.: “Continuous lattices”, Proc. of Dalhousie Conf., Springer LNM No. 274, pp. 97–134, 1972
Scott, D.: “Data types as lattices”, SIAM J. Computing, Vol. 5.3, 1976
Turner, D.A.: “A new Implementation Technique for Applicative Languages”, Software-Practice and Experience, Vol. 9, 31–49, (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berkling, K.J., Fehr, E. (1982). A modification of the λ-calculus as a base for functional programming languages. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012755
Download citation
DOI: https://doi.org/10.1007/BFb0012755
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive