Skip Navigation

The Computer Journal 1975 18(3):223-226; doi:10.1093/comjnl/18.3.223
© 1975 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Baecker, H. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Areas and record-classes

H. D. Baecker *

Department of Computing Science, University of Calgary, Calgary, Alberta, Canada

To date list processing facilities have been imperfectly incorporated into general-purpose algorithmic languages. A brief survey of available forms of list processing is followed by an outline of required features of a list processing facility. The syntax and implementation of such a facility in an ALGOL like framework is then outlined.

Received December 1972.

* Department of Computing Science, University of Calgary, Calgary, Alberta, Canada T2N 1N4


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.