Uniform proofs as a foundation for logic programming (1991)

by Dale Miller , Gopalan Nadathur , Frank Pfenning , Andre Scedrov
Venue:ANNALS OF PURE AND APPLIED LOGIC
Citations:374 - 108 self

Active Bibliography

155 Higher-order logic programming – Gopalan Nadathur, Dale Miller
62 Higher-Order Horn Clauses – Gopalan Nadathur, Dale Miller - 1990
124 Unification under a mixed prefix – Dale Miller - 1992
306 Logic Programming in a Fragment of Intuitionistic Linear Logic – Joshua S. Hodas, Dale Miller
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
64 Lexical scoping as universal quantification – Dale Miller - 1989
2 A meta language for type checking and inference: An extended abstract – Amy Felty, Dale Miller - 1989
The Australian National University – Alwen Tiu, Dale Miller
14 Implementation Considerations for Higher-Order Features in Logic Programming – Gopalan Nadathur, Bharat Jayaraman, Debra Sue Wilson - 1993
99 An Overview of λProlog – Gopalan Nadathur, Dale Miller - 1988
36 An Extension to ML to Handle Bound Variables in Data Structures – Dale Miller - 1990
217 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
19 Higher Order Logic – Daniel Leivant - 1994
16 Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization – Scott Dietzen, Frank Pfenning - 1989
25 Extensions and Applications of Higher-order Unification – Conal M. Elliott - 1990
Contents – The Phragmén-lindelöf Theorem - 2006
4 Learning and Deduction in Neural Networks and Logic – Ekaterina Komendantskaya - 2007
7 Representing and reasoning with operational semantics – Dale Miller - 2006
9 Program Development Schemata as Derived Rules – Penny Anderson, David Basin - 2000