Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

MSCS
2000

favoriteEmaildiscussreport

126views more MSCS 2000»

Sequent combinators: a Hilbert system for the lambda calculus

13 years 4 months ago

Sequent combinators: a Hilbert system for the lambda calculus

Download www.lfcs.inf.ed.ac.uk

This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the more widespread adoption of natural deduction systems in computer science. This suggests that Hilbert systems, with their more uniform approach to meta-variables and substitution, may be a more suitable framework than lambda calculus for type theories and programming languages.

Healfdene Goguen, Jean Goubault-Larrecq

Real-time Traffic

Hilbert Systems | Lambda Calculus | MSCS 2000 | Sequent Combinators |

claim paper

Related Content

» Combining Derivations and Refutations for Cutfree Completeness in Biintuitionistic Logic

» Modular Sequent Systems for Modal Logic

» Eliminating Proofs from Programs

» A Systematic Proof Theory for Several Modal Logics

» A Proof Calculus Which Reduces Syntactic Bureaucracy

» ForcingBased CutElimination for GentzenStyle Intuitionistic Sequent Calculus

» Fusion of sequent modal logic systems labelled with truth values

» Regaining cut admissibility in deduction modulo using abstract completion

» Structured Sequent Calculi for Combining Intuitionistic and Classical FirstOrder Logic

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	MSCS
Authors	Healfdene Goguen, Jean Goubault-Larrecq

Comments (0)