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

Documents Related by Co-Citation

303 Logic Programming in a Fragment of Intuitionistic Linear Logic – Joshua S. Hodas, Dale Miller
147 A logical analysis of modules in logic programming – Dale Miller - 1989
207 Linear Objects: logical processes with built-in inheritance – Jean-Marc Andreoli, Remo Pareschi - 1990
696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
302 Higher-order abstract syntax – F Pfenning, C Elliot - 1988
259 Investigations into logical deduction – G Gentzen - 1969
847 A formulation of the simple theory of types – A Church - 1940
77 Elf: A Language for Logic Definition and Verified Metaprogramming – Frank Pfenning - 1989
81 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
331 Logic Programming with Focusing Proofs in Linear Logic – Jean-marc Andreoli - 1992
65 Lexical scoping as universal quantification – Dale Miller - 1989
177 An overview of >'Prolog – Gopalan Nadathur, Dale Miller - 1988
99 An Overview of ╬╗Prolog – Gopalan Nadathur, Dale Miller - 1988
114 A unification algorithm for typed ╬╗-calculus – G Huet - 1975
124 Unification under a mixed prefix – Dale Miller - 1992
83 Using Typed Lambda Calculus to Implement Formal Systems on a Machine – Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack - 1992
18 Extended natural semantics – J Hannan - 1993
287 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
66 Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language – Amy Felty - 1993