Term rewriting with type-safe traversal functions

MaRDI QIDQ2843609zbMATH OpenFDO

Authors P. Klint, J. J. Vinju, M. G. J. van den Brand

Publication date 23 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104806029

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• A survey of strategies in rule-based program transformation systems
• Term Rewriting with Logical Constraints
• Programmable rewriting strategies in Haskell (white paper)
• Program transformation and rewriting
• From Outermost Termination to Innermost Termination

Cites work

• Building program optimizers with rewriting strategies
• scientific article; zbMATH DE number 1722718 (Why is no real title available?)
• scientific article; zbMATH DE number 1231662 (Why is no real title available?)
• scientific article; zbMATH DE number 1231673 (Why is no real title available?)
• scientific article; zbMATH DE number 194509 (Why is no real title available?)
• Language prototyping: An algebraic specification approach
• Object-oriented tree traversal with JJForester.
• Restructuring of COBOL/CICS legacy systems
• Term rewriting with type-safe traversal functions

Cited in

(8)

• Origin tracking
• Typed generic traversal with term rewriting strategies
• A survey of strategies in rule-based program transformation systems
• Generic type-preserving traversal strategies
• A survey of rewriting strategies in program transformation systems
• Scoped dynamic rewrite rules
• Term rewriting with type-safe traversal functions
• Programmable rewriting strategies in Haskell (white paper)

Describes a project that uses

Uses Software

• Stratego
• ELAN

This page was built for publication: Term rewriting with type-safe traversal functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843609)