Extensions and Applications of Higher-order Unification (1990)

by Conal M. Elliott
Citations:25 - 1 self

Documents Related by Co-Citation

696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
107 An algorithm for testing conversion in Type Theory – Thierry Coquand - 1991
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
169 A unification algorithm for typed -calculus – G Huet - 1975
18 and Computation in General Logic – Search Proofs - 1990
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
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
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
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
24 Higher-order unification with dependent types – Conal Elliott - 1989
132 The undecidability of the second-order unification problem – W D Goldfarb - 1981
176 An overview of -prolog – D Miller, G Nadathur - 1988
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
445 The formulae-as-types notion of construction – W A Howard - 1980
55 Higher-order unification revisited: Complete sets of transformations – W Snyder, J Gallier - 1989
11 The Church-Rosser theorem for LF with fij-reduction. Unpublished notes to a talk given at the First Workshop on Logical Frameworks in – A Salvesen - 1990
114 A unification algorithm for typed λ-calculus – G Huet - 1975