A survey of strategies in rule-based program transformation systems
DOI10.1016/J.JSC.2004.12.011zbMATH Open1129.68043OpenAlexW2004176798WikidataQ59780445 ScholiaQ59780445MaRDI QIDQ2456575FDOQ2456575
Authors: 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
Recommendations
pattern matchingterm rewritingattribute grammarsProgram transformationtree traversaltransformation ruleprogram representationcongruence operatorscontext-sensitive rulesextensions of term rewritinggeneric traversal strategiesstrategy annotationsstrategy combinatorstransformation strategytree parsing
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Maude: specification and programming in rewriting logic
- Secrets of the Glasgow Haskell Compiler inliner
- Title not available (Why is that?)
- Title not available (Why is that?)
- CDuce: an XML-centric general-purpose language
- Initial Algebra Semantics and Continuous Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semantics of context-free languages: Correction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Systematic design of program transformation frameworks by abstract interpretation
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Zipper
- Language prototyping: An algebraic specification approach
- A Transformation System for Developing Recursive Programs
- Title not available (Why is that?)
- A constructive approach to the problem of program correctness
- Origin tracking
- Proving and applying program transformations expressed with second-order patterns
- Typed generic traversal with term rewriting strategies
- MetaML and multi-stage programming with explicit annotations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ELAN from a rewriting logic point of view
- Building program optimizers with rewriting strategies
- Term-rewriting systems with rule priorities
- A System for Assisting Program Transformation
- Incremental execution of transformation specifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Higher-order matching for program transformation
- Just-in-time: on strategy annotations
- Transformational program development in a particular problem domain
- CONTEXT-FREE ALGEBRAS
- Title not available (Why is that?)
- Fusing logic and control with local transformations: an example optimization
- Term rewriting with type-safe traversal functions
- A transformation-based optimiser for Haskell
- Title not available (Why is that?)
- Shrinking lambda expressions in linear time
- First-class attribute grammars
- A survey of rewriting strategies in program transformation systems
- Scoped dynamic rewrite rules
- Strategies for source-to-source constant propagation
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- Transformation of structure-shy programs with application to XPath queries and strategic functions
- Warm fusion in Stratego: A case study in generation of program transformation systems
- Towards ``mouldable code via nested code graph transformation
- Program calculation in Coq
- Evolution of rule-based programs
- Rewriting strategies and strategic rewrite programs
- RAPT: A Program Transformation System Based on Term Rewriting
- A survey of rewriting strategies in program transformation systems
- Scoped dynamic rewrite rules
- Term rewriting with type-safe traversal functions
- Title not available (Why is that?)
- Translation of algebraic programs into executable codes
- Strategic port graph rewriting: an interactive modelling framework
- Program transformation with scoped dynamic rewrite rules
- Hume box calculus: Robust system development through software transformation
- The Maude strategy language
Uses Software
This page was built for publication: A survey of strategies in rule-based program transformation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456575)
