A Proof of Weak Termination of Typed lambda-sigma-Calculi.

Jean Goubault-Larrecq

Published in: TYPES (1996)

Keyphrases

lambda calculus
sequent calculi
theorem proving
term rewriting
higher order
theorem prover
predicate calculus
programming language
knowledge base
data sets
qualitative spatial
decision procedures
databases
complete axiomatization
proof theory
reasoning problems
search space
inference rules
modal logic
query language