ALGOL 60
ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages. It followed on from ALGOL 58 which had introduced code blocks and the begin and end pairs for delimiting them. ALGOL 60 was the first language implementing nested function definitions with lexical scope. It gave rise to many other programming languages, including CPL, Simula, BCPL, B, Pascal and C. Niklaus Wirth based his own ALGOL W on ALGOL 60 before moving to develop Pascal. Algol-W was intended to be the next generation ALGOL but the ALGOL 68 committee decided on a design that was more complex and advanced rather than a cleaned simplified ALGOL 60. The official ALGOL versions are named after the year they were first published. Algol 68 is substantially different from Algol 60 and was criticised partially for being so, so that in general ”Algol” refers to dialects of Algol 60 (wikipedia).
Keywords for this software
References in zbMATH (referenced in 661 articles , 2 standard articles )
Showing results 1 to 20 of 661.
Sorted by year (- de Mingo López, Luis Fernando; Blas, Nuria Gómez; Castellanos Peñuela, Angel Luis; Castellanos Peñuela, Juan Bautista: Swarm intelligence models: ant colony systems applied to BNF grammars rule derivation (2020)
- Kutrib, Martin: Kernels of sub-classes of context-free languages (2020)
- Lejeune, Marie; Rigo, Michel; Rosenfeld, Matthieu: The binomial equivalence classes of finite words (2020)
- Apt, Krzysztof R.; Olderog, Ernst-Rüdiger: Fifty years of Hoare’s logic (2019)
- Beier, Simon; Holzer, Markus: Properties of right one-way jumping finite automata (2019)
- Beier, Simon; Holzer, Markus; Kutrib, Martin: Operational state complexity and decidability of jumping finite automata (2019)
- Brezinski, Claude; Redivo-Zaglia, Michela: The genesis and early developments of Aitken’s process, Shanks’ transformation, the (\varepsilon)-algorithm, and related fixed point methods (2019)
- Demirci, Gökalp; Hirvensalo, Mika; Reinhardt, Klaus; Say, A. C. Cem; Yakaryılmaz, Abuzer: Alternating, private alternating, and quantum alternating realtime automata (2019)
- Ivanov, Ilya E.: Periodic properties of pushdown automata (2019)
- Pighizzini, Giovanni; Prigioniero, Luca: Limited automata and unary languages (2019)
- Quinlan, Dee; Wells, Joe B.; Kamareddine, Fairouz: BNF-style notation as it is actually used (2019)
- Bedon, Nicolas: Complementation of branching automata for scattered and countable (N)-free posets (2018)
- Bodini, Olivier; Gardy, Danièle; Gittenberger, Bernhard; Gołębiewski, Zbigniew: On the number of unary-binary tree-like structures with restrictions on the unary height (2018)
- Goldreich, Oded; Gur, Tom; Rothblum, Ron D.: Proofs of proximity for context-free languages and read-once branching programs (2018)
- Guo, Lankun; Li, Qingguo; Yao, Lingjuan: Locally complete consistent F-augmented contexts: a category-theoretic representation of algebraic L-domains (2018)
- Ivanov, I. E.: One-counter pushdown-storage automata as transducers of sequences (2018)
- Nguyen, Danny; Pak, Igor: Enumerating projections of integer points in unbounded polyhedra (2018)
- Srinivasan, Ashwin; Bain, Michael: An empirical study of on-line models for relational data streams (2017)
- Terrier, Véronique: Recognition of poly-slender context-free languages by trellis automata (2017)
- Chambart, Pierre; Finkel, Alain; Schmitz, Sylvain: Forward analysis and model checking for trace bounded WSTS (2016)