This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Z. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. λν, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming, 1996. To appear.
N. Bourbaki. Éléments de mathématiques: Théories des ensembles, volume 1. Hermann & Cie, 1954.
P.-L. Curien, Th. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. RR 1617, INRIA, Rocquencourt, February 1992.
H. B. Curry, R. Feys, and W. Craig. Combinatory Logic, volume 1. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1958.
N. G. de Bruijn. Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings. Proc. of the Koninklijke Nederlands Akademie, 81(3):1–9, September 1978. Dedicated to A. Heyting at the occasion of his 80th Birthday on May 9, 1978.
Gilles Dowek, Thérèse Hardin, and Claude Kirchner. Higher-order unification via explicit substitutions, extended abstract. In Dexter Kozen, editor, Proceedings 10th IEEE Symposium on Logic in Computer Science, San Diego, California, USA, pages 366–374, June 1995.
J. V. Guttag, J. J. Horning, S. J. Garland, K. D. Jones, A. Modet, and J. M. Wing. Larch: Languages and Tools for Formal Specification. Springer-Verlag, 1993.
Magne Haveraaen, Olaf Owe, and Ole-Johan Dahl, editors. Recent Trends in Data Type Specifications. 11th Workshop on Specification of Abstract Data Types, WADT11. Oslo Norway, September 1995. Springer LNCS, 1996.
D. Hilbert. Die logischen Grundlagen der Mathematik. Mathematische Annalen, 88:151–165, 1923.
J. Horning. The Larch Shared Language: Some Open Problems. This volume [8], 1996.
A. C. Leisenring. Mathematical logic and Hilbert's ε-symbol. University Mathematical Series, Bedford College, London, 1969.
P.-A. Melliès. Typed λ-calculi with explicit substitutions may not terminate. In M. Dezani, editor, Int. Conf. on Typed Lambda Calculus and Applications, 1995.
C. Muñoz. Confluence and preservation of strong normalisation in an explicit substitutions calculus. In Proceedings 11th IEEE Symposium on Logic in Computer Science, Rudgers (New Jersey, USA), 1996. also INRIA Tech-Report 2762.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lescanne, P. (1996). The lambda calculus as an abstract data type. In: Haveraaen, M., Owe, O., Dahl, OJ. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1995 1995. Lecture Notes in Computer Science, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61629-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-61629-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61629-0
Online ISBN: 978-3-540-70642-7
eBook Packages: Springer Book Archive