OCTOLISP: An experiment with data structures

dc.contributor.author	Dempster, Robert
dc.date.accessioned	2018-05-18T23:41:39Z
dc.date.available	2018-05-18T23:41:39Z
dc.date.issued	1990
dc.identifier.citation	Dempster R (1990) OCTOLISP: An experiment with data structures. South African Computer Journal, Number 3, 1990	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/23936
dc.description.abstract	OCTOLISP is a functional programming language which provides the programmer with a number of explicit data structures, such as lists, stacks, vectors, sets, trees and forests. Each of these data structures also has a specific access mechanism associated with it which affects the manner in which computations using the structures behave. The language thus contains a relatively high level of abstraction and it is the purpose of this paper to show that this is the case. This will be done by firstly describing the language in enough detail to make a program written using the language understandable, and then by discussing an algorithm implemented in OCTOLISP.	en
dc.language		en
dc.language.iso	en	en
dc.publisher	South African Institute of Computer Scientists and Information Technologists	en
dc.subject	Lambda expression	en
dc.subject	Concurrency	en
dc.subject	Parallellism	en
dc.title	OCTOLISP: An experiment with data structures	en
dc.type	Article	en