Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence-Reference-Cited by-同舟云学术

Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence

Published:1985 Issue: Volume: Page:136-155
ISSN:0343-3005
Container-title:Recent Trends in Data Type Specification
language:
Short-container-title:

Author:

Kaplan Stéphane

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-09691-8_11

Reference20 articles.

1. M. Bergman, P. Deransart, Abstract data types and rewriting systems applications to the programmation of abstract data types in PROLOG, Proc. of 6th CAAP, Genes (1981).

2. D. Brandt, J.A. Darringer, W.H. Joyner, Completeness of conditional reductions, IBM Res. Center, Yorktown Heights (1978).

3. J. Bergstra, J. Klop, Conditional rewrite rules: confluence and termination, Report IW 198/82, Amsterdam (1982).

4. K. Drosten, Toward executable specifications using conditional axioms, Report 83–01, T.U. Braunschweig (1983).

5. Proc 20th Symposium on Foundation of Computer Science;N Dershowitz,1979

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

1. Dynamic detection of determinism in functional logic languages;Theoretical Computer Science;1995-05

2. LSE narrowing for decreasing conditional term rewrite systems;Conditional and Typed Rewriting Systems;1995

3. Kernel-LEAF: A logic plus functional language;Journal of Computer and System Sciences;1991-04

4. Dynamic detection of determinism in functional logic languages;Programming Language Implementation and Logic Programming;1991

5. Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation;Conditional and Typed Rewriting Systems;1991