Operational specifications with built-ins-Reference-Cited by-同舟云学术

Operational specifications with built-ins

Published:1994 Issue: Volume: Page:263-274
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Avenhaus Jürgen,Becker Klaus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57785-8_147.pdf

Reference19 articles.

1. J. Avenhaus and K. Becker, Conditional rewriting modulo a built-in algebra, SEKI Report SR-92-11.

2. J. Avenhaus and K. Madlener, Term rewriting and equational reasoning, in: R. B. Banerji, ed., Formal Techniques in Artificial Intelligence (Amsterdam, 1990) pp. 1–43.

3. L. Bachmair and N. Dershowitz, Completion for rewriting modulo a congruence, Theor. Comp. Science 67 (1989) pp. 173–201.

4. K. Becker, Proving ground confluence and inductive validity in constructor based equational specifications, TAPSOFT '93, LNCS 668 (Berlin, 1993) pp. 46–60.

5. M. Broy and M. Wirsing, Generalized heterogenous algebras and partial interpretations, in: Proc. 8th CAAP, LNCS 159 (Berlin, 1983) pp. 1–34.

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

1. Experiments with partial evaluation domains for rewrite specifications;Recent Trends in Data Type Specification;1996

2. On theorem-proving in Horn theories with built-in algebras;Artificial Intelligence and Symbolic Mathematical Computation;1996

3. Preserving confluence for rewrite systems with built-in operations;Conditional and Typed Rewriting Systems;1995

4. Combining computer algebra and rule based reasoning;Integrating Symbolic Mathematical Computation and Artificial Intelligence;1995