Combinators for Bidirectional Tree Transformations¶
Foster, J. N., Greenwald, M. B., Moore, J. T., Pierce, B. C., & Schmitt, A. (2007). Combinators for Bidirectional Tree Transformations: A Linguistic Approach to the View-Update Problem. ACM Transactions on Programming Languages and Systems, 29(3).
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Round-Trip Migration Test
- It is the operational form of the round-trip (or "there-and-back") identity, and the closest thing to a proof that a migration preserved everything it claimed to.
This sourceDefines well-behaved bidirectional transformations through round-trip laws requiring the two directions to restore the relevant value.
- It is the operational form of the round-trip (or "there-and-back") identity, and the closest thing to a proof that a migration preserved everything it claimed to.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:b73e12912181 · see in the full table