Infinite λ-calculus and types

Theoretical Computer Science

Volumn 212, Issue 1-2, 1999, Pages 29-75

  Berarducci, Alessandro ^a   Dezani Ciancaglini, Mariangiola ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Infinite calculus; Intersection types; algebras

Indexed keywords

EID: 0002086967     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00135-2     Document Type: Article

References (54)

1. S. Abramsky, Domain theory in logical form, Ann. Pure Appl. Logics 51 (1991) 1-77.
2. S. Abramsky, C.-H.L. Ong, Full abstraction in the lazy lambda calculus, Inform. and Comput. 105 (1993) 159-267.
3. F. Alessi, Type Preorders, CAAP'94, Lecture Notes in Computer Science, vol. 787, Springer, Berlin, 1994, pp. 37-51.
4. J. Baeten, B. Boerboom, Ω can be anything it should not be, Indag. Math. 41 (1979) 111-120.
5. H. Barendregt, The Lambda Calculus Its Syntax and Semantics, Studies in Logic, vol. 103, North-Holland, Amsterdam, 1984.
6. H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48 (1983) 931-940.
7. A. Berarducci, Infinite lambda-calculus and non-sensible models, Logic and Algebra, Lecture Notes in Pure and Applied Mathematics, vol. 180, Marcel Dekker, New York, 1996, pp. 339-378.
8. A. Berarducci, B. Intrigila, Some new results on easy lambda-terms, Theoret. Comput. Sci. 121 (1993) 71-88.
9. A. Berarducci, B. Intrigila, Church-rosser λ-theories, infinite λ-terms and consistency problems, Logic: from Foundations to Applications, European Logic Colloquium, Clarendon Press, Oxford, 1996, pp. 33-58.
10. M. Coppo, M. Dezani-Ciancaglini, F. Honsell, G. Longo, Extended type structures and filter lambda models, Logic Colloquium '82, North-Holland, Amsterdam, 1983, pp. 241-262.
11. M. Coppo, M. Dezani-Ciancaglini, B. Venneri, Principal type schemes and λ-calculus semantics, To H.B.Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, pp. 535-560.
12. M. Coppo, M. Dezani-Ciancaglini, M. Zacchi, Type theories, normal forms and script D sign∞ lambda models, Inform. and Control 72(2) (1987) 85-116.
13. N.G. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, Indag. Math. 34 (1972) 381-392.
14. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, Filter models for conjunctive-disjunctive λ-calculus, Theoret. Comput. Sci. 170(1-2) (1996) 83-128.
15. M. Dezani-Ciancaglini, U. de'Liguoro, A. Piperno, A filter model for concurrent λ-calculi, SIAM J. Comput. 27(5) (1998) 1376-1419.
16. M. Dezani-Ciancaglini, J. Tiuryn, P. Urzyczyn, Discrimination by parallel observers, LICS '97, IEEE Comput. Soc. Press, Los Alamitos, 1997, pp. 396-407.
17. P. Di Gianantonio, F. Honsell, An Abstract Notion of Application, TLCA'93, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 124-138.
18. L. Egidi, F. Honsell, S. Ronchi Della Rocca, Operational, denotational and logical descriptions: a case study, Fund. Inform. 16(2) (1992) 149-170.
19. J.R. Hindley, The completeness theorem for typing λ-terms, Theoret. Comput. Sci. 22 (1983) 1-17.
20. J.R. Hindley, J.P. Seldin, Introduction to Combinators and λ-calculus, Cambridge Univ. Press., Cambridge, 1986.
21. F. Honsell, M. Lenisa, Some Results on the Full Abstraction Problem for Restricted Lambda Calculi, MFCS'93, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993, pp. 84-104.
22. F. Honsell, S. Ronchi Della Rocca, An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, J. Comput. System. Sci. 45 (1992) 49-75.
23. F. Honsell, S. Ronchi Della Rocca, Reasoning about interpretations in qualitative lambda models, Programming Concept and Methods, North-Holland, Amsterdam, 1990, pp. 505-521.
24. G. Jacopini, A condition for identifying two elements of whatever model of combinatory logic, LCCS, Lecture Notes in Computer Science, vol. 37, Springer, Berlin, 1975, pp. 213-219.
25. G. Jacopini, M. Venturini Zilli, Equating for recurrent terms of λ-calculus and combinatory logic, Istituto per le applicazioni del calcolo "Mauro Picone", Quaderni serie 3, no. 85, Roma 1978, 3-14.
26. G. Jacopini, M. Venturini Zilli, Easy terms in the lambda calculus, Fundam. Inform. 8 (2) (1985) 225-233.
27. Y. Jiang, Consistance et inconsistance de théories de Lambda-calculus étendus, Thése de Doctorat d'État, Université Paris VII, 1993.
28. Y. Jiang, Consistency of a λ-theory with n-tuples and easy terms, Archive Math. Logic 34 (1995) 79-96.
29. J.R. Kennaway, J. W. Klop, R. Sleep, F.-J. de Vries, Transfinite reductions in orthogonal term rewriting systems, Inform. and Comput. 119(1) (1995) 18-38.
30. R. Kennaway, J.W. Klop, R. Sleep, F.-J. de Vries, Infinitary lambda calculus, Theoret. Comput. Sci. 175(1) (1997) 93-126.
31. J.R. Kennaway, V. van Oostrom, F.J. de Vries, Meaningless Terms in Rewriting, ALP'96, Lecture Notes in Computer Science, vol. 1139, Springer, Berlin, 1996, pp. 254-268.
32. R. Kerth, Isomorphisme et équivalence équationnelle entre modèles du λ-calcul, Thése de Doctorat d'État, Université Paris VII, 1995.
33. B. Intrigila, A problem on easy terms in λ-calculus, Fundam. Inform. 15(1) (1991) 99-106.
34. G. Longo, Set theoretical models of lambda calculus: theory, expansions and isomorphisms, Ann. Pure Appl. Logic 24 (1983) 153-188.
35. R. Nakajima, Infinite normal forms of the λ-calculus, LCCS, Lecture Notes in Computer Science, vol. 37, Springer, Berlin, 1975, pp. 62-82.
36. A. Meyer, What is a model of the lambda calculus?. Inform. and Comput. 52 (1982) 87-122.
37. G. Plotkin, A Powerdomain construction, SIAM J. of Comput. 5 (1976) 457-487.
38. G. Plotkin, A set-theoretical definition of application, Theoret. Comput. Sci. 121 (1994) 351-410.
39. A. Pravato, Categorical models of untyped lambda calculi: a monoidal approach, Ph.D. Thesis, Torino University, 1997.
40. A. Pravato, S. Ronchi Della Rocca, L. Roversi, Categorical semantics of the call-by-value λ-calculus, TLCA'95, Lecture Notes in Computer Science, vol. 902, Springer, Berlin, 1995, pp. 381-396.
41. S. Ronchi Della Rocca, Characterization theorems for a filter lambda model, Inform. and Control 54 (1982) 201-216.
42. S. Ronchi Della Rocca, Basic lambda calculus, Notes of the advanced school on typed lambda calculus and functional programming, Udine University, 1994.
43. S. Ronchi Della Rocca, B. Venneri, Principal type schemes for an extended type theory, Theoret. Comput. Sci. 28 (1984) 151-169.
44. A. Salibra, R. Goldblatt, A finite equational axiomatization of the functional algebras for the lambda calculus, Inform. and Comput. (to appear).
45. D.S. Scott, Lambda calculus: some models, some philosophy, The Kleene Symp., North-Holland, Amsterdam, 1980, pp. 223-266.
46. D.S. Scott, Letter to Albert Meyer, 1980.
47. D.S. Scott, Domains for denotational semantics, ICALP'82, Lecture Notes in Computer Science, vol. 140, Springer, Berlin, 1982, pp. 577-613.
48. W.W. Tait, Intensional interpretation of functionals of finite types I, J. Symbolic Logic 32 (1967) 198-212.
49. M. Takahashi, λ-calculi with conditional rules, TLCA'93, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 405-417.
50. P. Urzyczyn, The emptiness problem for intersection types, LICS'94, IEEE Comput. Soc. Press, Los Alamitos, 1994, pp. 300-309.
51. S. van Bakel, Complete restrictions of the intersection type discipline, Theoret. Comput. Sci. 102 (1992) 135-163.
52. G. Winskell, The Formal Semantics of Programming Languages: an Introduction, The MIT Press, Cambridge, 1994.
53. H. Yokouchi, F-semantics for type assignment systems, Theoret. Comput. Sci. 129 (1994) 39-77.
54. C. Zylberajch, Syntaxe ed sémantique de la facilité en λ-calcul, Thése de Doctorat d'État, Université Paris VII, 1991.