See this document in CiteSeerX!

Approximation Theorems for Intersection Type  (Make Corrections)  
M. Dezani-Ciancaglini F. Honsell Y.Motohama March 20, 2001



  Home/Search   Context   Related

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

From:  di.unito.it/~dezani/papers/ (more)
(Enter author homepages)

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

Abstract: In this paper we prove that many intersection type theories of interest (including those which induce as filter models, Scott's and Park's D1 models, the models studied in Barendregt Coppo Dezani, Abramsky Ong, and Honsell Ronchi) satisfy an Approximation Theorem with respect to a suitable notion of approximant. This theorem implies that a -term has a type if and only if there exists an approximant of that term which has that type. We prove this result uniformly for all the intersection type... (Update)

Active bibliography (related documents):   More   All
0.8:   Filter Models and Easy Terms - F.Alessi, Dezani-Ciancaglini, Honsell (2001)   (Correct)
0.6:   Intersection Types and Lambda Models - Alessi, Barbanera, al. (2005)   (Correct)
0.6:   Characterising Strong Normalisation for Explicit.. - van Bakel.. (2002)   (Correct)

Similar documents based on text:   More   All
0.6:   Compositional Characterizations of λ-terms.. -.. (2000)   (Correct)
0.6:   Compositional Characterisations of λ-terms.. -.. (2003)   (Correct)
0.4:   A Complete Characterization of Complete Intersection-Type .. - Dezani-Ciancaglini, al.   (Correct)

BibTeX entry:   (Update)

@misc{ motohama-approximation,
  author = "Dezani-Ciancaglini Honsell Motohama",
  title = "Approximation Theorems for Intersection Type",
  url = "citeseer.ist.psu.edu/727120.html" }
Citations (may not include all citations):
729   The Lambda Calculus: its Syntax and Semantics (context) - Barendregt - 1984
245   A Compendium of Continuous Lattices (context) - Gierz, Hoffmann et al. - 1980
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
109   Continuous lattices (context) - Scott - 1972
75   Domain theory in logical form (context) - Abramsky - 1991
68   An extension of the basic functionality theory for the -calc.. (context) - Coppo, Dezani-Ciancaglini - 1980
64   A type assignment for the strongly normalizable -terms (context) - Pottinger - 1980
63   Principal type schemes and -calculus semantics (context) - Coppo, Dezani-Ciancaglini et al. - 1980
59   The relation between computational and denotational properti.. (context) - Wadsworth - 1976
55   call-by-value and the -calculus (context) - Plotkin - 1975
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
27   Set-theoretical and other elementary models of the -calculus - Plotkin - 1993
18   Dezani-Ciancaglini (context) - Coppo - 1987
14   Semantical analysis of perpetual strategies in - calculus (context) - Honsell, Lenisa - 1999
13   Some results on the full abstraction problem for restricted .. - Honsell, Lenisa - 1993
12   Foundation for Programmimg Languages (context) - Mitchell - 1996
11   Computational adequacy via `mixed' inductive definitions - Pitts - 1993
11   teoria dei domini e modelli del lambda calcolo (context) - Alessi - 1991
11   Set-theoretical models of -calculus: theories (context) - Longo - 1983
10   Characterization theorems for a filter lambda model (context) - della - 1982
10   An abstract notion of application (context) - Di Gianantonio, Honsell - 1993
9   The call-by-value lambda calculus: a semantic investigation - Pravato, della et al. - 1999
9   Open problem (context) - Scott - 1975
6   A complete characterization of the complete intersection-typ.. (context) - Dezani-Ciancaglini, Honsell et al. - 2000
2   On Church's formal theory of functions and functionals (context) - Longo - 1987
2   Compositional characterization of -terms using intersection .. (context) - Dezani-Ciancaglini, Honsell et al. - 2000
1   Dezani-Ciancaglini (context) - Alessi - 2000
1   Lecture notes on semantics and types (context) - della - 1998
1   combinator in Scott's -calculus models (context) - Park - 1976

Documents on the same site (http://www.di.unito.it/~dezani/papers/):   More
Intersection Types for λ-Trees - van Bakel, Barbanera.. (2000)   (Correct)
Type Preorders and Recursive Terms - Alessi, Dezani-Ciancaglini (2004)   (Correct)
A Distributed Object-Oriented Language with Session Types - Dezani-Ciancaglini..   (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