Computational semantics of term rewriting systems
Algebraic methods in semantics
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that
Semantics and Logics of Computation
Semantics and Logics of Computation
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Hi-index | 0.00 |
We provide some new results concerning the use of transfinite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly infinite constructor terms by transfinite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transfinite rewrite sequences into shorter (possibly finite) ones. We also investigate the role that (finitary) confluence plays in transfinite rewriting. We consider different (quite standard) rewriting semantics (mappings from input terms to sets of reducts obtained by -transfinite- rewriting) in a unified framework and investigate their algebraic structure. Such a framework is used to formulate, connect, and approximate different properties of TRSs.