Classical isomorphisms of types

@article{Laurent2005ClassicalIO,
  title={Classical isomorphisms of types},
  author={Olivier Laurent},
  journal={Mathematical Structures in Computer Science},
  year={2005},
  volume={15},
  pages={969-1004}
}
The study of isomorphisms of types has, in the main, been carried out in an intuitionistic setting. We extend some of this work to classical logic for both call-by-name and call-by-value computations by means of polarised linear logic and game semantics. This leads to equational characterisations of these isomorphisms for all the propositional connectives. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Isomorphisms of Types in the Presence of Higher-Order References

  • Pierre Clairambault
  • Mathematics, Computer Science
  • 2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Focusing and higher-order abstract syntax

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Contextual isomorphisms

VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Strong functors and interleaving fixpoints in game semantics

VIEW 1 EXCERPT
CITES BACKGROUND

Intuitionistic Dual-intuitionistic Nets

Isomorphisms of Types in the Presence of Higher-Order References

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Game semantics for first-order logic

  • Olivier Laurent
  • Mathematics, Computer Science
  • Logical Methods in Computer Science
  • 2010

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Remarks on isomorphisms in typed lambda calculi with empty and sum types

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The category of finite sets and cartesian closed categories

  • Sergei Soloviev
  • Journal of Soviet Mathematics,
  • 1983
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Syntax vs. semantics: A polarized approach

VIEW 2 EXCERPTS

Retracts in Simple Types

VIEW 1 EXCERPT

A Linear Logical View of Linear Type Isomorphisms

VIEW 2 EXCERPTS

Call-by-Push-Value: A Subsuming Paradigm

VIEW 1 EXCERPT

Concurrent games and full completeness

VIEW 1 EXCERPT

A fully abstract game semantics for general references

VIEW 1 EXCERPT