A Linear Logical View of Linear Type Isomorphisms

Authors:
Vincent Balat;Roberto Di Cosmo
Affiliations:
-;-
Venue:
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Year:
1999

Citing 9
Cited 0

Provable isomorphisms and domain equations in models of typed languages

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Theory and practice of sequential algorithms: the kernel of the applicative language CDS

Algebraic methods in semantics
Linear logic

Theoretical Computer Science
Type isomorphisms in a type-assignment framework

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design

Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
A Complete Axiom System for Isomorphism of Types in Closed Categories

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Type Isomorphisms for Module Signatures

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Retrieving Library Identifiers via Equational Matching of Types

Proceedings of the 10th International Conference on Automated Deduction
A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n))

CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of isomorphisms oft types has many theoretical as well as practical consequences, and isomorphisms of types have been investigated at length over the past years. Isomorphisms in weak system (like linear lambda calculus) have recently been investigated due to their practical interest in library search. In this paper we give a remarkably simple and elegant characterization of linear isomorphisms in the setting of Multiplicative Linear Logic (MLL), by making an essential use of the correctness criterion for Proof Nets due to Girard.