Applicative bidirectional programming with lenses
From MaRDI portal
Recommendations
Cited in
(23)- Introduction to bidirectional transformations
- Principles and practice of bidirectional programming in BiGUL
- An efficient composition of bidirectional programs by memoization and lazy update
- A programmable editor for developing structured documents based on bidirectional transformations
- Notions of bidirectional computation and entangled state monads
- A clear picture of lens laws
- Reflections on monadic lenses
- Boomerang, resourceful lenses for string data
- Formalizing semantic bidirectionalization and extensions with dependent types
- Towards an Algebraic Theory of Bidirectional Transformations
- Generic point-free lenses
- Three complementary approaches to bidirectional programming
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Combining syntactic and semantic bidirectionalization
- Matching lenses: alignment and view update
- Incremental updates for efficient bidirectional transformations
- Quotient lenses
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
- Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins
- biXid: a bidirectional transformation language for XML
- Contract lenses: Reasoning about bidirectional programs via calculation
- Composing bidirectional programs monadically
- \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches
This page was built for publication: Applicative bidirectional programming with lenses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981943)