Login / Signup

The Church-Rosser theorem for the typed λ-calculus with surjective pairing.

Garrel Pottinger
Published in: Notre Dame J. Formal Log. (1981)
Keyphrases
  • lambda calculus
  • higher order
  • database query languages
  • information systems
  • genetic algorithm
  • programming language
  • digital topology
  • sequent calculus
  • fixed order
  • machine learning
  • knowledge base