Combinators for bi-directional tree transformations: a linguistic approach to the view update problem

DOI10.1145/1040305.1040325MaRDI QIDQ5276149zbMATH OpenOpenAlexFDO

Authors J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt

Publication date 14 July 2017

Published in Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1040305.1040325

zbMATH Keywords

bi-directional programmingharmonylensesview update problemXML

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Semantics in the theory of computing (68Q55)

Recommendations

• Matching lenses: alignment and view update
• Applicative bidirectional programming with lenses
• Generic point-free lenses
• Boomerang, resourceful lenses for string data
• Quotient lenses

Cited in

(34)

• Session types without sophistry. System description
• An efficient composition of bidirectional programs by memoization and lazy update
• Integration of formal proof into unified assurance cases with Isabelle/SACM
• Comprehensive systems: a formal foundation for multi-model consistency management
• Morphisms of open games
• A programmable editor for developing structured documents based on bidirectional transformations
• Multiple model synchronization with multiary delta lenses with amendment and K-Putput
• Fibrations and universal view updatability
• The complexity of embedded axiomatization for a class of closed database views
• Towards a domain-specific language for reversible assembly sequences
• Strongly typed rewriting for coupled software transformation
• Relations as executable specifications: taming partiality and non-determinism using invariants
• Notions of bidirectional computation and entangled state monads
• A clear picture of lens laws
• Boomerang, resourceful lenses for string data
• Generic point-free lenses
• The safari of update structures: visiting the lens and quantum enclosures
• Runners in Action
• RustHorn: CHC-based verification for Rust programs
• Higher-ranked annotation polymorphic dependency analysis
• The costructure–cosemantics adjunction for comodels for computational effects
• Automated Algebraic Reasoning for Collections and Local Variables with Lenses
• Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
• Clean reversible simulations of ranking binary trees
• A Tangled Web of 12 Lens Laws
• Matching lenses: alignment and view update
• Characterizing Compatible View Updates in Syntactic Bidirectionalization
• A representation theorem for second-order functionals
• Programming Languages and Systems
• Contract lenses: Reasoning about bidirectional programs via calculation
• Cornering Optics
• The game semantics of game theory
• String diagrams for optics
• Exploiting schemas in data synchronization

This page was built for publication: Combinators for bi-directional tree transformations: a linguistic approach to the view update problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276149)