Data representation synthesis

We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both 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 dec...

Full description

Bibliographic Details
Main Authors: Hawkins, Peter, Aiken, Alex, Fisher, Kathleen, Rinard, Martin C., Sagiv, Mooly
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2012
Online Access:http://hdl.handle.net/1721.1/72442
https://orcid.org/0000-0001-8095-8523