An efficient composition of bidirectional programs by memoization and lazy update (Q2039945): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-59025-3_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3086637025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Update semantics of relational views / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boomerang / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinators for bi-directional tree transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4420427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deforestation: Transforming programs to eliminate trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:12, 26 July 2024

scientific article
Language Label Description Also known as
English
An efficient composition of bidirectional programs by memoization and lazy update
scientific article

    Statements

    An efficient composition of bidirectional programs by memoization and lazy update (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2021
    0 references
    bidirectional transformation
    0 references
    implementation technique
    0 references
    efficiency
    0 references
    optimization
    0 references
    tupling
    0 references

    Identifiers