Strongly typed rewriting for coupled software transformation
From MaRDI portal
Publication:2864515
DOI10.1016/J.ENTCS.2006.10.019zbMATH Open1277.68042OpenAlexW2142565829MaRDI QIDQ2864515FDOQ2864515
Authors: Alcino Cunha, Joost Visser
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
Recommendations
term rewritingprogram transformationdata refinementstrategic programminggeneralized abstract datatypes
Cites Work
- Deforestation: Transforming programs to eliminate trees
- Typing dynamic typing
- A Framework for Point-Free Program Transformation
- Data refinement by calculation
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- Some lambda calculi with categorical sums and products
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
- A reification calculus for model-oriented software specification
- Scrap your boilerplate with class: extensible generic functions
- “Scrap Your Boilerplate” Reloaded
Cited In (6)
- Transformation of structure-shy programs with application to XPath queries and strategic functions
- Title not available (Why is that?)
- Algebraic specialization of generic functions for recursive types
- Constraint-aware schema transformation
- Recognizing Strategies
- Strongly typed flow-directed representation transformations (extended abstract)
Uses Software
This page was built for publication: Strongly typed rewriting for coupled software transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864515)