Abstraction mechanisms in CLU

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Abstraction mechanisms in CLU

Full text

Pdf (39 KB)

Source

Proceedings of an ACM conference on Language design for reliable software table of contents

Raleigh, North Carolina

Page: 140

Year of Publication: 1977

Also published in ...

Authors

Barbara Liskov	Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
Alan Snyder	Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
Russell Atkinson	Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
Craig Schaffert	Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 27, Citation Count: 4

Additional Information:

abstract cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800022.808322 What is a DOI?

ABSTRACT

CLU is a new programming language designed to support the use of abstractions in program construction. Work in programming methodology has led to the realization that three kinds of abstractions, procedural, control, and especially data abstractions, are useful in the programming process. Of these, only the procedural abstraction is supported well by conventional languages, through the procedure or subroutine. CLU provides, in addition to procedures, novel linguistic mechanisms that support the use of data and control abstractions. This paper provides an introduction to the abstraction mechanisms in CLU. By means of programming examples, we illustrate the utility of the three kinds of abstractions in program construction and show how CLU programs may be written to use and implement abstractions. We also discuss the CLU library, which permits incremental program development with complete type-checking performed at compile-time.

CITED BY 4

	James B. Morris, Data abstraction: A static implementation strategy, ACM SIGPLAN Notices, v.14 n.8, p.1-7, August 1979
	Leo J. Guibas , Douglas K. Wyatt, Compilation and delayed evaluation in APL, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.1-8, January 23-25, 1978, Tucson, Arizona
	Michael R. Levy, Modularity and the sequential file update problem, Communications of the ACM, v.25 n.6, p.362-367, June 1982
	B.L. Chamberlain , D. Callahan , H.P. Zima, Parallel Programmability and the Chapel Language, International Journal of High Performance Computing Applications, v.21 n.3, p.291-312, August 2007