A look at TPS-Reference-Cited by-同舟云学术

A look at TPS

Published: Issue: Volume: Page:50-69
ISSN:
Container-title:6th Conference on Automated Deduction
language:
Short-container-title:

Author:

Miller Dale A.,Cohen Eve Longini,Andrews Peter B.

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0000051.pdf

Reference7 articles.

1. Peter B. Andrews, “Transforming Matings into Natural Deduction Proofs,” in 5th Conference on Automated Deduction, Les Arcs, France, edited by W. Bibel and R. Kowalski, Lecture Notes in Computer Science, No. 87, Springer-Verlag, 1980, 281–292.

2. Peter B. Andrews, Theorem Proving via General Matings, Journal of the Association for Computing Machinery 28 (1981), 193–214.

3. Alonzo Church, A Formulation of the Simple Theory of Types, Journal of Symbolic Logic 5 (1940), 56–68.

4. Gérard P. Huet, A Unification Algorithm for Typed λ-Calculus, Theoretical Computer Science 1 (1975), 27–57.

5. Gérard Huet, Resolution d'Équations dans les Languages d'Ordre 1,2,..., ω, Thèse de Doctorat D'État, Université Paris VII, 1976.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mechanized Metatheory Revisited;Journal of Automated Reasoning;2018-10-04

2. TPS: A theorem-proving system for classical type theory;Journal of Automated Reasoning;1996-06

3. Rewriting, and equational unification: the higher-order cases;Rewriting Techniques and Applications;1991

4. Automatic theorem proving. II;Cybernetics;1988

5. The TPS theorem proving system;8th International Conference on Automated Deduction;1986