Abstract
We present a typed λ-calculus which enables us to handle first-class environments. The syntax and the reduction are obtained by applying the idea of Curien's “explicit substitution”. The type system has ML-polymorphism and a type inference algorithm which is sound and terminates.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Harold Abelson and Gerald Jay Sussman. Structure and Interpretation of Computer Programs. The MIT Press, 1985.
Pierre-Louis Curien, Thérèse Hardin, and Jean-Jacques Lévy. Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. Rapports de Recherche 1617, INRIA, February 1992.
Pierre-Louis Curien. Categorical combinators. Information and Control, 69:188–254, 1986.
Pierre-Louis Curien. An abstract framework for environment machines. Theoretical Computer Science, 82:389–402, 1991.
Olivier Danvy and Andrzej Filinski. Abstracting control. In Proceedings of the 1990 Conference on LISP and Functional Programming, pages 151–160, 1990.
Olivier Danvy and Karoline Malmkjær. Intensions and extensions in a reflective tower. In Proceedings of the 1988 Conference on LISP and Functional Programming, pages 327–341, 1988.
Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker, and Bruce Duba. Reasoning with continuations. In Proceedings of the Symposium on Logic in Computer Science, IEEE Computer Society Press, 1986.
Carl A. Gunter. Semantics of programming languages: structures and techniques. The MIT Press, 1992.
Lalita A. Jategaonkar and John C. Mitchell. Type inference with extended pattern matching and subtypes. Fundamenta Informaticae, 19:127–166, 1993.
Oliver Laumann. Reference Manual for the Elk Extension Language Interpreter. 1990.
MIT Scheme Reference Manual. MIT.
Martín Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques Lévy. Explicit substitutions. In proceedings of the Seventeenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Francisco, California, January 1990.
Shinya Nishizaki. Simply typed lambda calculus with first-class environments. Publication of Research Institute for Mathematical Sciences Kyoto University, 1994. To appear.
J. Rees and W. Clinger. Revised3 repord on the algorithmic language scheme. SIGPLAN Notices, 21(12):37–79, 1986.
Brian Cantwell Smith. Reflection and semantics in lisp. In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, pages 23–35, 1984.
Mitchell Wand and Daniel P. Friedman. The mystery of the tower revealed: a nonreflective description of the reflective tower. Lisp and Symbolic Computation, 1:11–37, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nishizaki, Sy. (1994). ML with first-class environments and its type inference algorithm. In: Jones, N.D., Hagiya, M., Sato, M. (eds) Logic, Language and Computation. Lecture Notes in Computer Science, vol 792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032396
Download citation
DOI: https://doi.org/10.1007/BFb0032396
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57935-9
Online ISBN: 978-3-540-48391-5
eBook Packages: Springer Book Archive