Proofs of the normalization and Church-Rosser theorems for the typed λ-calculus.
Garrel PottingerPublished in: Notre Dame J. Formal Log. (1978)
Keyphrases
- sequent calculus
- cut elimination
- proof search
- inference rules
- natural deduction
- linear logic
- higher order
- wide class
- modal logic
- theorem prover
- theorem proving
- lambda calculus
- preprocessing
- automated theorem proving
- complex objects
- normalization method
- proof procedure
- computer algebra
- databases
- logic programming
- sufficient conditions
- decision procedures
- database systems
- case study
- web services
- real time