DeepAI AI Chat
Log In Sign Up

A type-assignment of linear erasure and duplication

by   Gianluca Curzi, et al.

We introduce LEM, a type-assignment system for the linear λ-calculus that extends second-order IMLL_2, i.e., intuitionistic multiplicative Linear Logic, by means of logical rules that weaken and contract assumptions, but in a purely linear setting. LEM enjoys both a mildly weakened cut-elimination, whose computational cost is cubic, and Subject reduction. A translation of LEM into IMLL_2 exists such that the derivations of the former can exponentially compress the dimension of the derivations in the latter. LEM allows for a modular and compact representation of boolean circuits, directly encoding the fan-out nodes, by the contraction, and disposing garbage, by the weakening. It can also represent natural numbers with terms very close to standard Church numerals which, moreover, apply to Hereditarily Finite Permutations, i.e. a group structure that exists inside the linear λ-calculus.


page 1

page 2

page 3

page 4


Adding Negation to Lambda Mu

We present L, an extension of Parigot's λμ-calculus by adding negation a...

Linear Additives

We introduce 𝖫𝖠𝖬, a subsystem of 𝖨𝖬𝖠𝖫𝖫_2 with restricted additive rules ...

Infinitary Action Logic with Exponentiation

We introduce infinitary action logic with exponentiation—that is, the mu...

Probabilistic Soft Type Assignment

We model randomized complexity classes in the style of Implicit Computat...

Comparing and evaluating extended Lambek calculi

Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus,...

First order linear logic and tensor type calculus for categorial grammars

We study relationship between first order multiplicative linear logic (M...