Combinators for bi-directional tree transformations

DOI10.1145/1040305.1040325zbMath1369.68136OpenAlexW2125713144MaRDI QIDQ5276149

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

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

XMLharmonylensesview update problembi-directional programming

Mathematics Subject Classification ID

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

Related Items (28)

Runners in Action ⋮ RustHorn: CHC-Based Verification for Rust Programs ⋮ Higher-Ranked Annotation Polymorphic Dependency Analysis ⋮ Morphisms of open games ⋮ The costructure–cosemantics adjunction for comodels for computational effects ⋮ 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 ⋮ Exploiting schemas in data synchronization ⋮ Automated Algebraic Reasoning for Collections and Local Variables with Lenses ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Contract lenses: Reasoning about bidirectional programs via calculation ⋮ The Safari of Update Structures: Visiting the Lens and Quantum Enclosures ⋮ Cornering Optics ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ A representation theorem for second-order functionals ⋮ Fibrations and universal view updatability ⋮ A Tangled Web of 12 Lens Laws ⋮ A programmable editor for developing structured documents based on bidirectional transformations ⋮ The complexity of embedded axiomatization for a class of closed database views ⋮ Session types without sophistry. System description ⋮ An efficient composition of bidirectional programs by memoization and lazy update ⋮ Towards a Domain-Specific Language for Reversible Assembly Sequences ⋮ Integration of formal proof into unified assurance cases with Isabelle/SACM ⋮ Comprehensive systems: a formal foundation for multi-model consistency management ⋮ Characterizing Compatible View Updates in Syntactic Bidirectionalization ⋮ Multiple model synchronization with multiary delta lenses with amendment and K-Putput ⋮ Strongly Typed Rewriting For Coupled Software Transformation

This page was built for publication: Combinators for bi-directional tree transformations