Characterizing convergent terms in Object Calculi via intersection types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2044 LNCS, Issue , 2001, Pages 315-328

  De'Liguoro, Ugo ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY;

INTERSECTION TYPE ASSIGNMENT SYSTEMS; INTERSECTION TYPES; LAMBDA CALCULUS; LAMBDA TERMS; OBJECT CALCULI;

CALCULATIONS;

EID: 39149123725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_25     Document Type: Conference Paper

References (28)

1. M. Abadi, L. Cardelli, A Theory of Objects, Springer 1996.
2. M. Abadi, L. Cardelli, R. Viswanathan, "An interpretation of objects and object types" Proc. of of POPL'96 1996, 396-409.
3. S. Abramsky, "Domain Theory in Logical Form", APAL 51, 1991, 1-77.
4. S. Abramsky, C.-H. L. Ong "Full abstraction in the lazy lambda calculus", Inf. Comput. 105(2), 1993, 159-267.
5. S. van Bakel, Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting, Ph.D. Thesis, Mathematisch Centrum, Amsterdam 1993.
6. H.P. Barendregt, M. Coppo, M. Dezani, "A Filter Lambda Model and the Completeness of Type Assignment", JSL 48, 1983, 931-940.
7. G. Boudol, "A Lambda Calculus for (Strict) Parallel Functions", Info. Comp. 108, 1994, 51-127.
8. K.B. Bruce, "A paradigmatic Object-Oriented design, static typing and semantics", J. of Fun. Prog. 1(4), 1994, 127-206.
9. K.B. Bruce, L. Cardelli, B.C. Pierce, "Comparing object encodings", Proc. of TACS'97, LNCS 1281, 1997, 415-438.
10. K. Crary, "Simple, Efficient Object Encoding using Intersection Types", CMU Technical Report CMU-CS-99-100.
11. M. Coppo, F. Damiani, P. Giannini, "Inference based analyses of functional programs: dead-code and strictness", in [28], 143-176.
12. M. Coppo, M. Dezani, B. Venneri, "Functional characters of solvable terms", Grund. der Math., 27, 1981, 45-58.
13. M. Coppo, A. Ferrari, "Type inference, abstract interpretation and strictness analysis", TCS 121, 1993, 113-144.
14. M. Dezani, E. Giovannetti, U. de' Liguoro, "Intersection types, A-models and Böhm trees", in [28], 45-97.
15. M. Dezani, F. Honsell, Y. Motohama, "Compositional Characterizations of A-terms using Intersection Types", Proc. of MFCS'00, LNCS 1893, 2000, 304-313.
16. M. Dezani, U. de' Liguoro, A. Piperno. "A filter model for concurrent lambda-calculus", Siam J. Comput. 27(5), 1998,1376-1419.
17. L. Egidi, F. Honsell, S. Ronchi della Rocca, "Operational, denotational and logical descriptions: a case study", Fund. Inf. 16, 1992, 149-169.
18. K. Fisher, F. Honsell, J.C. Mitchell, "A lambda calculus of objects and method specialization", Nordic J. Comput. 1, 1994, 3-37.
19. A. Gordon, G. Rees, "Bisimilarity for first-order calculus of objects with subtyping", Proc. of POPL'96, 1996, 386-395.
20. H. Ishihara, T. Kurata, "Completeness of intersection and union type assignment systems for call-by-value A-models", to appear in TCS.
21. S. Kamin, "Inheritance in Smalltalk-80: a denotational definition", Proc. of POPL'88, 1988, 80-87.
22. J.L. Krivine, Lambda-calcul, types et modèles, Masson 1990.
23. J.C. Mitchell, Foundations for Programming Languages, MIT Press, 1996.
24. B. Pierce, Programming with Intersection Types and Bounded Polymorphism, Ph.D. Thesis, 1991.
25. G. Pottinger, "A Type Assignment System for Strongly Normalizable A-terms", in R. Hindley, J. Seldin eds., To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalisms, Academic Press, 1980, 561-527.
26. J. Reynolds, "The Coherence of Languages with Intersection Types", LNCS 526, 1991, 675-700.
27. D. Scott, "Data types as lattices", SIAM J. Comput. 5, n. 3, 1976, 522-587.
28. M. Takahashi, M. Okada, M. Dezani eds., Theories of Types and Proofs, Mathematical Society of Japan, vol. 2, 1998.