Paper Info
Title
Faithful (meta-)encodings of programmable strategies into term rewriting systems.
Abstract
Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to control their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term rewriting system. The encoding is proven sound and complete and, as a direct consequence, established termination methods used for term rewriting systems can be applied to analyze the termination of strategy controlled term rewriting systems. We show that the encoding of strategies into term rewriting systems can be easily adapted to handle many-sorted signatures and we use a meta-level representation of terms to reduce the size of the encodings. The corresponding implementation in Tom generates term rewriting systems compatible with the syntax of termination tools such as APRoVE and TTT2, tools which turned out to be very effective in (dis)proving the termination of the generated term rewriting systems. The approach can also be seen as a generic strategy compiler which can be integrated into languages providing pattern matching primitives; experiments in Tom show that applying our encoding leads to performances comparable to the native Tom strategies.
Year
DOI
Venue
2017
10.23638/LMCS-13(4:16)2017
LOGICAL METHODS IN COMPUTER SCIENCE
Keywords
DocType
Volume
Programmable strategies,termination,term rewriting systems
Journal
13
Issue
ISSN
Citations 
4
1860-5974
1
PageRank 
References 
Authors
0.36
14
3
Name
Order
Citations
PageRank
Horatiu Cirstea116415.93
Sergueï Lenglet2899.15
Pierre-etienne Moreau359840.40