Incrementalizing Haskell implementation of Putback-based Bidirectional Transformation(…)
summary
Claims an update-based BiGUL (BigDelta) implemented in Haskell that replaces state-by-state propagation with edit operations adapted from X and Edit Lenses, uses a Bar generic type for mixed-state typing, and provides insert/delete/modify actions as edits. Benchmarks on a family→person model show insert/delete runtimes stay constant as source size grows and are substantially faster than state-based; modify still costs depend on source due to skip needing source access. Semantic equivalence and well-behavedness proofs for core primitives are reported; Bar risks runtime type errors.
AI-written summary · about
chapters (9)
- 0:00Bidirectional transformations intro
- 2:30Putback-based BX and updates
- 3:37BIG language in Haskell
- 6:12BIG implementation in Haskell
- 8:02Incrementalizing BIG with updates
- 9:28BIG performance evaluation
- 10:58Conclusion and future work
- 11:23Q&A on semantics
- 13:49Q&A on incrementalization
related talks
01h 32mResearch Methods for Designing Next-Generation Programming Systems
55mBreaking Dependencies: Type Erasure - The Implementation Details
22mThe Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation Logic
28mMethod Bundles (New Ideas/Vision paper)
51mStretching the Glasgow Haskell Compiler: Nourishing GHC with Domain-Driven De...
59mThe Most Valuable Values
22mShifting Left, Shifting Right
19mPredictable Verification using Intrinsic Definitions