Bidirectionalization transformation based on automatic derivation of view complement functions
From MaRDI portal
Publication:5168924
Recommendations
Cited in
(21)- Reversible computation in term rewriting
- Introduction to bidirectional transformations
- A theory of reversibility for Erlang
- An efficient composition of bidirectional programs by memoization and lazy update
- Generic recursive lens combinators and their calculation laws
- A programmable editor for developing structured documents based on bidirectional transformations
- Relations as executable specifications: taming partiality and non-determinism using invariants
- Applicative bidirectional programming with lenses
- Formalizing semantic bidirectionalization and extensions with dependent types
- Three complementary approaches to bidirectional programming
- Causal-consistent replay reversible semantics for message passing concurrent programs
- Completion after program inversion of injective functions
- Combining syntactic and semantic bidirectionalization
- Bidirectionalizing graph transformations
- Incremental updates for efficient bidirectional transformations
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins
- Programming Languages and Systems
- Contract lenses: Reasoning about bidirectional programs via calculation
- Towards a taxonomy for reversible computation approaches
- \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches
This page was built for publication: Bidirectionalization transformation based on automatic derivation of view complement functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168924)