ACM Home Page
Please provide us with feedback. Feedback
EULER: a generalization of ALGOL, and its formal definition: Part II
Full text PdfPdf (1.20 MB)
Source
Communications of the ACM archive
Volume 9 ,  Issue 2  (February 1966) table of contents
Pages: 89 - 99  
Year of Publication: 1966
ISSN:0001-0782
Authors
Niklaus Wirth  Stanford Univ., Stanford, CA
Helmut Weber  Stanford Univ., Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 38,   Citation Count: 42
Additional Information:

abstract   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/365170.365202
What is a DOI?

ABSTRACT

In this section the algorithmic language EULER is described first informally and then formally by its syntax and semantics. An attempt has been made to generalize and extend some of the concepts of ALGOL, thus creating a language which is simpler and yet more flexible than ALGOL 60. A second objective in developing this language was to show that a useful programming language which can be processed with reasonable efficiency can be defined in rigorous formality.


CITED BY  42
Collaborative Colleagues:
Niklaus Wirth: colleagues
Helmut Weber: colleagues