Samson Abramsky, Marina Lenisa  Home/Search
Context Related
| dimi.uniud.it/~lenisa/Pa...mfcs00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dimi.uniud.it/~leni...listpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present axioms on models of system F, which are sufficient to show full completeness for ML-polymorphic types. These axioms are given for hyperdoctrine models, which arise as adjoint models, i.e. coKleisli categories of linear categories. Our axiomatization consists of two crucial steps. First, we axiomatize the fact that every relevant morphism in the model generates, under decomposition, a possibly infinite typed Bohm tree. Then, we introduce an axiom which rules out infinite ... (Update)
Context of citations to this paper: More
...[21] substantially simplify Hughes approach, but do not obtain full abstraction for impredicative polymorphism. Abramsky and Lenisa [3, 4] give a fully abstract model for predicative polymorphism using interaction combinators. Treatment of impredicative polymorphism is left as...
...[29] substan tially simplify Hughes approach, but do not obtain full abstraction for impred icative polymorphism. Abramsky and Lenisa [5, 6] give a fully abstract model for predicative polymorphism using interaction combinators. Treatment of impredicative polymorphism is...
Cited by: More
Genericity and the π-Calculus - Berger, Honda, Yoshida (Correct)
Genericity and the pi-Calculus - Berger, Honda, Yoshida (Correct)
Similar documents (at the sentence level):
34.1%: Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (1999) (Correct)
12.9%: A Fully Complete PER Model for ML Polymorphic Types - Abramsky, Lenisa (2000) (Correct)
Active bibliography (related documents): More All
0.5: A Game Semantics For Generic Polymorphism - Abramsky, Jagadeesan (1971) (Correct)
0.4: A Game Semantics for Generic Polymorphism - Samson Abramsky And (2003) (Correct)
0.4: Fully Complete Minimal PER Models for the Simply Typed.. - Abramsky, Lenisa (Correct)
Similar documents based on text: More All
0.4: Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (Correct)
0.4: A Categorical Semantics of Quantum Protocols - Samson Abramsky And (2004) (Correct)
0.3: Coalgebraic Coinduction in (Hyper)set-theoretic Categories - Honsell, Lenisa (2000) (Correct)
Related documents from co-citation: More All
7: Game-theoretic Analysis of Call-by-value Computation - Honda, Yoshida - 1997
6: Sequentiality and the -Calculus (context) - Berger, Honda et al. - 2044
4: A Fully Complete PER Model for ML Polymorphic Types - Abramsky, Lenisa - 2000
BibTeX entry: (Update)
Abramsky, S., and Lenisa, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000). http://citeseer.ist.psu.edu/abramsky00axiomatizing.html More
@inproceedings{ abramsky00axiomatizing,
author = "Samson Abramsky and Marina Lenisa",
title = "Axiomatizing Fully Complete Models for {ML} Polymorphic Types",
booktitle = "Mathematical Foundations of Computer Science",
pages = "141-151",
year = "2000",
url = "citeseer.ist.psu.edu/abramsky00axiomatizing.html" }
Citations (may not include all citations):175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1994
144 Full Abstraction for PCF - Abramsky, Jagadeesan et al. - 1996
68 On full abstraction for PCF (context) - Hyland, Ong - 1996
66 What is a categorical Model of Intuitionistic Linear Logic - Bierman - 1995
51 autonomous categories and cofree coalgebras (context) - Seely - 1987
40 Full abstraction for functional languages with control - Laird
35 Cambridge University Press (context) - Crole, Types - 1993
34 Equality in hyperdoctrines and the comprehension schema as a.. (context) - Lawvere - 1970
31 Games and full abstraction for FPC - McCusker
31 Concurrent Games and Full Completeness - Abramsky, Mellies
22 Full abstraction for idealized Algol with passive expression.. - Abramsky, McCusker - 1999
22 Extensional models for polymorphism (context) - Breazu-Tannen, Coquand - 1988
16 Monads and the Lambda Calculus (context) - Benton, Wadler - 1996
15 A Fully Complete PER Model for ML Polymorphic Types - Abramsky, Lenisa - 2000
15 Algebraic types in PER models (context) - Hyland, Robinson et al. - 1990
12 Polymorphism is set-theoretic constructively (context) - Pitts - 1988
7 Foundations of Computing Series (context) - Asperti, Longo et al. - 1991
5 Interpr'etation functionelle et 'elimunation des coupures de.. (context) - Girard - 1972
4 Hypergame Semantics: Full Completeness for System F (context) - Hughes - 1999
4 the Symposium Logical Foundations for Computer Science (context) - Nickau, functionals et al. - 1994
3 Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa - 1999
1 Axioms for Definability and Full Completeness - Abramsky - 2000
1 Polymorphic linear logic and topos models - Seely - 1990
Documents on the same site (http://www.dimi.uniud.it/~lenisa/Papers/list-papers.html): More
Semantic Techniques for Deriving Coinductive Characterizations of .. - Lenisa (1997) (Correct)
Some Results on the Full Abstraction Problem for Restricted.. - Honsell, Lenisa (1993) (Correct)
A Uniform Syntactical Method for Proving Coinduction Principles.. - Lenisa (1997) (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