Modular higher-order E-unification-Reference-Cited by-同舟云学术

Modular higher-order E-unification

Published:1991 Issue: Volume: Page:200-214
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Nipkow Tobias,Qian Zhenyu

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53904-2_97.pdf

Reference21 articles.

1. Boudet, A.: Unification in a combination of equational theories: an efficient algorithm. Proc. 10th Int. Conf. Automated Deduction, LNCS 449 (1990), 292–307.

2. Breazu-Tannen, V.: Combing algebra and higher-order types. Proc. 3rd IEEE Symp. Logic in Computer Science (1988), 82–90.

3. Breazu-Tannen, V. and Gallier, J.: Polymorphic rewriting conserves algebraic strong normalization and confluence. Proc. ICALP, LNCS 372 (1989), 137–150.

4. Bürchert, H.-J.: Matching — a special case of unification? J. Symbolic Computation 8 (1989), 523–536.

5. Futatsugi, K., Goguen, J.A., Jouannaud, J.-P., Meseguer, J.: Principles of OBJ2. Proc. 12th ACM Symp. Principles of Programming Languages (1985), 52–66.

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

1. Introduction to Milestones in Interactive Theorem Proving;Journal of Automated Reasoning;2018-05-11

2. Higher Order Unification 30 Years Later;Lecture Notes in Computer Science;2002

3. Higher-order equational unification via explicit substitutions;Algebraic and Logic Programming;1997

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

5. Higher-order rigid E-unification;Logic Programming and Automated Reasoning;1994