Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. P. B. Andrews. Theorem proving via general matings. J.ACM, 28(2):193–214, 1981.
2. P. B. Andrews, D. Miller, E. Cohen, and F. Pfenning. Automating higher-order logic. Contemporary Mathematics, 29:169–192, 1984.
3. H. Barendregt. The Lambda Calculus, Its Syntax and Semantics, volume 103. North-Holland, 1984.
4. W. Bibel. Automated Theorem Proving. Vieweg, 2nd edition, 1987.
5. M. W. Bunder. Predicate calculus and naive set theory in pure combinatory logic. Archiv für Mathematische Logik und Grundlagenforschung, 21:169–177, 1981.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Higher Order Unification 30 Years Later;Lecture Notes in Computer Science;2002