Efficient second-order matching-Reference-Cited by-同舟云学术

Efficient second-order matching

Published:1996 Issue: Volume: Page:317-331
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Curien Régis,Qian Zhenyu,Shi Hui

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61464-8_62.pdf

Reference19 articles.

1. T. Boy de la Tour and R. Caferra. Proof analogy in interactive theorem proving: A method to express and use it via second order pattern matching. In proceedings of AAAI'87, 1987.

2. T. Boy de la Tour and R. Caferra. A formale approach to some usually informal techniques used in mathematical reasoning. In ISSAC'88, pages 402–406. Lecture Notes in Computer Science, 1988.

3. R. S. Boyer and J. S. Moore. A Theorem Prover for a Computational Logic. In Proc. of the 10th International Conference on Automated Deduction, 1990.

4. R. Curien. Outils pour la preuve par analogie. PhD thesis, Université Henri Poincaré — Nancy 1, January 1995.

5. R. Curien. Second Order E-matching as a Tool for Automated Theorem Proving. In Proceedings of EPIA '93 (Portugese Conference on Artificial Intelligence) Porto, Portugal., volume 727 of Lecture Notes in Artificial Intelligence, 93.

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

1. Analogy in Automated Deduction: A Survey;Computational Approaches to Analogical Reasoning: Current Trends;2014

2. Deterministic Higher-Order Patterns for Program Transformation;Logic Based Program Synthesis and Transformation;2004

3. Higher-order matching for program transformation;Theoretical Computer Science;2001-10

4. Generic Program Transformation;Advanced Functional Programming;1999

5. Tractable and Intractable Second-Order Matching Problems;Lecture Notes in Computer Science;1999