Axiomatizing Fully Complete Models for ML Polymorphic Types

  title={Axiomatizing Fully Complete Models for ML Polymorphic Types},
  author={Samson Abramsky and Marina Lenisa},
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. co-Kleisli 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 trees from… 

Linear realizability and full completeness for typed lambda-calculi

Genericity and the pi-Calculus

A second-order polymorphic π-calculus based on duality principles is introduced, which allows precise embedding of generic sequential functions as well as seamless integration with imperative constructs such as state and concurrency.

Sequentiality and the π-Calculus

The result shows how a typed π-calculus can be used as a descriptive tool for a significant class of programming languages without losing the latter’s semantic properties.

Genericity and the π-calculus

A second-order polymorphic π-calculus based on duality principles is introduced, building on type structures coming from typed ρ-calculi, Linear Logic and game semantics, and the proof combines process-theoretic reasoning with techniques from game semantics.

An Algebraic Account of References in Game Semantics



Fully Complete Models for ML Polymorphic Types

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.

Axioms for definability and full completeness

  • S. Abramsky
  • Computer Science
    Proof, Language, and Interaction
  • 2000
Axioms are presented which encapsulate the properties satisfied by categories of games which form the basis of results on full abstraction for PCF and other programming languages, and on full

Extensional Models for Polymorphism

Linear logic, monads and the lambda calculus

  • Nick BentonP. Wadler
  • Philosophy, Computer Science
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
Models of intuitionistic linear logic also provide models of Moggi's computational metalanguage and the adjoint presentation of these models and the associated adjoint calculus is used to show that three translations of the lambda calculus into the computational metalanguages correspond exactly to three translations, due mainly to Girard, of intuitionist logic into intuitionisticlinear logic.

Full Abstraction for PCF

The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.

Full abstraction for functional languages with control

  • J. Laird
  • Computer Science
    Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
  • 1997
A fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games is defined.

Games and full completeness for multiplicative linear logic

It is shown that this semantics yields a categorical model of Linear Logic and proves full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net.

Polymorphic Linear Logic and Topos Models

We give a deenition of a \linear bration", which is a hyperdoctrine model of polymorphic linear logic, and show how to internalise the bration, generating topos models. This gives a constructive set

Algebraic Types in PER Models

Several different PER models are examined, and Huet's conjecture that the interpretations of a class of types in the PER model on the natural numbers for the second-order lambda calculus are in a certain sense the initial algebras are examined.

Hereditarily Sequential Functionals

In order to define models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions of sequentiality, stability and seriality were