|
738
|
A machine-oriented logic based on the resolution principle
– Robinson
- 1965
|
|
263
|
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
– Miller
- 1991
|
|
178
|
A unification algorithm for typed -calculus
– Huet
- 1975
|
|
95
|
Unification under a mixed prefix
– Miller
- 1992
|
|
71
|
Theorem proving with ordering and equality constrained clauses
– Nieuwenhuis, Rubio
- 1995
|
|
50
|
On Connections and HigherOrder Logic
– Andrews
- 1989
|
|
49
|
Functional unification of higher-order patterns
– Nipkow
- 1993
|
|
36
|
Solving Higher-Order Equations: From Logic to Programming
– Prehofer
- 1995
|
|
30
|
A mechanization of type theory
– Huet
- 1973
|
|
29
|
A Proof Theory for General Unification
– Snyder
- 1991
|
|
22
|
SPASS Version 0.49
– Weidenbach
- 1997
|
|
21
|
A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle
– Kohlhase
- 1994
|
|
20
|
The Clausal Theory of Types
– Wolfram
- 1993
|
|
19
|
The undecidability of unification in third order logic
– Huet
- 1973
|
|
13
|
Higher-Order Tableaux
– Kohlhase
- 1995
|
|
13
|
A unifying principle in quantification theory
– Smullyan
- 1963
|
|
10
|
Reduction and unification in lambda calculi with subtypes
– Nipkow, Qian
- 1992
|
|
8
|
Modular Higher-Order E-Unification
– Nipkow, Qian
- 1991
|
|
7
|
A recursive path ordering for higher-order terms in j-long fi-normal form
– Jouannaud, Rubio
- 1996
|
|
6
|
A complete mechanization of second-order type theory
– Pietrzykowski
- 1973
|
|
5
|
H.: Boolean Properties of Sets
– Trybulec
- 1990
|
|
5
|
A semantics for -prolog
– Wolfram
- 1994
|
|
4
|
Higher order E-unification
– Snyder
- 1990
|
|
3
|
Paramodulation and TP in first order theories with equality
– Robinson, Wos
- 1969
|
|
2
|
An LPO-based termination ordering for higher-order terms without λ-abstraction
– Lifantsev, Bachmair
- 1998
|
|
1
|
A complete mechanization of (Omega)-order type theory
– Jensen, Pietrzykowski
- 1972
|
|
1
|
Rewrite orderings for higher-order terms in j-lon fi-normal form and the recursive path ordering. Theoretical Computer Science
– Jouannaud, Rubio
- 1998
|
|
1
|
Theory and practice of minimal modular higher-order E-unification
– Muller, Weber
- 1994
|
|
