This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Automating Relational Operations on Data Structures
May/June 1993 (vol. 10 no. 3)
pp. 53-60

An approach to having compilers do most of the implementation detail work in programming that divides a program into two parts is described. The specification part describes what the program should do, but in a way that avoids commitment to implementation details. The annotation part provides implementation instructions that the compiler will carry out. Annotations affect execution efficiency, but not functional behavior. They are very high level and usually very short and hence encourage experimentation. To try out different implementation choices, the programmer simply changes the annotations and recompiles. The implementation details related to data representations are discussed. The testing of compilers that produce Lisp code for iteration, and for adding and deleting tuples of composite relations, is reviewed.

Index Terms:
relational operations; data structures; compilers; programming; specification; annotation; Lisp code; iteration; tuples; automatic programming; entity-relationship modelling; formal specification; program compilers; relational databases
Citation:
Donald Cohen, Neil Campbell, "Automating Relational Operations on Data Structures," IEEE Software, vol. 10, no. 3, pp. 53-60, May-June 1993, doi:10.1109/52.210604
Usage of this product signifies your acceptance of the Terms of Use.