Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting.
Michael FärberPublished in: CPP (2022)
Keyphrases
- presburger arithmetic
- algebraic structure
- natural deduction
- automated theorem proving
- sequent calculus
- type checking
- proof search
- theorem prover
- lambda calculus
- linear logic
- proof procedure
- provably correct
- theorem proving
- cut elimination
- fixed point
- quantifier elimination
- database query languages
- neural network
- rewriting rules
- proof theoretic
- rewrite rules
- first order logic
- inference rules
- computer algebra
- mutual exclusion
- formal language
- consistency checking