Adding Negation to Lambda Mu

by   Steffen van Bakel, et al.

We present L, an extension of Parigot's λμ-calculus by adding negation as a type constructor, together with syntactic constructs that represent negation introduction and elimination. We will define a notion of reduction that extends λμ's reduction system with two new reduction rules, and show that the system satisfies subject reduction. Using Aczel's generalisation of Tait and Martin-Löf's notion of parallel reduction, we show that this extended reduction is confluent. Although the notion of type assignment has its limitations with respect to representation of proofs in natural deduction with implication and negation, we will show that all propositions that can be shown in there have a witness in L. Using Girard's approach of reducibility candidates, we show that all typeable terms are strongly normalisable, and conclude the paper by showing that type assignment for L enjoys the principal typing property.


page 1

page 2

page 3

page 4


Polymorphic System I

System I is a simply-typed lambda calculus with pairs, extended with an ...

A type-assignment of linear erasure and duplication

We introduce LEM, a type-assignment system for the linear λ-calculus tha...

Intersection Types for the Computational lambda-Calculus

We study polymorphic type assignment systems for untyped lambda-calculi ...

Linear Additives

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

An extended type system with lambda-typed lambda-expressions (extended version)

We present the type system d, an extended type system with lambda-typed ...

An extended type system with lambda-typed lambda-expressions

We present the system d, an extended type system with lambda-typed lambd...

Syzygies among reduction operators

We introduce the notion of syzygy for a set of reduction operators and r...

Please sign up or login with your details

Forgot password? Click here to reset