Abstract
We show how to characterize compositionally a number of evaluation properties of λ-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalization, normalization, head normalization, and weak head normalization. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation property, unrelated to termination, namely reducibility to a closed term.
Many of these characterization results are new, to our knowledge, or else they streamline, strengthen, or generalize earlier results in the literature. The completeness parts of the characterizations are proved uniformly for all the properties, using a set-theoretical semantics of intersection types over suitable kinds of stable sets. This technique generalizes Krivine’s and Mitchell’s methods for strong normalization to other evaluation properties.
Partially supported by MURST Cofin’ 99 TOSCA Project and FGV’ 99.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51(1–2):1–77, 1991.
S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy lambda calculus. Inform. and Comput., 105(2):159–267, 1993.
F. Alessi, M. Dezani-Ciancaglini, and F. Honsell. A complete characterization of the complete intersection-type theories. In Proceedings in Informatics. ITRS’00 Workshop, Carleton-Scientific, 2000.
R. M. Amadio and P.-L. Curien. Domains and lambda-calculi. Cambridge University Press, Cambridge, 1998.
S. van Bakel. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci., 102(1):135–163, 1992.
H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symbolic Logic, 48(4):931–940, 1983.
H.P. Barendregtet. al. Typed λ-calculus and applications. North-Holland. (to appear).
C. Böhm and M. Dezani-Ciancaglini. λ-terms as total or partial functions on normal forms. In C. Böhm, editor, λ-calculus and computer science theory, pages 96–121, Lecture Notes in Comput. Sci., Vol. 37. Springer, Berlin, 1975.
M. Coppo and M. Dezani-Ciancaglini. An extension of the basic functionality theory for the λ-calculus. Notre Dame J. Formal Logic, 21(4):685–693, 1980.
M. Coppo, M. Dezani-Ciancaglini, and M. Zacchi. Type theories, normal forms, and D∞-lambda-models. Inform. and Comput., 72(2):85–116, 1987.
M. Coppo, F. Honsell, M. Dezani-Ciancaglini, and G. Longo. Extended type struc-tures and filter lambda models. In G. Longo et. al., editors, Logic colloquium’ 82, pages 241–262. North-Holland, Amsterdam, 1984.
M. Dezani-Ciancaglini, F. Honsell, and Y. Motohama. Compositional cha-racterization of λ-terms using intersection types. Internal report, 2000, (http://www.di.unito.it/~yoko/paper/dezahonsmoto2000.ps).
L. Egidi, F. Honsell, and S. Ronchi Della Rocca. Operational, denotational and logical descriptions: a case study. Fund. Inform., 16(2):149–169, 1992.
S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44–52, 1996.
F. Honsell and M. Lenisa. Semantical analysis of perpetual strategies in λ-calculus. Theoret. Comput. Sci., 212(1-2):183–209, 1999.
F. Honsell and S. Ronchi Della Rocca. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci., 45(1):49–75, 1992.
J.-L. Krivine. Lambda-calcul Types et Modéles. Masson, Paris, 1990. English translation: Lambda-calculus, types and models, Ellis Horwood, 1993.
D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51–68, 1986.
J. Mitchell. Foundation for Programmimg Languages. MIT Press, 1996.
G. D. Plotkin. Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci., 121(1-2):351–409, 1993.
G. Pottinger. A type assignment for the strongly normalizable λ-terms. In J.R. Hindley and J.P. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561–577. Academic Press, London, 1980.
D. Scott. Continuous lattices. In F.W. Lawvere, editor, Toposes, Algebraic Geo-metry and Logic, pages 97–136. Lecture Notes in Math., Vol. 274. Springer, Berlin, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dezani-Ciancaglini, M., Honsell, F., Motohama, Y. (2000). Compositional Characterizations of λ-Terms Using Intersection Types. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_26
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive