To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Euler (programming language)

From Wikipedia, the free encyclopedia

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.

YouTube Encyclopedic

  • 1/3
    Views:
    41 761
    16 569
    10 447
  • Project Euler Challenges 1–4 - Coding Challenges with Florin
  • euler method in c programming
  • The Euler Project // Episode 1

Transcription

Overview

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:

  • Reference
  • Label
  • Symbol
  • List (array)
  • Procedure
  • Undefined

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

References

  1. ^ Wirth, Niklaus; Weber, Helmut (1966). "Euler: a generalization of ALGOL, and its formal definition: Part I". Communications of the ACM. 9 (1): 13–25.
  2. ^ Wirth, Niklaus; Weber, Helmut (1966). "Euler: a generalization of ALGOL, and its formal definition: Part II". Communications of the ACM. 9 (2): 89–99.
  3. ^ 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

This page was last edited on 2 March 2024, at 01:21
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.