Relations as executable specifications: taming partiality and non-determinism using invariants
From MaRDI portal
Recommendations
Cites work
- A programmable editor for developing structured documents based on bidirectional transformations
- Bidirectionalization for free! (Pearl)
- Bidirectionalization transformation based on automatic derivation of view complement functions
- Bidirectionalizing graph transformations
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
- Combining syntactic and semantic bidirectionalization
- Extended Static Checking by Calculation Using the Pointfree Transform
- Generic point-free lenses
- Gradual refinement. Blending pattern matching with data abstraction
- scientific article; zbMATH DE number 1612493 (Why is no real title available?)
- scientific article; zbMATH DE number 910715 (Why is no real title available?)
- Multi-paradigm Declarative Languages
- Programming from Galois connections
- Programming Languages and Systems
- Quotient lenses
- Relations as executable specifications: taming partiality and non-determinism using invariants
- Transformation of structure-shy programs with application to XPath queries and strategic functions
Cited in
(2)
This page was built for publication: Relations as executable specifications: taming partiality and non-determinism using invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915141)