Premium
An Introduction to SequenceL: A Language to Experiment with Constructs for Processing Nonscalars
Author(s) -
COOKE DANIEL E.
Publication year - 1996
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199611)26:11<1205::aid-spe57>3.0.co;2-6
Subject(s) - computer science , problem solver , solver , programming language , language construct , domain (mathematical analysis) , theoretical computer science , software engineering , mathematics , mathematical analysis
SequenceL is a language intended for experimentation with declarative constructs for nonscalar processing. In SequenceL, a problem solver provides little in the way of iterative/recursive details in a problem solution. Instead, the problem solver describes the solution directly by specifying, via a metastructure, the data structures which will hold results useful for solving the problem. SequenceL is a small language (i.e. there is a small number of language constructs), and it is not domain dependent. This paper is meant to introduce the reader to SequenceL.