Unification of simply typed lambda-terms as logic programming (1991)

by Dale Miller
Venue:In Eighth International Logic Programming Conference
Citations:56 - 3 self

Active Bibliography

175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
153 Higher-order logic programming – Gopalan Nadathur, Dale Miller
3 Object-Level Substitution, Unification And Generalization In Meta-Logic – Chuck C. Liang - 1995
10 Elimination of Negation in a Logical Framework – Alberto Momigliano - 2000
215 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
The Australian National University – Alwen Tiu, Dale Miller
7 Proof search specifications of bisimulation and modal logics for the π-calculus – Alwen Tiu, Dale Miller
124 Unification under a mixed prefix – Dale Miller - 1992
A Pragmatic Reconstruction of λProlog – Catherine Belleannée, Pascal Brisset, Olivier Ridoux - 1994
30 A Proof Procedure for the Logic of Hereditary Harrop Formulas – Gopalan Nadathur - 1993
26 Tabled Higher-Order Logic Programming – Brigitte Pientka - 2003
8 Choices in representation and reduction strategies for lambda terms in intensional contexts – Chuck Liang, Gopalan Nadathur, Xiaochu Qi - 2004
3 Unification in a λ-Calculus with Intersection Types – Michael Kohlhase, Frank Pfenning
2 A meta language for type checking and inference: An extended abstract – Amy Felty, Dale Miller - 1989
18 Higher Order Logic – Daniel Leivant - 1994
303 Logic Programming in a Fragment of Intuitionistic Linear Logic – Joshua S. Hodas, Dale Miller
14 Combining generic judgments with recursive definitions – Andrew Gacek, Dale Miller, Gopalan Nadathur
25 Extensions and Applications of Higher-order Unification – Conal M. Elliott - 1990
11 Foundational Aspects of Syntax – Dale Miller, Catuscia Palamidessi - 1999