Natural Deduction as Higher-Order Resolution (1986)

Cached

Download Links

by Lawrence C Paulson
Venue:Journal of Logic Programming
Citations:54 - 8 self

Documents Related by Co-Citation

145 Proving and Applying Program Transformation Expressed with Second-Order Patterns – G Huet, B Lang - 1978
113 A unification algorithm for typed ╬╗-calculus – G Huet - 1975
301 Higher-order abstract syntax – Frank Pfenning, Conal Elliott
70 Specifying theorem provers in a higherorder logic programming language – Amy Felty, Dale Miller - 1988
845 A Formulation of the Simple Theory of Types – A Church - 1940
99 An Overview of ╬╗Prolog – Gopalan Nadathur, Dale Miller - 1988
695 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
33 A Higher-Order Logic as the Basis for Logic Programming – G Nadathur - 1987
418 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
373 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
27 Uses of higher-order unification for implementing program transformers – J Hannan, D Miller - 1988
49 A Logic Programming Approach To Manipulating Formulas And Programs – Dale Miller, Gopalan Nadathur - 1994
132 The undecidability of the second-order unification problem – Warren D Goldfarb - 1981
165 Logic and Computation: Interactive Proof with Cambridge LCF – L Paulson - 1987
304 An Introduction To Mathematical Logic and Type Theory: To Truth Through Proof – P B Andrews - 1986
169 A unification algorithm for typed -calculus – G Huet - 1975
287 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
83 Using Typed Lambda Calculus to Implement Formal Systems on a Machine – Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack - 1992