Mathematical overkill and the structure theorem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Mathematical overkill and the structure theorem

Full text

Pdf (176 KB)

Source

ACM SIGPLAN Notices archive
Volume 10 , Issue 2 (February 1975) table of contents

Pages: 32 - 33

Year of Publication: 1975

ISSN:0362-1340

Author

Thomas W. S. Plum

State University of New York, Birghamton, New York

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by 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/953438.953442 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	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]
	2	IBM Corporation. "Improved Technology for Application Development Management Overview". Presented by Bert Partch at SHARE XLI, (Sept. 13--17, 1973). Pp. 1281--1300. Also presented as "Improved Programming Technologies Management Overview" by Ed L. Henry at CUMREC 74 (19th Annual College and University Machine Records Conference, May 5--8, 1974), Baylor University.
	3	Melvin E. Conway, Design of a separable transition-diagram compiler, Communications of the ACM, v.6 n.7, p.396-408, July 1963 [doi>10.1145/366663.366704]
	4	W. A. Woods. "An Experimental Parsing System for Transition Network Grammars". In Randall Rustin (Ed.), <u>Natural Language Processing</u>. New York: Algorithmics Press. 1973. Pp. 111--154.
	5	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]

CITED BY 2

	David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980
	David Harel, On folk theorems, ACM SIGACT News, v.12 n.3, Fall 1980

Collaborative Colleagues:

Thomas W. S. Plum: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player