Strongly typed rewriting for coupled software transformation
From MaRDI portal
Publication:2864515
Recommendations
Cites work
- A Framework for Point-Free Program Transformation
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- A reification calculus for model-oriented software specification
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
- Data refinement by calculation
- Deforestation: Transforming programs to eliminate trees
- Scrap your boilerplate with class: extensible generic functions
- Some lambda calculi with categorical sums and products
- Typing dynamic typing
- “Scrap Your Boilerplate” Reloaded
Cited in
(6)- Transformation of structure-shy programs with application to XPath queries and strategic functions
- scientific article; zbMATH DE number 5033864 (Why is no real title available?)
- Algebraic specialization of generic functions for recursive types
- Constraint-aware schema transformation
- Recognizing Strategies
- Strongly typed flow-directed representation transformations (extended abstract)
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)