Extensions and Applications of Higher-order Unification (1990)

by Conal M. Elliott
Citations:25 - 1 self

Documents Related by Co-Citation

169 A unification algorithm for typed -calculus – G Huet - 1975
696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
107 An algorithm for testing conversion in type theory – T Coquand - 1991
287 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
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
441 The formulae-as-types notion of construction – W A Howard - 1980
847 A formulation of the simple theory of types – A Church - 1940
471 The calculus of constructions – Thierry Coquand, GĂ©rard P Huet - 1988
83 Using Typed Lambda Calculus to Implement Formal Systems on a Machine – Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack - 1992
24 Higher-order unification with dependent types – Conal Elliott - 1989
77 Elf: A Language for Logic Definition and Verified Metaprogramming – Frank Pfenning - 1989
785 The Semantics Of Constraint Logic Programs – Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey - 1996
177 An overview of >'Prolog – Gopalan Nadathur, Dale Miller - 1988
303 Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem – N. G. De Bruijn - 1972
46 Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language – Amy P. Felty, Dale Miller, Jean Gallier, Amy P. Felty, Supervisor Dale Miller - 1989
61 Unification and Anti-Unification in the Calculus of Constructions – Frank Pfenning - 1991
53 Higher-order unification revisited: Complete sets of transformations – J Gallier, W Snyder - 1989