696

A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
 1993

169

A unification algorithm for typed calculus
– G Huet
 1975

175

Logic Programming in the LF Logical Framework
– Frank Pfenning
 1991

291

A logic programming language with lambdaabstraction, function variables, and simple unification
– Dale Miller
 1990

107

An algorithm for testing conversion in Type Theory
– Thierry Coquand
 1991

18

and Computation in General Logic
– Search Proofs
 1990

374

Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
 1991

132

The undecidability of the secondorder unification problem
– W D Goldfarb
 1981

473

The Calculus of Constructions
– T Coquand, G Huet
 1988

83

Using Typed Lambda Calculus to Implement Formal Systems on a Machine
– Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack
 1992

445

The formulaeastypes notion of construction
– W A Howard
 1980

24

Higherorder unification with dependent types
– Conal Elliott
 1989

77

Elf: A Language for Logic Definition and Verified Metaprogramming
– Frank Pfenning
 1989

854

A formulation of the simple theory of types
– Alonzo Church
 1940

786

The Semantics Of Constraint Logic Programs
– Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey
 1996

176

An overview of prolog
– D Miller, G Nadathur
 1988

46

Specifying and Implementing Theorem Provers in a HigherOrder Logic Programming Language
– Amy P. Felty, Dale Miller, Jean Gallier, Amy P. Felty, Supervisor Dale Miller
 1989

302

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser Theorem
– N. G. De Bruijn
 1972

55

Higherorder unification revisited: Complete sets of transformations
– W Snyder, J Gallier
 1989
