Efficient second-order matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 317-331

  Curien, Régis ^a   Qian, Zhenyu ^b   Shi, Hui ^b  

^a INRIA   (France)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FREE VARIABLE; MATCHING PROBLEMS; SECOND-ORDER MATCHING; SUBTERMS; TOP LAYERS;

ARTIFICIAL INTELLIGENCE;

EID: 84957699853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_62     Document Type: Conference Paper

References (19)

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 analogic. 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.
6. R. Curien and Z. Qian. Efficiency for second-order matching: the syntactic and AC- cases. Technical report, 1995. Draft paper.
7. G. Dowek. A Second-order Pattern Matching Algorithm in the Cube of Typed λ- calculi. In Mathematical Foundation of Computer Science, LNCS 520, 1991.
8. R. Harper, D. MacQueen, and R. Milner. Standard ML. Technical report, Dept, of Cmputer Science, University of Edinburg, 1986.
9. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
10. G. Huet. Resolution d'Equations dans les langages d'Ordre 1, 2, …,ω. Thèse de Doctorat d'Etat, Université de Paris 7 (France), 1976.
11. G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978.
12. T. Kolbe and C. Walther. Reusing proofs. In A. Cohn, editor, ECAI'94, 11th European Conference on Artificial Intelligence, pages 80 - 84, 1994.
13. B. Krieg-Brüchner, J. Liu, H. Shi, and B. Wolff. Towards correct, efĩficient and reusable transformational developments. In "KORSO: Methods, Languages, and Tools for the Construction of Correct Software", pages 270-284. LNCS 1009, 1995.
14. T. Nipkow and Z. Qian. Modular higher-order E-unification. In R. Book, editor, Proc. 4th Int. Conf. Rewriting Techniques and Applications, pages 200-214. LNCS 488, 1991.
15. L. Paulson. Isabelle - A Generic Theorem prover. LNCS 828, 1994.
16. Z. Qian and K. Wang. Higher-order. E-unification for arbitrary theories. In K. Apt, ed., Proc. 1992 Joint Int. Conf. and Symp. on Logic Programming. MIT Press, 1992.
17. H. Shi. Extended Matching with Applications to Program Transformation. PhD thesis, Universität Bremen, 1994.
18. W. Snyder. Higher-order U-unification. In M. Stickel, editor, Proc. 10th Int. Conf. Automated Deduction, pages 573-587. Springer-Verlag LNCS 449, 1990.
19. W. Snyder and J. Gallier. Higher-order unification revisited: Complete sets of transformations. J. Symbolic Computation, 8(1 & 2):101-140, 1989.