Sciweavers

Share
MSCS
2000

Sequent combinators: a Hilbert system for the lambda calculus

8 years 10 months ago
Sequent combinators: a Hilbert system for the lambda calculus
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
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where MSCS
Authors Healfdene Goguen, Jean Goubault-Larrecq
Comments (0)
books