Comparing Approaches To Resolution Based Higher-Order Theorem Proving
- 1 October 2002
- journal article
- Published by Springer Nature in Synthese
- Vol. 133 (1-2) , 203-335
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Extensional Higher-Order Paramodulation and RUE-ResolutionLecture Notes in Computer Science, 1999
- Solving Higher-Order Equations1998
- Modular Higher-Order Equational PreunificationJournal of Symbolic Computation, 1996
- TPS: A theorem-proving system for classical type theoryJournal of Automated Reasoning, 1996
- Higher-order tableauxLecture Notes in Computer Science, 1995
- Higher-order rewrite systemsLecture Notes in Computer Science, 1995
- A combinatory logic approach to higher-order E-unification (extended abstract)Lecture Notes in Computer Science, 1992
- Modular higher-order E-unification1991
- Higher order E-unification1990
- On connections and higher-order logicJournal of Automated Reasoning, 1989