Intersection types and computational rules

Electronic Notes in Theoretical Computer Science

Volumn 84, Issue , 2003, Pages 45-59

  Alessi, Fabio ^a   Barbanera, Franco ^b   Dezani Ciancaglini, Mariangiola ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF CATANIA   (Italy)

^c NONE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; EMBEDDED SYSTEMS; FUNCTIONS; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; SEMANTICS;

FUNCTIONAL PROGRAMMING; LAMBDA CALCULUS; SEMANTIC DOMAIN MODELING; SUBJECT REDUCTION;

COMPUTATION THEORY;

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

References (25)

1. Abadi M., Cardelli L., Curien P.L., Levy J.-J. Explicit substitutions. J. of Functional Progr. 1:(4):1991;375-416
2. Abramsky S. Domain theory in logical form. Ann. Pure Appl. Logic. 51:(1-2):1991;1-77
3. Abramsky S., Luke Ong C.-H. Full abstraction in the lazy lambda calculus. Inform. and Comput. 105:(2):1993;159-267
4. Alessi F., Dezani-Ciancaglini M. Filter models and easy terms. ICTCS'01 volume 2202 of LNCS. 2001;17-37 Springer-Verlag
5. Alessi F., Lusin S. Simple easy terms. ITRS'02 volume 70 of ENTCS. 2002;Elsevier
6. Barendregt H., Coppo M., Dezani-Ciancaglini M. A filter lambda model and the completeness of type assignment. J. Symbolic Logic. 48:(4):1983;931-940
7. 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
8. Coppo M., Dezani-Ciancaglini M., Venneri B. Functional characters of solvable terms. Z. Math. Logik Grundlag. Math. 27:(1):1981;45-58
9. ∞-Lambda-models. Inform. and Comput. 72:(2):1987;85-116
10. Coppo M., Honsell F., Dezani-Ciancaglini M., Longo G. Extended type structures and filter lambda models. Logic colloquium '82. 1984;241-262 North-Holland
11. Curry H.B., Feys R. Combinatory Logic, volume I of Studies in Logic and the Foundations of Mathematics. 1958;North-Holland
12. Dezani-Ciancaglini M., Ghilezan S. Two behavioural lambda models. TYPES'02, volume 2646 of LNCS. 2003;127-147 Springer-Verlag
13. Dezani-Ciancaglini M., Honsell F., Motohama Y. Compositional characterization of λ-terms using intersection types. MFCS'00, volume 1893 of LNCS. 2000;304-313 Springer-Verlag
14. Engidi L., Honsell F., Ronchi S., Rocca Della. Operational, denotational and logical descriptions: a case study. Fund. Inform. 16:(2):1992;149-169
15. Engeler E. Algebras and combinators. Algebra Universalis. 13:(3):1981;389-392
16. Gierz G.K., Hoffmann K.H., Keimel K., Mislove J.D., Scott D.S. A Compendium of Continuous Lattices. 1980;Springer-Verlag
17. Honsell F., Lenisa M. Some results on the full abstraction problem for restricted lambda calculi. MFCS'93, volume 711 of LNCS. 1993;84-104 Springer-Verlag
18. Honsell F., Lenisa M. Semantical analysis of perpetual strategies in λ-calculus. Theoret. Comput. Sci. 212:(1-2):1999;183-209
19. Honsell F., Ronchi S., Rocca Della. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci. 45:(1):1992;49-75
20. Kamareddine F., Rios A., Wells J.B. Calculi of generalized beta-reduction and explicit substitution: Type free and simply typed versions. J. of Functional and Logic Progr. 5:1998;1-44
21. D. Park. The Y-combinator in Scott's λ-calculus models (revised version). Theory of Computation Report 13, Department of Computer Science, University of Warick, 1976.
22. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci. 1:(2):1975;125-159
23. Plotkin G.D. Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci. 121:(1-2):1993;351-409
24. Scott D.S. Continuous lattices. Toposes, algebraic geometry and logic volume 274 of LNM. 1972;97-136 Springer-Verlag
25. Scott D.S. Open problem. Lambda Calculus and Computer Science Theory, volume 37 of LNCS. 1975;369 Springer-Verlag