A Combinatory Logic Approach to Higher-order E-unification (1992)

Cached

Download Links

by Daniel J. Dougherty , Patricia Johann
Venue:in Proceedings of the Eleventh International Conference on Automated Deduction, Springer-Verlag LNAI 607
Citations:9 - 3 self

Documents Related by Co-Citation

169 A unification algorithm for typed -calculus – G Huet - 1975
9 Modular Higher-order E-Unification – T Nipkow, Z Qian - 1991
55 Higher-order unification revisited: Complete sets of transformations – W Snyder, J Gallier - 1989
132 The undecidability of the second-order unification problem – W D Goldfarb - 1981
71 PROOFS IN HIGHER-ORDER LOGIC – Dale A. Miller - 1983
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
35 A mechanization of type theory – Gérard P Huet - 1973
171 Introduction to Combinators and -Calculus – J Roger Hindley, Jonathan P Seldin - 1986
105 Classical Type Theory – Peter B. Andrews, Second Readers John Harrison, Michael Kohlhase - 2001
9 Higher-Order Unification via Combinators – Daniel J. Dougherty - 1993
167 Canonical forms and Unification – J-M Hullot - 1980
4 Complete Sets of Transformations for Unification Problems – P Johann - 1991
37 Constrained Resolution: A Complete Method for Higher Order Logic – Gérard P Huet - 1972
5 Type Inference with Simple Types – J C Mitchell - 1991
4 Higher-order Order-sorted Algebras – Z Qian - 1990
4 Subtyping + extensionality: Confluence of fijtop reduction in F – P-L Curien, G Ghelli - 1991
7 Unification in a -calculus with Intersection Types – M Kohlhase, F Pfenning - 1993
7 Reduction and Unification in Lambda Calculi with Subtypes – T Nipkow, Z Qian - 1992