37 search results - page 8 / 8 » Towards Structurally-Free Theorem Proving |
CADE
2005
Springer
14 years 5 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...