Data Structure Fusion

We consider the problem of specifying 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; a novel fuse operation on relational indexes specifies where the underlying physical data structure representation has sharing. We permit the user to specify different concrete shared representations for relations, and show that the semantics of the relational specification are preserved.

• Type: Conference
• Year: 2010
• Where: APLAS
• Authors: Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv
• Keywords: Abstract Data Types, APLAS 2010, Concrete Shared Representations, Programming Languages, Relational Algebra