A survey of strategies in rule-based program transformation systems

DOI10.1016/j.jsc.2004.12.011zbMath1129.68043WikidataQ59780445 ScholiaQ59780445MaRDI QIDQ2456575

Eelco Visser

Publication date: 19 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/24134

zbMATH Keywords

program representation; pattern matching; term rewriting; Program transformation; attribute grammars; tree traversal; transformation rule; congruence operators; context-sensitive rules; extensions of term rewriting; generic traversal strategies; strategy annotations; strategy combinators; transformation strategy; tree parsing

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

68Q42: Grammars and rewriting systems

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Translation of algebraic programs into executable codes

Uses Software

• Stratego
• ELAN
• ANTLR
• ATERM
• TAMPR
• Haskell
• OBJ3
• Maude
• GHC
• Automath
• TXL
• CDuce
• KIDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformational program development in a particular problem domain
• Proving and applying program transformations expressed with second-order patterns
• Term-rewriting systems with rule priorities
• Origin tracking
• Typed generic traversal with term rewriting strategies
• MetaML and multi-stage programming with explicit annotations
• ELAN from a rewriting logic point of view
• Maude: specification and programming in rewriting logic
• A transformation-based optimiser for Haskell
• Language Prototyping: An Algebraic Specification Approach
• Just-in-time
• A Survey of Rewriting Strategies in Program Transformation Systems
• Fusing Logic and Control with Local Transformations
• Scoped Dynamic Rewrite Rules
• Secrets of the Glasgow Haskell Compiler inliner
• Incremental execution of transformation specifications
• A System for Assisting Program Transformation
• A Transformation System for Developing Recursive Programs
• Initial Algebra Semantics and Continuous Algebras
• CONTEXT-FREE ALGEBRAS
• Shrinking lambda expressions in linear time
• The Zipper
• Systematic design of program transformation frameworks by abstract interpretation
• CDuce
• Building program optimizers with rewriting strategies
• A constructive approach to the problem of program correctness
• Semantics of context-free languages: Correction
• Higher-order matching for program transformation