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

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

Documents Related by Co-Citation

696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
854 A formulation of the simple theory of types – Alonzo Church - 1940
176 An overview of -prolog – D Miller, G Nadathur - 1988
61 Unification and Anti-Unification in the Calculus of Constructions – Frank Pfenning - 1991
169 A unification algorithm for typed -calculus – G Huet - 1975
99 An Overview of λProlog – Gopalan Nadathur, Dale Miller - 1988
260 Programming in Martin-Löf’s Type Theory. An Introduction – B Nordström, K Petersson, J M Smith - 1990
26 Investigating a proof-theoretic meta-language for functional programs – J J Hannan - 1990
315 System Description: Twelf --- A Meta-Logical Framework for Deductive Systems – Frank Pfenning, Carsten Schurmann - 1999
54 Natural Deduction as Higher-Order Resolution – Lawrence C Paulson - 1986
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
114 A unification algorithm for typed λ-calculus – G Huet - 1975
132 The undecidability of the second-order unification problem – W D Goldfarb - 1981
302 Higher-order abstract syntax – F Pfenning, C Elliott - 1988
26 A computation model for executable higher-order algebraic speci cation languages – J-P Jouannaud, M Okada - 1991
30 Abstract syntax and logic programming – Dale Miller - 1991
163 Inductive Definitions in the System Coq Rules and Properties – Christine Paulin-Mohring - 1992