An example of programming with abstract data types

Jack B. Dennis · ACM SIGPLAN Notices · 1975

Concepts of good program structure can and should be reflected in the design of programming languages. Thus there are two criteria for use by language designers: First, work in the area of formal proof of program correctness has shown that program proofs are greatly simplified if certain features are absent from the language in which the programs are expressed -- for example, no goto's or the absence of side effects in the execution of procedures. Second: the closeness of the language to the problem domain affects the ease with which the programmer may express a problem solution -- in particular, the data types of the language should provide a convenient match to the abstractions of the problem. A programming language should provide tools for building abstractions that are natural for the problem at hand.

Read the paper · More papers on PaperTik