Euler (programming language)
This article needs additional citations for verification. (January 2021) (Learn how and when to remove this template message)
- Simpler, yet more flexible, than ALGOL 60
- Useful and processed with reasonable efficiency
- Definable with rigorous formality
|Paradigms||Multi-paradigm: procedural, imperative, structured|
|Designed by||Niklaus Wirth|
Available sources indicate that Euler was operational by 1965.
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.
- 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.