Computing Ground Reducability and Inductively Complete Positions

Authors:
Reinhard Bündgen;Wolfgang Küchlin
Affiliations:
-;-
Venue:
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Year:
1989

Citing 0
Cited 2

Deductive and inductive synthesis of equational programs

Journal of Symbolic Computation - Special issue on automatic programming
Test Sets for the Universal and Existential Closure of Regular Tree Languages

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract