Term Assignment for Intuitionistic Linear Logic

Term Assignment for Intuitionistic Linear Logic (1992)

Cached

Download Links

by Nick Benton , Gavin Bierman , Valeria Paiva , Martin Hyland

Citations:

53 - 9 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Term Assignment for Intuitionistic Linear Logic	user correction - Legacy Corrections
AUTHOR NAME	Nick Benton	user correction
AUTHOR AFFIL	Computer Laboratory; University of Cambridge	user correction
AUTHOR NAME	Gavin Bierman	user correction
AUTHOR AFFIL	Computer Laboratory; University of Cambridge	user correction
AUTHOR NAME	Valeria Paiva	user correction
AUTHOR AFFIL	Computer Laboratory; University of Cambridge	user correction
AUTHOR NAME	Martin Hyland	user correction
AUTHOR AFFIL	Department of Pure Mathematics and Mathematical Statistics; University of Cambridge	user correction
ABSTRACT	In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system differs from previous calculi (e.g. that of Abramsky) and has two important properties which they lack. These are the substitution property (the set of valid deductions is closed under substitution) and subject reduction (reduction on terms is well-typed). We define a simple (but more general than previous proposals) categorical model for Intuitionistic Linear Logic and show how this can be used to derive the term assignment system. We also consider term reduction arising from cut-elimination in the sequent calculus and normalisation in natural deduction. We explore the relationship between these, as well as with the equations which follow from our categorical model.	user correction
YEAR	1992	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report 262	INFERENCE
CITATIONS	20 found	ParsCit 1.0