Bidirectionalizing graph transformations
From MaRDI portal
Recommendations
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Introduction to bidirectional transformations
- Generic recursive lens combinators and their calculation laws
- Incremental updates for efficient bidirectional transformations
- Bidirectionalization for free! (Pearl)
Cited in
(18)- Introduction to bidirectional transformations
- Engineering bidirectional transformations
- An efficient composition of bidirectional programs by memoization and lazy update
- A programmable editor for developing structured documents based on bidirectional transformations
- Relations as executable specifications: taming partiality and non-determinism using invariants
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- Formalizing semantic bidirectionalization and extensions with dependent types
- Transformations on channel graphs
- Graphical Model of the Biquadratic Transformation
- Marker-directed optimization of UnCAL graph transformations
- scientific article; zbMATH DE number 7437711 (Why is no real title available?)
- A Tangled Web of 12 Lens Laws
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Incremental updates for efficient bidirectional transformations
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Programming Languages and Systems
- biXid: a bidirectional transformation language for XML
- Contract lenses: Reasoning about bidirectional programs via calculation
This page was built for publication: Bidirectionalizing graph transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176941)