Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B): formal models and semantics
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Foundations of programming languages
Foundations of programming languages
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
Syntactic Definitions of Undefined: On Defining the Undefined
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Topological incompleteness and order incompleteness of the lambda calculus
ACM Transactions on Computational Logic (TOCL)
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters
On confluence of infinitary combinatory reduction systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Continuity and discontinuity in lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Infinitary combinatory reduction systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Order structures on böhm-like models
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Normalization of Infinite Terms
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Applications of infinitary lambda calculus
Information and Computation
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Decomposing the lattice of meaningless sets in the infinitary lambda calculus
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
Rewriting is the repeated transformation of a structured object according to a set of rules. This simple concept has turned out to have a rich variety of elaborations, giving rise to many different theoretical frameworks for reasoning about computation. Aside from its theoretical importance, rewriting has also been a significant influence on the design and implementation of real programming languages, most notably the functional and logic programming families of languages. For a theoretical perspective on the place of rewriting in Computer Science, see for example [14]. For a programming language perspective, see for example [16].