|
169
|
A unication algorithm for typed calculus
– G Huet
- 1975
|
|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
172
|
Logic Programming in the LF Logical Framework
– Frank Pfenning
- 1991
|
|
271
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Dale Miller
- 1990
|
|
18
|
and Computation in General Logic
– Search Proofs
- 1990
|
|
335
|
Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
- 1991
|
|
395
|
The formulae-as-types notion of construction
– W A Howard
- 1980
|
|
103
|
An algorithm for testing conversion in type theory
– Thierry Coquand
- 1990
|
|
417
|
The calculus of constructions
– Coquand, G Huet
- 1988
|
|
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
|
|
23
|
Higher-order unification with dependent types
– C Elliott
- 1989
|
|
70
|
Elf: A Language for Logic Definition and Verified Metaprogramming
– Frank Pfenning
- 1989
|
|
744
|
The Semantics Of Constraint Logic Programs
– Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey
- 1996
|
|
124
|
The undecidability of the second-order unification problem
– W D Goldfarb
- 1981
|
|
28
|
An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs
– Spiro Michaylov, Frank Pfenning
- 1992
|
|
16
|
Higher-order Unification with Dependent Function Types
– Conal M. Elliott
- 1989
|
|
56
|
Unification and Anti-Unification in the Calculus of Constructions
– Frank Pfenning
- 1991
|
|
78
|
Using Typed Lambda Calculus to Implement Formal Systems on a Machine
– Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack
- 1992
|
|
50
|
Higher-order unification revisited: Complete sets of transformations
– W Snyder, J Gallier
- 1989
|
