See this document in CiteSeerX!

A Complete Characterization of Complete Intersection-Type Theories (Extended Abstract)  (Make Corrections)  
M. Dezani-Ciancaglini, et al.
ICALP Satellite Workshops



  Home/Search   Context   Related

 
View or download:
di.unito.it/~dezani/papers/17.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.unito.it/cgi...ibsearch_lambda (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: M. DEZANI-CIANCAGLINI Universita di Torino, Italy F. HONSELL Universita di Udine, Italy F. ALESSI Universita di Udine, Italy Abstract We characterize those intersection-type theories which yield complete intersection-type assignment systems for l-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics and the F-semantics. Keywords Lambda Calculus, Intersection Types, Semantic Completeness, Filter... (Update)

Similar documents (at the sentence level):
14.6%:   A Complete Characterization of Complete.. - Dezani-Ciancaglini, ..   (Correct)

Active bibliography (related documents):   More   All
0.8:   Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)   (Correct)
0.7:   Intersection Types and Lambda Theories - Dezani-Ciancaglini, Lusin   (Correct)
0.3:   Discrimination by Parallel Observers: the Algorithm - Dezani-Ciancaglini, Tiuryn, .. (1998)   (Correct)

Similar documents based on text:   More   All
0.7:   Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002)   (Correct)
0.6:   Compositional Characterisations of λ-terms.. -.. (2003)   (Correct)
0.4:   Approximation Theorems for Intersection Type - Dezani-Ciancaglini Honsell..   (Correct)

BibTeX entry:   (Update)

@inproceedings{ dezaniciancaglini00complete,
    author = "Mariangiola Dezani-Ciancaglini and Furio Honsell and Fabio Alessi",
    title = "A Complete Characterization of the Complete Intersection-Type Theories",
    booktitle = "{ICALP} Satellite Workshops",
    pages = "287-302",
    year = "2000",
    url = "citeseer.ist.psu.edu/386903.html" }
Citations (may not include all citations):
162   Data types as lattices (context) - Scott - 1976
137   A filter lambda model and the completeness of type assignmen.. (context) - Barendregt, Coppo et al. - 1983
130   Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993
96   Polymorphic type inference and containment (context) - Mitchell - 1988
75   Domain theory in logical form (context) - Abramsky - 1991
73   Topology via logic (context) - Vickers - 1989
54   Functional characters of solvable terms (context) - Coppo, Dezani-Ciancaglini et al. - 1981
42   Extended type structures and filter lambda models (context) - Coppo, Honsell et al. - 1984
35   Complete restrictions of the intersection type discipline - van Bakel - 1992
35   An approximation theorem for topological lambda models and t.. (context) - Honsell, Della - 1992
30   denotational and logical descriptions: a case study (context) - Egidi, Honsell et al. - 1992
30   Algebras and combinators (context) - Engeler - 1981
12   Lambda Calculus: some models (context) - Scott - 1980
10   Semantic techniques for deriving coinductive characterizatio.. - Lenisa - 1997
6   An extension of the basic functionality theory for the l-cal.. (context) - Coppo, Dezani-Ciancaglini - 1980
6   The simple semantics for Coppo--Dezani--Salle types (context) - Hindley - 1982
5   calculus and applications (context) - Barendregt, l- - 2000
3   complete type assignments (context) - Dezani-Ciancaglini, Margaria et al. - 1986
3   algebraic geometry and logic (context) - Scott, lattices - 1972
2   Set-theoretical and other elementary models of the l-calculu.. (context) - Plotkin - 1993
1   Letter to Albert Meyer (context) - Scott - 1980
1   Dezani-Ciancaglini and M (context) - Coppo - 1987
1   Curry's types are complete with respect to the Fsemantics to.. (context) - Hindley - 1983
1   The completeness theorem for typing l-terms (context) - Hindley - 1983
1   Lambda Calculus and Computer Science Theory (context) - Scott, problem - 1975
1   Semantical analysis of perpetual strategies in l-calculus (context) - Honsell, Lenisa - 1999

Documents on the same site (http://www.di.unito.it/cgi-bin/bibliography/bibsearch_lambda):   More
Principal Typing for Parallel and non-Deterministic .. - Aoun, Barbanera.. (1997)   (Correct)
A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997)   (Correct)
Infinite lambda-calculus and Types - Berarducci, Dezani-Ciancaglini (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC