This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Notes on Type Abstraction (Version 2)
January 1980 (vol. 6 no. 1)
pp. 13-23
J. Guttag, Laboratory for Computer Science, Massachusetts Institute of Technology
This paper, which was initially prepared to accompany a series of lectures given at the 1978 NATO International Summer School on Program Construction, is primarily tutorial in nature. It begins by discussing in a general setting the role of type abstraction and the need for formal specifications of type abstractions. It then proceeds to examine in some detail two approaches to the construction of such specifications: that proposed by Hoare in his 1972 paper "Proofs of Correctness of Data Representations," and the author's own version of algebraic specifications. The Hoare approach is presented via a discussion of its embodiment in the programming language Euclid. The discussion of the algebraic approach includes material abstracted from earlier papers as well as some new material that has yet to appear. This new material deals with parameterized types and the specification of restrictions. The paper concludes with a brief discussion of the relative merits of the two approaches to type abstraction.
Index Terms:
proof rules, Abstract data types, abstraction, algebraic axioms, program verification
Citation:
J. Guttag, "Notes on Type Abstraction (Version 2)," IEEE Transactions on Software Engineering, vol. 6, no. 1, pp. 13-23, Jan. 1980, doi:10.1109/TSE.1980.230209
Usage of this product signifies your acceptance of the Terms of Use.