See this document in CiteSeerX!

βη-complete models for System F (2000)  (Make Corrections)  
Stefano Berardi, Chantal Berline



  Home/Search   Context   Related

 
View or download:
logique.jussieu.fr/www....Fcomplete.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  logique.jussieu.fr/www.be...index (more)
(Enter author homepages)

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

Abstract: We show that Friedman's proof of the existence of non-trivial βη-complete models of λ→ can be extended to system F. We isolate a set of conditions which are sufficient to ensure βη-completeness for a model of F (and α-completeness at the level of types), and we discuss which class of models we get. In particular, the model introduced in [5], having as polymorphic maps exactly all possible Scott continuous maps, is βη-complete and is hence the first... (Update)

Similar documents (at the sentence level):
5.8%:   βη-complete models for system F - Berardi, Berline (1998)   (Correct)

Active bibliography (related documents):   More   All
2.2:   Building continuous webbed models for System F - Berardi, Berline (2000)   (Correct)
0.5:   The Minimal Graph Model of Lambda Calculus - Bucciarelli, Salibra   (Correct)
0.5:   Games and Sequential Algorithms - Laird (2001)   (Correct)

Similar documents based on text:   More   All
0.1:   A New Model Construction for the Polymorphic Lambda Calculus - Spreen   (Correct)
0.1:   A presentation of the Curry-Howard Correspondance. - Berline (1997)   (Correct)
0.0:   A Separation of Syntactic and Nonsyntactic (1,+k)-Branching.. - Sieling   (Correct)

BibTeX entry:   (Update)

@misc{ berardi-betaetacomplete,
  author = "Stefano Berardi and Chantal Berline",
  title = "$\beta\eta$-complete models for System $F$",
  url = "citeseer.ist.psu.edu/article/berardi00betaetacomplete.html" }
Citations (may not include all citations):
982   Theoretical computer Science (context) - Girard, system et al. - 1986  ACM
325   Towards a Theory of Type Structure (context) - Reynolds - 1974  ACM   DBLP
162   Data Types as Lattices (context) - Scott - 1976  DBLP
50   Polymorphism is not set- theoretic (context) - Reynolds - 1973
39   Polymorphism is set-theoretic (context) - Pitts - 1987
33   Domain theoretic models of polymorphism - Coquand, Gunter et al. - 1989  ACM   DBLP
30   Types and Structures : an Introduction to Category Theory fo.. (context) - Asperti, Longo - 1991
23   A power domain for countable nondeterminism (context) - Plotkin - 1982
19   The genericity theorem and the notion of parametricity in th.. - Longo, Milsted et al. - 1993
17   elimination des coupures de l'arithmetique d'ordre superie.. (context) - Girard, etation - 1972
11   Parametric and Type-dependent Polymorphism - Longo - 1995  DBLP
10   Retraction dI Domain as Model TypeType (context) - on, Model et al. - 1991
6   Parametric Polymorphism (context) - O'Hearn - 1996
6   A Space of retracts (context) - Scott
5   Studies in Logic vol (context) - Barendregt, -calculus et al. - 1984
5   Une extension de l'interpretation de Godel a l'analyse (context) - Girard - 1975
5   denotational semantics for map Theory in ZFC+SI (context) - Berline, Grue - 1997
4   A logic for parametric polymorphism (context) - Abadi, Plotkin - 1993  ACM   DBLP
4   The nitary Projection Model for 2nd Order Calculus (context) - Amadio, Bruce et al. - 1986
3   School of articial intelligence (context) - Plotkin, Logical et al. - 1973
3   of Pure and Applied Logic (context) - Flagg, Lattices et al. - 1987
2   Categorical completeness results for the simply-typed - cal.. (context) - Simpson - 1995
2   A Finitary Retract Model for the Polymorphic -calculus (context) - McCracken - 1984
2   Invariance and -denability (context) - Staman - 1982
2   Uncountable limits and the lambda-calculus - Di Gianantonio, Honsell et al. - 1995
2   Lambda-denability and the full-type hierarchy (context) - Plotkin - 1980
1   etractions et Interpretation Interne du Polymorphisme : le P.. (context) - Berline - 1992
1   The semantics of 2nd order - calculus (context) - Bruce, Meyer et al. - 1990
1   and kinds = types; in preparation (context) - Berardi, Berline et al.
1   A full continuous model of polymorphism (context) - Barbanera, Berardi - 1997  ACM   DBLP

Documents on the same site (http://www.logique.jussieu.fr/www.berline/index.html):   More
A presentation of the Curry-Howard Correspondance. - Berline (1997)   (Correct)
βη-complete models for system F - Berardi, Berline (1999)   (Correct)
Building continuous webbed models for System F - Berardi, Berline (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