The 'natural' set of basic control structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The 'natural' set of basic control structures

Full text

Pdf (461 KB)

Source

ACM SIGPLAN Notices archive
Volume 8 , Issue 12 (December 1973) table of contents

COLUMN: Technical contributions table of contents

Pages: 5 - 14

Year of Publication: 1973

ISSN:0362-1340

Author

Johannes J. Martin

State University, Blacksburg, Virginia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Citation Count: 6

Additional Information:

references cited by

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/987006.987008 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	<u>Proceedings: 1972 ACM Annual Conference</u>, SIGPLAN Sessions on Control Structures in Programming Languages, Boston, Massachussetts.
	2	David A. Fisher, A survey of control structures in programming languages, ACM SIGPLAN Notices, v.7 n.11, November 1972 [doi>10.1145/987361.987363]
	3	Foulk, Clinton R., "Smooth Programs", <u>Proceedings: Computer Science Conference</u>, Columbus, Ohio, February 1973.
	4	Corrado Böhm , Giuseppe Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, v.9 n.5, p.366-371, May 1966 [doi>10.1145/355592.365646]
	5	Ashcroft, E., and Manna, Z., "The translation of "goto" programs into "while" programs, <u>IFIP</u>, 1971.
	6	Dijkstra, E. W., "Notes on Structured Programming", August 1969.
	7	Edsger W. Dijkstra, Letters to the editor: go to statement considered harmful, Communications of the ACM, v.11 n.3, p.147-148, March 1968 [doi>10.1145/362929.362947]
	8	Knuth, Floyd, Notes on Avoiding 'GOTO' Statements, Technical Report CS 148, Stanford University, January 1970.
	9	W. A. Wulf , D. B. Russell , A. N. Habermann, BLISS: a language for systems programming, Communications of the ACM, v.14 n.12, p.780-790, Dec. 1971 [doi>10.1145/362919.362936]

CITED BY 6

	Lawrence Yelowitz, Derivation of a Path-Connectivity Matrix for Tagged Flowcharts, Journal of the ACM (JACM), v.22 n.1, p.145-154, Jan. 1975
	John Beidler, A place for assembler in structured programming, ACM SIGCSE Bulletin, v.9 n.1, p.108-112, Feb 1977
	David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980
	Leonard H. Weiner, The roots of structured programming, ACM SIGCSE Bulletin, v.10 n.1, February 1978
	David Harel, On folk theorems, ACM SIGACT News, v.12 n.3, Fall 1980
	Ken Kennedy , Linda Zucconi, Applications of a graph grammar for program control flow analysis, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.72-85, January 17-19, 1977, Los Angeles, California

Adobe Acrobat

QuickTime

Windows Media Player

Real Player