{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:18Z","timestamp":1750308138961,"version":"3.41.0"},"reference-count":1,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[1969,8,1]],"date-time":"1969-08-01T00:00:00Z","timestamp":-13219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGPLAN Not."],"published-print":{"date-parts":[[1969,8]]},"abstract":"<jats:p>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 possible for the programmer to give a name to a portion of his algorithm and to invoke this portion one or more times simply by using that name. Algol 68 has, of course, such familiar features, but it has others which may not be so familiar. It is our intention to describe, by means of an example, some of the newer language extension features of Algol 68.<\/jats:p>","DOI":"10.1145\/1115858.1115861","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T22:51:53Z","timestamp":1147128713000},"page":"9-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Algol 68 as an extensible language"],"prefix":"10.1145","volume":"4","author":[{"given":"Barry J.","family":"Mailloux","sequence":"first","affiliation":[{"name":"University of Alberta"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John E. L.","family":"Peck","sequence":"additional","affiliation":[{"name":"University of Calgary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1969,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"J. E. L. Peck and C. H. A. Koster, Report on the Algorithmic Language Algol 68","author":"Van Wijngaarden B. J.","year":"1969","unstructured":"A Van Wijngaarden (Editor), B. J. Mailloux , J. E. L. Peck and C. H. A. Koster, Report on the Algorithmic Language Algol 68 , Mathematisch Centrum, Amsterdam , MR 101, February 1969 . A Van Wijngaarden (Editor), B. J. Mailloux, J. E. L. Peck and C. H. A. Koster, Report on the Algorithmic Language Algol 68, Mathematisch Centrum, Amsterdam, MR101, February 1969."}],"container-title":["ACM SIGPLAN Notices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1115858.1115861","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1115858.1115861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:38Z","timestamp":1750262918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1115858.1115861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,8]]},"references-count":1,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1969,8]]}},"alternative-id":["10.1145\/1115858.1115861"],"URL":"https:\/\/doi.org\/10.1145\/1115858.1115861","relation":{},"ISSN":["0362-1340","1558-1160"],"issn-type":[{"type":"print","value":"0362-1340"},{"type":"electronic","value":"1558-1160"}],"subject":[],"published":{"date-parts":[[1969,8]]},"assertion":[{"value":"1969-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}