Superdeduction in Lambda-Bar-Mu-Mu-Tilde
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term language and a cut-elimination reduction already exist for supe...
Main Author: | Clément Houtmann |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-01-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1101.5443v1 |
Similar Items
-
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi
by: Peter Battyanyi, et al.
Published: (2017-09-01) -
Adding Negation to Lambda Mu
by: Steffen van Bakel
Published: (2023-05-01) -
First measurement of the ratio of branching fractions B(Lambda(0)(b) -> Lambda(+)(c) mu(-) (nu)over-bar(mu))/B(Lambda(0)(b) -> Lambda(+)(c) pi(-))
by: Aaltonen, T, et al.
Published: (2009) -
Sound and Complete Typing for lambda-mu
by: Steffen van Bakel
Published: (2011-01-01) -
Intersection Types for the lambda-mu Calculus
by: Steffen van Bakel, et al.
Published: (2018-01-01)