Searching for "Termination of Order-sorted Rewriting." – sorted by Relevance.
-
Termination of Order-Sorted Rewriting
- Termination of order-sorted rewriting Peter C. lveczky Department of Informatics University of Oslo
- Add To MetaCart
-
Termination of Order-Sorted Rewriting with Non-Minimal Signatures Yoshinobu KAWABE
- SUMMARY In this paper, we extend the Gnaedig's results [2][3] on termination of order-sorted rewriting
- Add To MetaCart
-
Order-Sorted Termination: the Unsorted Way
- termination of ordersorted rewrite systems. The dominating method for proving termination of order-sorted
- Cited by 2 (0 self) – Add To MetaCart
-
The Advanced Theory of
- case study in timed modal specification C. Weise Termination of order-sorted rewriting P. Ølveczky
- Cited by 1 (0 self) – Add To MetaCart
-
Proc. of the 6th Nordic Workshop on Programming Theory, 17-19 October 1994, Aarhus, Denmark
- H. R. Nielson and F. Nielson Termination of order-sorted rewriting 286 P. C. lveczky A type
- Add To MetaCart

