Aformal approach to some usually informal techniques used in mathematical reasoning-Reference-Cited by-同舟云学术

Aformal approach to some usually informal techniques used in mathematical reasoning

Published:1989 Issue: Volume: Page:402-406
ISSN:0302-9743
Container-title:Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Boy de la Tour Thierry,Caferra Ricardo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51084-2_38.pdf

Reference15 articles.

1. T. Boy de la Tour, R. Caferra: "Proof analogy in interactive theorem proving: a method to express and use it via second order pattern matching"; Proc. of the AAAI-87; Seattle, U.S.A., July 1987, 95–99.

2. A. Bundy: "Discovery and reasoning in Mathematics"; Proc. of the 9th. IJCAI. Los Angeles, U.S.A., August 1985, 1221–1230.

3. R. L. Constable, T. B. Knoblock, J. L. Bates: "Writing programs that construct proofs";Journal of Automated Reasoning 1, 1985, 285–326.

4. H. Gelernter, J. R. Hansen, D. W. Loveland: "Empirical explorations of the geometry-theorem proving machine"; in "Computers and Thought" (E. Feigenbaum and J. Feldman eds.), McGraw-Hill, 1963, 153–163.

5. G. Huet, B. Lang: "Proving and applying program transformations expressed with second-order patterns"; Acta Informatica 11, 1978, 31–55.

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

1. Second-Order Matching via Explicit Substitutions;Logic for Programming, Artificial Intelligence, and Reasoning;2005

2. Efficient second-order matching;Rewriting Techniques and Applications;1996

3. Building proofs by analogy via the Curry-Howard Isomorphism;Logic Programming and Automated Reasoning;1992