Classical isomorphisms of types

Authors:
Olivier Laurent
Affiliations:
Preuves Programmes Systèmes, CNRS – Université Paris VII, UMR 7126 – Case 7014, 2, place Jussieu – 75251 Paris Cedex 05 – FRANCE
Venue:
Mathematical Structures in Computer Science
Year:
2005

Citing 11
Cited 5

Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
LKQ and LKT

Proceedings of the workshop on Advances in linear logic
Full abstraction for idealized Algol with passive expressions

Theoretical Computer Science - Special issue on linear logic, 1
Efficient and flexible matching of recursive types

Information and Computation
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Believe it or not, AJM's games model is a model of classical linear logic

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science
Syntax vs. semantics: a polarized approach

Theoretical Computer Science - Game theory meets theoretical computer science
Retracts in simple types

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Syntax vs. semantics: a polarized approach

Theoretical Computer Science - Game theory meets theoretical computer science
Focusing and higher-order abstract syntax

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Isomorphisms of Intersection Types

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Least and Greatest Fixpoints in Game Semantics

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On isomorphisms of intersection types

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.