Abstract
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating λ-terms (Böhm trees, Lévy-Longo trees, …). Then we prove, in an (almost) uniform way, that each type assignment system fully describes the observational equivalences induced by the corresponding tree representation of terms. More precisely, for each family of trees two terms have the same tree if and only if they get assigned the same types in the corresponding type assignment system.
Chapter PDF
Similar content being viewed by others
References
Abramsky S. Domain theory in logical form. Ann. of Pure and Appl. Logics, 51, 1991, 1–77.
Abramsky S., Ong C.-H.L. Full abstraction in the lazy A-calculus. Info. and Comp. 105, 1993, 159–267.
Alessi F. Type preorders. CAAP’94, LNCS 787, Springer-Verlag, Berlin, 1994, 37–51.
Barendregt H. The Lambda Calculus Its Syntax and Semantics. Studies in Logic 103, North-Holland, Amsterdam, 1984.
Barendregt H., Coppo M., Dezani-Ciancaglini M. A filter lambda model and the completeness of type assignment. J. Symbolic Logic 48, 1983, 931–940.
Berarducci A. Infinite Lambda-calculus and Non-sensible Models. Logic and Algebra, Lecture Notes in Pure and Applied Mathematics 180, Marcel Dekker Inc., 1996, 339–378.
Berarducci A., Dezani-Ciancaglini M. Infinite lambda-calculus and types. Theor. Comp. Sci., to appear. Boudol G. A lambda calculus for (strict) parallel functions. Info. and Comp. 108, 1994, 51–127.
Boudol G., Laneve C. The discriminating power of multiplicities in the A-calculus. Info. and Comp. 126 (1), 83–102, 1996.
Coppo M., Dezani-Ciancaglini M., Honsell F., Longo G. Extended type structures and filter lambda models. Logic Colloquium ‘82, North-Holland, Amsterdam, 1983, 241–262.
Coppo M., Dezani-Ciancaglini M., Venneri B. Principal type schemes and A-calculus semantics. To H.B.Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, 535–560.
Coppo M., Dezani-Ciancaglini M., Zacchi M. Type theories, normal forms and Do, lambda models. Info. and Control 72 (2), 1987, 85–116.
Dezani-Ciancaglini M., de’Liguoro U., Pipemo A. Filter models for conjunctive-disjunctive A-calculus. Theor. Comp. Sci. 170 (1–2), 1996, 83–128.
Dezani-Ciancaglini M., de’Liguoro U., Pipemo A. A filter model for concurrent A-calculi. SIAM J. of Comp., to appear. Dezani-Ciancaglini M., Tiuryn J., Urzyczyn P. Discrimination by parallel observers. LICS ‘87, IEEE Comp.Soc. Press, Los Alamitos, 1997, 396–407.
Engeler E. Algebra and combinators. Algebra Universalis 13 (3), 1981, 389–392.
Hyland M. A syntactic characterization of the equality in some models of the A-calculus. J. London Math.Soc.12(2), 1976, 361–370.
Kennaway J. R., Klop J. W Sleep R., de Vries F.J. Transfinite reductions in orthogonal term rewriting systems. Info. and Comp. 119 (1), 1995, 18–38.
Kennaway R., Klop J. W., Sleep R., de Vries F.J. Infinitary lambda calculus. Theor. Comp. Sci., 175 (1), 1997, 93–126.
Kennaway J.R., van Oostrom V., de Vries F.J. Meaningless terms in rewriting. ALP’96, LNCS 1139, Springer-Verlag, Berlin, 1996, 254–268.
Lévy J.J. An algebraic interpretation of the A — ß — K-calculus and an application of the labelled A-calculus. Theor. Comput. Sci. 2 (1), 97–114, 1976.
Longo G. Set theoretical models of lambda calculus: theory, expansions and isomorphisms. Ann. of Pure and Appl. Logic 24, 153–188, 1983.
Nakajima R. Infinite normal forms for the A-calculus. LCCST, LNCS 37, Springer-Verlag, Berlin, 1975, 62–82
Ronchi della Rocca S. Characterization theorems for a filter lambda model. Info. and Control 54, 1982, 201–216.
Sangiorgi D. “The lazy A-calculus in a concurrency scenario. Info. and Comp. 111(1), 120–153, 1994.
Scott D.S. Continuous lattices. TAGL, LNM 274, Springer-Verlag, Berlin, 1972, 97–136. Scott D.S. Data types as lattices. Siam J. Comput. 5, 1976, 522–587.
Scott D.S. Domains for denotational semantics. ICALP’82, LNCS 140, Springer-Verlag, Berlin, 1982, 577–613.
Tait W.W. Intensional interpretation of functionals of finite types I. J. Symbolic Logic 32, 1967, 198–212.
Wadsworth C.P. The relation between computational and denotational properties for scott’s D co models of the A-calculus. Siam J. Comput. 5, 1976, 488–521.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Barbanera, E., Dezani-Ciancaglini, M., de Vries, F.J. (1998). Types for Trees. In: Gries, D., de Roever, WP. (eds) Programming Concepts and Methods PROCOMET ’98. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35358-6_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-35358-6_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6299-0
Online ISBN: 978-0-387-35358-6
eBook Packages: Springer Book Archive