article

Revised report on the algorithmic language ALGOL 68

Acta Informatica, Volume 5, Issue 1-3

Pages 1 - 236

https://doi.org/10.1007/BF00265077

Published: 01 March 1975 Publication History

Abstract

No abstract available.

Cited By

View all

Apt KOlderog E(2019)Fifty years of Hoare’s logicFormal Aspects of Computing10.1007/s00165-019-00501-331:6(751-807)Online publication date: 27-Nov-2019
https://dl.acm.org/doi/10.1007/s00165-019-00501-3
Muehlboeck FTate R(2018)Empowering union and intersection types with integrated subtypingProceedings of the ACM on Programming Languages10.1145/32764822:OOPSLA(1-29)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276482
Omar CAldrich J(2016)Programmable semantic fragments: the design and implementation of typyACM SIGPLAN Notices10.1145/3093335.299324552:3(81-92)Online publication date: 20-Oct-2016
https://dl.acm.org/doi/10.1145/3093335.2993245
Show More Cited By

Revised report on the algorithmic language ALGOL 68
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Revised Report on the Algorithmic Language Scheme

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele, Jr. and Gerald Jay Sussman. It was designed to have ...
Algol 68 as an extensible language

Most programming languages have one or more features which may be considered as extensions of the language. The most common such feature is the procedure, as it exists in Algol 60 or in PL/I, or the subroutine in Fortran. By means of this device it is ...
Algol 68 as an implementation language for portable interpreters
Proceedings of the Strathclyde ALGOL 68 conference

By making use of its advanced and highly expressive facilities, Algol 68 can be used to implement interpretive language processors with an unusual degree of conceptual clarity and machine independence. The internal representations of source programs in ...

Comments

Information & Contributors

Information

Published In

Acta Informatica Volume 5, Issue 1-3

March 1975

236 pages

ISSN:0001-5903

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 1975

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Apt KOlderog E(2019)Fifty years of Hoare’s logicFormal Aspects of Computing10.1007/s00165-019-00501-331:6(751-807)Online publication date: 27-Nov-2019
Muehlboeck FTate R(2018)Empowering union and intersection types with integrated subtypingProceedings of the ACM on Programming Languages10.1145/32764822:OOPSLA(1-29)Online publication date: 24-Oct-2018
Omar CAldrich J(2016)Programmable semantic fragments: the design and implementation of typyACM SIGPLAN Notices10.1145/3093335.299324552:3(81-92)Online publication date: 20-Oct-2016
Omar CAldrich JFischer BSchaefer I(2016)Programmable semantic fragments: the design and implementation of typyProceedings of the 2016 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences10.1145/2993236.2993245(81-92)Online publication date: 20-Oct-2016
Chen YSanders J(2010)UTP and sustainabilityProceedings of the Third international conference on Unifying theories of programming10.5555/1939848.1939850(46-73)Online publication date: 15-Nov-2010
Desoky AYounis M(2008)GraphstegaJournal of Digital Forensic Practice10.1080/155672807017970872:1(27-36)Online publication date: 1-Jan-2008
Noble JBiddle R(2004)Notes on notes on postmodern programmingACM SIGPLAN Notices10.1145/1052883.105289039:12(40-56)Online publication date: 1-Dec-2004
Knoop J(1998)Optimal interprocedural program optimizationundefinedOnline publication date: 1-Jan-1998
Nederhof MSatta GJoshi APalmer M(1996)Efficient tabular LR parsingProceedings of the 34th annual meeting on Association for Computational Linguistics10.3115/981863.981895(239-246)Online publication date: 24-Jun-1996
Cherubini ASan Pietro P(1996)A Polynomial-Time Parsing Algorithm forK-Depth LanguagesJournal of Computer and System Sciences10.1006/jcss.1996.000652:1(61-79)Online publication date: 1-Feb-1996
Show More Cited By

Abstract

Cited By

Recommendations

Revised Report on the Algorithmic Language Scheme

Algol 68 as an extensible language

Algol 68 as an implementation language for portable interpreters

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media