Samson Abramsky, Marina Lenisa  Home/Search
Context Related
| dcs.ed.ac.uk/home/wehr/apps...lenisa.ps 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: dcs.ed.ac.uk/home/we...proceeding (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an axiomatic characterization of models fully-complete for ML-polymorphic types of system F. This axiomatization is given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of suitable linear categories. Examples of adjoint models can be obtained from categories of Partial Equivalence Relations over Linear Combinatory Algebras. We show that a special linear combinatory algebra of partial involutions induces an hyperdoctrine which satisfies our... (Update)
Context of citations to this paper: More
.... completeness consists in showing that this model satisfies the axioms in the axiomatization of fully complete models for ML types given in [AL99a]. This axiomatization is given on the models of system F which are called hyperdoctrines ( Cro93] In particular, it works in the...
...a set of axioms on models of system F, sufficient to guarantee full completeness for ML types. This axiomatization is put to use in [AL99,AL00], in order to provide a concrete denotational model fully complete for the whole class of ML types. The axioms presented in this paper...
Cited by: More
Fully Complete Minimal PER Models for the Simply Typed.. - Abramsky, Lenisa (Correct)
Axiomatizing Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (2000) (Correct)
A Fully Complete PER Model for ML Polymorphic Types - Abramsky, Lenisa (2000) (Correct)
Similar documents (at the sentence level):
58.9%: Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (1999) (Correct)
Active bibliography (related documents): More All
0.5: Provable Isomorphisms of Types - Kim Bruce Roberto (1990) (Correct)
0.3: Games in the Semantics of Programming Languages - Abramsky (1997) (Correct)
0.3: Games And Definability For FPC - McCusker (1997) (Correct)
Similar documents based on text: More All
0.4: Geometry of Interaction and Linear Combinatory Algebras - Abramsky, Haghverdi, Scott (2000) (Correct)
0.2: Concurrent Games and Full Completeness - Samson Abramsky Lfcs (1998) (Correct)
0.2: New Foundations for the Geometry of Interaction - Abramsky, Jagadeesan (1993) (Correct)
Related documents from co-citation: More All
3: Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
3: Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
2: More universal game models of untyped -calculus: The bohm tree strikes back (context) - Ker, Nickau et al. - 1999
BibTeX entry: (Update)
S.Abramsky, M.Lenisa. Fully Complete Models for ML Polymorphic Types, Technical Report ECS-LFCS-99-414, LFCS, 1999 (available at http://www.dimi.uniud.it/~lenisa/Papers/Soft-copy-ps/lfcs99.ps.gz). http://citeseer.ist.psu.edu/article/abramsky99fully.html More
@misc{ abramsky99fully,
author = "S. Abramsky and M. Lenisa",
title = "Fully Complete Models for ML Polymorphic Types",
text = "S.Abramsky, M.Lenisa. Fully Complete Models for ML Polymorphic Types, Technical
Report ECS-LFCS-99-414, LFCS, 1999 (available at http://www.dimi.uniud.it/~lenisa/Papers/Soft-copy-ps/lfcs99.ps.gz).",
year = "1999",
url = "citeseer.ist.psu.edu/article/abramsky99fully.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
75 Annals of Pure and Applied Logic (context) - Abramsky, in - 1991
68 Towards a Geometry of Interaction (context) - Girard - 1989
66 What is a categorical Model of Intuitionistic Linear Logic - Bierman - 1995
58 A Logic for Parametric Polymorphism - Plotkin, Abadi - 1993
56 Game-theoretic analysis of call-by-value computation - Honda, Yoshida - 1997
50 New foundations for the Geometry of Interaction - Abramsky, Jagadeesan - 1994
42 Extended Type Structures and Filter Lambda Models (context) - Coppo, Dezani et al. - 1983
40 Full abstraction for functional languages with control - Laird - 1997
39 Retracing some paths (context) - Abramsky - 1996
38 Traced monoidal categories (context) - Joyal, Street et al. - 1996
38 Information and Computation - Hyland, Ong et al. - 1996
35 Cambridge University Press (context) - Crole, Types - 1993
31 Call-by-value games - Abramsky, McCusker - 1997
31 Games and full abstraction for FPC - McCusker - 1996
31 Concurrent Games and Full Completeness - Abramsky, Mellies - 1999
22 Full abstraction for idealized Algol with passive expression.. - Abramsky, McCusker - 1997
22 Extensional models for polymorphism (context) - Breazu-Tannen, Coquand - 1988
19 The Genericity Theorem and the Notion of Parametricity in th.. - Longo, Milsted et al. - 1992
19 Axioms for Full Abstraction and Full Completeness (context) - Abramsky - 1997
16 Monads and the Lambda Calculus (context) - Benton, Wadler - 1996
15 Algebraic types in PER models (context) - Hyland, Robinson et al. - 1990
7 sharing and state (context) - Abramsky, McCusker - 1997
5 and Complexity (context) - Abramsky, Combinators - 1996
5 Games and full abstraction for the lazy lambdacalculus - Abramsky, McCusker - 1995
5 Interpretation functionelle et elimunation des coupures de l.. (context) - Girard - 1972
4 Geometry of Interaction and Models of Combinatory Logic (context) - Abramsky, Haghverdi et al. - 1998
4 Games and Definability for system F (context) - Hughes - 1997
4 the Symposium Logical Foundations for Computer Science (context) - Nickau, functionals et al. - 1994
2 Linear Parametricy (context) - Plotkin - 1993
2 Realizability models based on hystory-free strategies (context) - Abramsky, Longley - 1999
2 Types ad Structures: An introduction to category theory for .. (context) - Asperti, Longo - 1991
2 Parametric Polymorphism (context) - Abramsky, Lenisa et al.
1 Game Semantics for Untyped #-calculus (context) - Di Gianantonio, Franco et al. - 1999
1 More Universal Game Models of Untyped #-Calculus: The Bohm T.. (context) - Ker, Nickau et al. - 1999
Documents on the same site (http://www.dcs.ed.ac.uk/home/wehr/appsem_proceeding/proceeding.html): More
A Linear-time Algorithm for Verifying MLL Proof Nets via.. - Murawski, Ong (1999) (Correct)
Monadic Encapsulation of Effects: a Revised Approach.. - Moggi, Palumbo (1999) (Correct)
Gray Code Representation of Exact Real Numbers - Tsuiki (1999) (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