374

Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
 1991

64

Lexical scoping as universal quantification
– Dale Miller
 1989

306

Logic Programming in a Fragment of Intuitionistic Linear Logic
– Joshua S. Hodas, Dale Miller

27

Specifying FillerGap Dependency Parsers in a LinearLogic Programming Language
– Joshua Hodas
 1992

169

A unification algorithm for typed calculus
– G Huet
 1975

155

Higherorder logic programming
– Gopalan Nadathur, Dale Miller

66

Implementing Tactics and Tacticals in a HigherOrder Logic Programming Language
– Amy Felty
 1993

176

An overview of prolog
– D Miller, G Nadathur
 1988

35

A SemiFunctional Implementation of a HigherOrder Logic Programming Language
– Conal Elliott, Frank Pfenning
 1991

147

A logical analysis of modules in logic programming
– Dale Miller
 1989

291

A logic programming language with lambdaabstraction, function variables, and simple unification
– Dale Miller
 1990

50

Logic Programming in Intuitionistic Linear Logic: Theory, Design and Implementation
– J S Hodas
 1994

30

Abstract syntax and logic programming
– Dale Miller
 1991

18

Naive Reverse can be Linear
– Pascal Brisset, Olivier Ridoux
 1991

62

HigherOrder Horn Clauses
– Gopalan Nadathur, Dale Miller
 1990

80

Partial polymorphic type inference and higherorder unification
– Frank Pfenning
 1988

56

Typed Prolog: A semantic reconstruction of the MycroftO’Keefe type system
– T K Lakshman, U S Reddy
 1991

302

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser Theorem
– N. G. De Bruijn
 1972

939

A theory of type polymorphism in programming
– Robin Milner
 1978
