Data Structures in the Icon Programming Language.
Ralph E. Griswold · Computing systems · 1989
The lcon programming language pro- vides a rich variety of data structures with sophisti- cated facilities: sets of arbitrary values, tables with associative lookup, lists with positional and deque access mechanisms, and records that extend the type repertoire ofthe language. Instances ofthese structures are created at run-time and grow and shrink as values are added to or removed from them. Storage management is automatic. This paper describes these structures and their use in combination with lcon's goal-directed evaluation mechanism. Examples illustrate the use of pointer semantics and heterogeneity and how the natural geometrical interpretation of structures like trees and graphs in the problem domain is imaged in the programming domain.