An introduction to data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies. We describe a language of decompos...
Váldodahkkit: | Hawkins, Peter, Rinard, Martin C, Aiken, Alex, Sagiv, Mooly, Fisher, Kathleen |
---|---|
Eará dahkkit: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Materiálatiipa: | Artihkal |
Giella: | English |
Almmustuhtton: |
Association for Computing Machinery (ACM)
2020
|
Fáttát: | |
Liŋkkat: | https://hdl.handle.net/1721.1/124647 |
Geahča maid
-
Data representation synthesis
Dahkki: Hawkins, Peter, et al.
Almmustuhtton: (2012) -
Concurrent data representation synthesis
Dahkki: Hawkins, Peter, et al.
Almmustuhtton: (2012) -
Data structure fusion
Dahkki: Hawkins, Peter, et al.
Almmustuhtton: (2011) -
Introduction: democracy, courts and the dilemmas of representation
Dahkki: Bellamy, R, et al.
Almmustuhtton: (2013) -
A representation for musical dialects
Dahkki: Levitt, David Alex
Almmustuhtton: (2006)