DeepAI AI Chat
Log In Sign Up

An extended type system with lambda-typed lambda-expressions

by   Matthias Weber, et al.
Berlin Institute of Technology (Technische Universität Berlin)

We present the system d, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. d extends existing lambda-typed systems by an existential abstraction operator as well as propositional operators. β-reduction is extended to also normalize negated expressions using a subset of the laws of classical negation, hence d is normalizing both proofs and formulas which are handled uniformly as functional expressions. d is using a reflexive typing axiom for a constant τ to which no function can be typed. Some properties are shown including confluence, subject reduction, uniqueness of types, strong normalization, and consistency. We illustrate how, when using d, due to its limited logical strength, additional axioms must be added both for negation and for the mathematical structures whose deductions are to be formalized.


page 1

page 2

page 3

page 4


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

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

Polymorphic System I

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

A Constructive Logic with Classical Proofs and Refutations (Extended Version)

We study a conservative extension of classical propositional logic disti...

The Delta-framework

We introduce the Delta-framework, LF-Delta, a dependent type theory base...

Adding Negation to Lambda Mu

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

Grammar construction methods for extended deterministic expressions

Extended regular expressions with counting and interleaving are widely u...

A Type Theory for Defining Logics and Proofs

We describe a Martin-Löf-style dependent type theory, called Cocon, that...