Unification under a mixed prefix (1992)

Cached

Download Links

by Dale Miller
Venue:Journal of Symbolic Computation
Citations:124 - 13 self

Documents Related by Co-Citation

287 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
113 A unification algorithm for typed λ-calculus – G Huet - 1975
169 A unification algorithm for typed -calculus – G Huet - 1975
373 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
176 An overview of -prolog – D Miller, G Nadathur - 1988
64 Lexical scoping as universal quantification – Dale Miller - 1989
695 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
332 An Efficient Unification Algorithm – Alberto Martelli, Ugo Montanari - 1982
418 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
99 An Overview of λProlog – Gopalan Nadathur, Dale Miller - 1988
182 Isabelle: The next 700 theorem provers – L C Paulson - 1990
301 Higher-order abstract syntax – Frank Pfenning, Conal Elliott
259 Investigations into logical deduction – G Gentzen - 1969
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
70 Specifying theorem provers in a higherorder logic programming language – Amy Felty, Dale Miller - 1988
845 A Formulation of the Simple Theory of Types – A Church - 1940
1559 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
98 Seventy-Five Problems for Testing Automatic Theorem Provers – Francis Jeffrey Pelletier - 1986
35 A Semi-Functional Implementation of a Higher-Order Logic Programming Language – Conal Elliott, Frank Pfenning - 1991