Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Andrews, P.B. Theorem-proving via general matings. J. Assoc. Comp. Mach. 28(2):193–214, 1981.
2. Avron, A., Honsell, F., Mason, I. Using Typed Lambda Calculus to Implement Formal Systems on a Machine. University of Edinburgh, 1987, ECS-LFCS-87-31.
3. Bibel, W. Computationally Improved Versions of Herbrand's Theorem. In J. Stern, editor, Proc. of the Herbrand Symposium, Logic Colloquium '81, pp. 11–28, North-Holland, 1982.
4. Clocksin, W.F., Mellish, C.S. Programming in Prolog, Springer-Verlag, 1984.
5. Curry, H.B. The permutability of rules in the classical inferential calculus. J. Symbolic Logic 17, pp. 245–248, 1952.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献