Euler (programming language)
Euler is a programming language created by Niklaus Wirth and Helmut Weber, conceived as an extension and generalization of ALGOL 60. The designers' goals were to create a language that is: Simpler, yet more flexible, than ALGOL 60 Useful and processed with reasonable efficiency Definable with rigorous formality Available sources indicate that Euler was operational by 1965.
 | This article needs additional citations for verification. (January 2021) |
| Euler | |
|---|---|
| Paradigms | Multi-paradigm: procedural, imperative, structured |
| Family | ALGOL Wirth |
| Designed by | Niklaus Wirth Helmut Weber |
| Developers | Stanford University ETH Zurich |
| First appeared | 1965 |
| Typing discipline | dynamic |
| Scope | Lexical |
| Influenced by | |
| ALGOL 60 | |
Euler is a programming language created by Niklaus Wirth and Helmut Weber, conceived as an extension and generalization of ALGOL 60.[1][2][3] The designers' goals were to create a language that is:
- Simpler, yet more flexible, than ALGOL 60
- Useful and processed with reasonable efficiency
- Definable with rigorous formality
Available sources indicate that Euler was operational by 1965.
Overview
[edit]Euler employs a general data type concept. In Euler, arrays, procedures, and switches are not quantities which are declared and named by identifiers: in contrast to ALGOL, they are not quantities on the same level as variables. Rather, these quantities are on the level of numeric and boolean constants. Thus, besides the traditional numeric and logical constants, Euler introduces several added types:
All constants can be assigned to variables, which have the same form as in ALGOL, but for which no fixed types are specified: Euler uses dynamic typing. Further, a procedure can produce a value of any type when executed, and this type can vary from one call of the procedure to the next.
Similarly, the elements of a list can have values of any type and these can differ from element to element within a list. So, when the list elements are labels, a switch is obtained. If the elements are procedures, a procedure list is obtained, which is unavailable in ALGOL 60. If the elements are lists themselves, then a general tree structure is obtained.
Euler provides general type-test and type-conversion operators.
See also
[edit]References
[edit]- ^ Wirth, Niklaus; Weber, Helmut (1966). "Euler: a generalization of ALGOL, and its formal definition: Part I". Communications of the ACM. 9 (1): 13–25.
- ^ Wirth, Niklaus; Weber, Helmut (1966). "Euler: a generalization of ALGOL, and its formal definition: Part II". Communications of the ACM. 9 (2): 89–99.
- ^ Christopher, Thomas W. (1997). Euler: An Experiment in Language Definition (PDF) (Report). Illinois Institute of Technology. Archived from the original (PDF) on 1 September 2006.
External links
[edit]- EULER on GitHub - EULER IV for the Burroughs B5500 from 1965
- euler on GitHub - An implementation written in Icon from 2000 to 2001
| Software |
| ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Workstations | |||||||||
| Workplaces |
| ||||||||
| Collaborators | |||||||||
| Awards |
| ||||||||
