Skip Navigation

The Computer Journal 1964 7(1):28-35; doi:10.1093/comjnl/7.1.28
© 1964 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 Parker-Rhodes, A. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The communication of algorithms

A. F. Parker-Rhodes *

Cambridge Language Research Unit, Cambridge, UK

This paper introduces a programming-language of a new kind, intended to be usable as a high-level language or as a low-level language according to the programmers' immediate requirements, and to provide for the handling of data of any degree of complexity. The main features of the language are explained by deriving them step-by-step from a colloquial description of a fairly typical algorithm, that of merging two alphabetic lists. Subsequently, some additional facilities are described, and a specimen complete program is given. This does not amount to a formal exposition of the language syntactically, but should suffice for those interested to get acquainted with its use. Further experience of its application to various problems must be gathered before a definitive syntactic definition is provided.


* * Cambridge Language Research Unit, 20, Millington Road, Cambridge.


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.