Strongly Typed Rewriting For Coupled Software Transformation

DOI10.1016/J.ENTCS.2006.10.019zbMath1277.68042OpenAlexW2142565829MaRDI QIDQ2864515

Joost Visser, Alcino Cunha

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.019

zbMATH Keywords

program transformationterm rewritingdata refinementstrategic programminggeneralized abstract datatypes

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) General topics in the theory of software (68N01)

Related Items (4)

Algebraic Specialization of Generic Functions for Recursive Types ⋮ Constraint-aware Schema Transformation ⋮ Transformation of structure-shy programs with application to XPath queries and strategic functions ⋮ Recognizing Strategies

Uses Software

• Haskell

Cites Work

• A reification calculus for model-oriented software specification
• Data refinement by calculation
• Deforestation: Transforming programs to eliminate trees
• Scrap your boilerplate with class
• Typing dynamic typing
• “Scrap Your Boilerplate” Reloaded
• A Framework for Point-Free Program Transformation
• A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
• Some lambda calculi with categorical sums and products
• Combinators for bi-directional tree transformations

This page was built for publication: Strongly Typed Rewriting For Coupled Software Transformation