Tailoring filter models

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

Volumn 3085, Issue , 2004, Pages 17-33

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

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF CATANIA   (Italy)

^c Dipartimento di Informatica   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

CONTINUOUS FUNCTIONS; FILTER MODEL; LAMBDA CALCULUS; PREORDERS;

DIFFERENTIATION (CALCULUS);

EID: 33644930188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24849-1_2     Document Type: Article

References (23)

1. Samson Abramsky and C.-H. Luke Ong. Full abstraction in the lazy lambda calculus. Inform, and Comput., 105(2):159-267,1993.
2. Fabio Alessi. The category p-sfp. Internal Report n. 27/96/RR, Dipartimento di Matematica e Informatica, University of Udine, 1996.
3. Fabio Alessi, Franco Barbanera, and Mariangiola Dezani-Ciancaglini. Intersection types and computational rules. In Ruy de Queiroz, Elaine Pimentel, and Lucilia Figueiredo, editors, WoLLIC'03, volume 84 of El. Notes in Theoret. Comput. Sci. Elsevier, 2003.
4. Fabio Alessi, Mariangiola Dezani-Ciancaglini, and Furio Honsell. A complete characterization of complete intersection-type preorders. ACM Trans, on Comput. Logic, 4(1):120-147, 2003.
5. Fabio Alessi, Mariangiola Dezani-Ciancaglini, and Stefania Lusin. Intersection types and domain operators. Theoret. Comput. Sci., 2004. to appear.
6. Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symbolic Logic, 48(4):931-940 (1984), 1983.
7. Chantai Berline. From computation to foundations via functions and application: The Acalculus and its webbed models. Theoret. Comput. Sci., 249:81-161,2000.
8. Mario Coppo, Mariangiola Dezani-Ciancaglini, Furio Honsell, and Giuseppe Longo. Extended type structures and filter lambda models. In Gabriele Lolli, Giuseppe Longo, and Anna Lisa Marcja, editors, Logic colloquium '82, pages 241-262. North-Holland, Amsterdam, 1984.
9. Mario Coppo, Mariangiola Dezani-Ciancaglini, and Betti Venneri. Functional characters of solvable terms. Z. Math. Logik Grundlag. Math., 27(l):45-58, 1981.
10. Mario Coppo, Mariangiola Dezani-Ciancaglini, and Maddalena Zacchi. Type theories, normal forms, and D∞-lambda-models. Inform, and Comput., 72(2):85-116,1987.
11. Haskeil B. Curry and Robert Feys. Combinatory Logic, volume I of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1958.
12. Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, and Silvia Likavec. Behavioural inverse limit models. Theoret. Comput. Sci., 2004. to appear.
13. Mariangiola Dezani-Ciancaglini, Furio Honsell, and Yoko Motohama. Compositional characterization of λ-terms using intersection types. Theoret. Comput. Sci., 2004. to appear.
14. Lavinia Egidi, Furio Honsell, and Simona Ronchi Delia Rocca. Operational, denotational and logical descriptions: a case study. Fund. Inform., 16(2): 149-169, 1992.
15. Gerhard K. Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, and Dana S. Scott. A Compendium of Continuous Lattices. Springer-Verlag, Berlin, 1980.
16. Roger Hindley and Giuseppe Longo. Lambda-calculus models and extensionality. Z. Math. Logik Grundlag. Math., 26(4):289-310, 1980.
17. Furio Honsell and Marina Lenisa. Semantical analysis of perpetual strategies in λ-calculus. Theoret. Comput. Sci., 212(1-2):183-209, 1999.
18. Furio Honsell and Simona Ronchi Delia Rocca. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci., 45(l):49-75, 1992.
19. Peter T. Johnstone. Stone spaces. Cambridge University Press, Cambridge, 1986. Reprint of the 1982 edition.
20. Albert R. Meyer. What is a model of the lambda calculus? Inform, and Control, 52( 1):87-122, 1982.
21. Gordon D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci., 1(2):125-159, 1975.
22. Gordon D. Plotkin. Set-theoretical and other elementary models of the λ-calculus. Theoret. Comput. Sci., 121(1-2):351-409, 1993.
23. Dana S. Scott. Open problem. In Corrado Böhm, editor, Lambda Calculus and Computer Science Theory, volume 37 of Lecture Notes in Computer Science, page 369. Springer-Verlag, Berlin, 1975.