Order-sorted completion: The many-sorted way-Reference-Cited by-同舟云学术

Order-sorted completion: The many-sorted way

Published:1989 Issue: Volume: Page:244-258
ISSN:0302-9743
Container-title:TAPSOFT '89
language:
Short-container-title:

Author:

Ganzinger Harald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-50939-9_136.pdf

Reference26 articles.

1. Bachmair, L.: Proof methods for equational theories. PhD-Thesis, U. of Illinois, Urbana Champaign, 1987.

2. Bachmair, L., Dershowitz, N. and Hsiang, J.: Proof orderings for equational proofs. Proc. LICS 86, 346–357.

3. Bertling, H. and Ganzinger, H.: Completion-time optimization of rewrite-time goal solving. Report M.1.3-R-12.0, PROSPECTRA-Project, FB Informatik, U. Dortmund, 1988

4. Bertling, H. and Ganzinger, H.: Completion of application-restricted conditional equations. Report, FB Informatik, U. Dortmund, 1989, to appear.

5. Bertling, H., Ganzinger, H. and Schäfers, R.: CEC: A system for conditional equational completion. User Manual Version 1.4, PROSPECTRA-Report M.1.3-R-7.0, U. Dortmund, 1988.

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

1. Harald Ganzinger’s Legacy: Contributions to Logics and Programming;Programming Logics;2013

2. Rewriting Logic as a Logic of Special Relations;Electronic Notes in Theoretical Computer Science;1998

3. Term Rewriting in a Logic of Special Relations;Algebraic Methodology and Software Technology;1998

4. Completion-time optimization of rewrite-time goal solving;Rewriting Techniques and Applications;1989

5. Order-sorted completion: The many-sorted way;TAPSOFT '89;1989