Download:
|
by Healfdene Goguen
Mathematical Structures in Computer Science
http://www.dcs.ed.ac.uk/lfcsreps/EXPORT/97/ECS-LFCS-97-357/ECS-LFCS-97-357.ps.gz
Add To MetaCart
Abstract:
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. 1
Citations
|
621
|
A formulation of the simple theory of types, The
– Church
- 1940
|
|
341
|
Explicit substitutions
– Abadi, Cardelli, et al.
- 1990
|
|
309
|
Introduction to Higher Order Categorical Logic
– Lambek, Scott
- 1986
|
|
269
|
Proofs and Types
– Girard, Lafont, et al.
- 1989
|
|
173
|
A new implementation technique for applicative languages
– Turner
- 1979
|
|
169
|
Investigations into logical deduction
– Gentzen
- 1969
|
|
115
|
1975] An Intuitionistic theory of types; predicative part
– Martin-Löf
|
|
111
|
Efficient compilation of lazy evaluation
– Johnsson
- 1984
|
|
95
|
The Implementation of Functional Programming Languages
– Peyton-Jones
- 1987
|
|
79
|
Categorical combinators, sequential algorithms and functional programming, Birkhauser
– Curien
- 1993
|
|
74
|
Higher-order unification via explicit substitutions
– Dowek, Hardin, et al.
- 1995
|
|
69
|
Introduction to Mathematical Logic
– Church
- 1956
|
|
34
|
Super-combinators: a New Implementation Method for Applicative Languages
– Hughes
- 1982
|
|
32
|
Extending a � -calculus with explicit substitutions which preserves strong normalization into a confluent calculus of open terms
– Kamareddine, Rios
- 1997
|
|
23
|
Typed operational semantics
– Goguen
- 1995
|
|
17
|
A proof of strong normalization for the theory of constructions using a Kripke-like interpretation
– Coquand, Gallier
- 1990
|
|
13
|
Director strings as combinators
– Kennaway, Sleep
- 1988
|
|
8
|
Higher-order unification via combinators
– Dougherty
- 1993
|
|
8
|
Inductive data types: Well-ordering types revisited
– Goguen, Luo
- 1992
|
|
8
|
Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms
– Kamareddine, Ríos
- 1997
|
