Simple easy terms

Electronic Notes in Theoretical Computer Science

Volumn 70, Issue 1, 2003, Pages 1-18

  Alessi, F ^a   Lusin, S ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY; SYNTACTICS; THEOREM PROVING;

GENERALIZATION; NORMALIZATION; REALIZABILITY SEMANTICS; Λ-TERMS;

COMPUTER SCIENCE;

EID: 18944386755     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80487-0     Document Type: Conference Paper

References (29)

1. Abramsky S. Domain theory in logical form. Ann. Pure Appl. Logic. 51:(1-2):1991;1-77
2. Abramsky S., Ong C.-H.L. Full abstraction in the lazy λ calculus. Inform. and Comput. 105:(2):1993;159-267
3. F. Alessi. Structure di tipi, teoria dei domini e modelli del λ calcolo. PhD thesis, Torino University, 1991.
4. F. Alessi, M. Dezani-Ciancaglini, and F. Honsell. Filter models and easy terms. In A. Restivo, S. Ronchi della Rocca, and L. Roversi, editors, Mathematical Foundations of Computer Science 2000, volume 2202 of Lecture Notes in Comput. Sci., pages 17-37. Springer, 2001.
5. Baeten J., Boerboom B. ω can be anything it shouldn't be. Indag. Math. 41:1979;111-120
6. Barendregt H., Coppo M., Dezani-Ciancaglini M. A filter λ model and the completeness of type assignment. J. Symbolic Logic. 48:(4):1983;931-940
7. Berarducci A. Infinite λ-calculus and non-sensible models. Inc M.D. Logic and Algebra, number 180 in Lecture Notes in Pure and Applied Mathematics. 1996;339-378 Springer-Verlag
8. Berarducci A., Intrigila B. Some new results on easy lambda-terms. Theoret. Comput. Sci. 121:1993;71-88
9. Berarducci A., Intrigila B. Church-Rosser λ-theories, infinite λ-calculus and consistency problems. Hodges W., Hyland M., et al. Logic: From Foundations to applications. 1996;33-58 Oxford Sci. Publ, New York
10. Coppo M., Dezani-Ciancaglini M. An extension of the basic functionality theory for the λ-calculus. Notre Dame J. Formal Logic. 21:(4):1980;685-693
11. Coppo M., Dezani-Ciancaglini M., Honsell F., Longo G. Extended type structures and filter lambda models. Logic colloquium '82. 1984;241-262 North-Holland, Amsterdam
12. Coppo M., Dezani-Ciancaglini M., Venneri B. Principal type schemes and λ-calculus semantics. Hindley R., Seldin J. To H. B. Curry: essays on combinatory logic, lambda calculus and formalism. 1980;535-560 Academic Press, London
13. ∞-lambda-models. Inform. and Comput. 72:(2):1987;85-116
14. M. Dezani-Ciancaglini, F. Honsell, and Y. Motohama. Compositional characterization of λ-terms using intersection types. In M. Nielsen and B. Rovan, editors, Mathematical Foundations of Computer Science 2000, volume 1893 of Lecture Notes in Comput. Sci., pages 304-313. Springer, 2000.
15. P. Di Gianantonio and F. Honsell. An abstract notion of application. In M. Bezem and J.F. Groote, editors, Typed lambda calculi and applications, volume 664 of Lecture Notes in Comput. Sci., pages 124-138. Springer, Berlin, 1993.
16. Egidi L., Honsell F., Ronchi Della Rocca S. Operational, denotational and logical descriptions: a case study. Fund. Inform. 16:(2):1992;149-169
17. Hindley R., Longo G. Lambda-calculus models and extensionality. Z. Math. Logik Grundlag. Math. 26:(4):1980;289-310
18. Honsell F., Lenisa M. Semantical analysis of perpetual strategies in λ-calculus. Theoret. Comput. Sci. 212:(1-2):1999;183-209
19. F. Honsell and S. Ronchi Della Rocca. A filter model for Ω. Technical report, Torino University, 1984.
20. Honsell F., Ronchi Della Rocca S. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci. 45:(1):1992;49-75
21. Intrigila B. A problem on easy terms in λ-calculus. Fund. Inform. 15.1:1991;99-106
22. G. Jacopini. A condition for identifying two elements of whatever model of combinatory logic. In C. Böhm, editor, λ-calculus and computer science theory, volume 37 of Lecture Notes in Comput. Sci., pages 213-219. Springer, Berlin, 1975.
23. Jacopini G., Venturini Zilli M. Easy terms in the lambda calculus. Fund. Inform. 80:1985;225-233
24. Kuper J. On the Jacopini technique. Inform. and Comput. 138:1997;101-123
25. Plotkin G.D. Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci. 121:(1-2):1993;351-409
26. Pottinger G. A type assignment for the strongly normalizable λ-terms. Hindley R., Seldin J. To H. B. Curry: essays on combinatory logic, lambda calculus and formalism. 1980;561-577 Academic Press, London
27. Pravato A., Ronchi S., Roversi L. The call-by-value lambda calculus: a semantic investigation. Math. Struct. in Comput. Sci. 9:(5):1999;617-650
28. D. Scott. Continuous lattices. In F. Lawvere, editor, Toposes, algebraic geometry and logic, volume 274 of Lecture Notes in Math., pages 97-136. Springer, Berlin, 1972.
29. Vickers S. Topology via logic. 1989;Cambridge University Press, Cambridge