Proving ground confluence and inductive validity in constructor based equational specifications-Reference-Cited by-同舟云学术

Proving ground confluence and inductive validity in constructor based equational specifications

Published:1993 Issue: Volume: Page:46-60
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Becker Klaus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56610-4_55.pdf

Reference22 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 (North-Holland, Amsterdam, 1990) pp. 1–43.

3. L. Bachmair, Proof by Consistency in Equational Theories, in: 3rd LICS (1988) pp. 228–233.

4. R.S. Boyer and J.S. Moore, A Computational Logic (Academic Press, New York, 1979).

5. R. Burstall, Proving properties of programs by structural induction, Computer Journal 12 (1969) pp. 41–48.

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

1. On Ground Convergence and Completeness of Conditional Equational Program Hierarchies;Rewriting Logic and Its Applications;2022

2. Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories;Logic for Programming, Artificial Intelligence, and Reasoning;2010

3. A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications;Rewriting Logic and Its Applications;2010

4. History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!;Lecture Notes in Computer Science;2005

5. Abstract notions and inference systems for proofs by mathematical induction;Conditional and Typed Rewriting Systems;1995