Abstract
A language for operation on a stack (SOL) is defined formally, also from the semantic point of view. The semantics is an input-output semantics which uses functions from sequences (of integers) of indefinite length to sequences (of integers) of indefinite length as models of the computation on a stack. The programs in SOL are interpreted in recursive systems of functional definitions to which fixed point theory easily applies in order to evaluate the functions computed by the programs.
The language has been implemented and used for didactic purposes.
Get full access to this article
View all access options for this article.