|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
124
|
The undecidability of the second-order unification problem
– W D Goldfarb
- 1981
|
|
176
|
An Overview of *Prolog
– G Nadathur, D Miller
- 1988
|
|
109
|
Unification under a mixed prefix
– Dale Miller
- 1992
|
|
70
|
Elf: A Language for Logic Definition and Verified Metaprogramming
– Frank Pfenning
- 1989
|
|
278
|
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem
– N. G. De Bruijn
- 1972
|
|
169
|
A unication algorithm for typed calculus
– G Huet
- 1975
|
|
172
|
Logic Programming in the LF Logical Framework
– Frank Pfenning
- 1991
|
|
317
|
An Efficient Unification Algorithm
– Alberto Martelli, Ugo Montanari
- 1982
|
|
335
|
Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
- 1991
|
|
97
|
A unification algorithm for typed λ-calculus
– G P Huet
- 1975
|
|
84
|
An Overview of λProlog
– Gopalan Nadathur, Dale Miller
- 1988
|
|
14
|
Higher Order Unification Revisited: Complete Sets of Transformations
– W Snyder, J H Gallier
- 1989
|
|
28
|
An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs
– Spiro Michaylov, Frank Pfenning
- 1992
|
|
359
|
Explicit substitutions
– M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy
- 1996
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
56
|
Unification and Anti-Unification in the Calculus of Constructions
– Frank Pfenning
- 1991
|
|
119
|
Higher-order critical pairs
– T Nipkow
- 1991
|
|
728
|
A formulation of the simple theory of types
– A Church
- 1940
|
