Skip Navigation

The Computer Journal 1969 12(4):332-341; doi:10.1093/comjnl/12.4.332
© 1969 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Housden, R. J. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A note on list-processing in BCL

R. J. W. Housden *

The Computer Centre, University of East Anglia, Norwich, UK

This paper describes a simple list-processing system which is based on BCL, a general purpose language with special emphasis on data structures. The basic LISP functions are defined in BCL and examples given of recursive functions. A program to input and differentiate polynomial expressions is described. The system has been used for teaching list-processing techniques to M.Sc. students and has the advantage that the user can get close to its innermost workings. Nodes of several different sizes may be set up and used to build multilinked structures by planting in various fields pointers to other nodes.

Received January 1969.

* University of London Institute of Computer Science, 44 Gordon Square, London WC1. Now at The Computer Centre, University of East Anglia, Norwich


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.