SOL: an exercise in defining a language

Article type: Research Article

Authors: Maggiolo-Schettini, A. | Uccella, G.

Affiliations: Gruppo Nazionale di Informatica Matematica del C.N.R., c/o Istituto di Scienze dell’Informazione, Università di Pisa, 16500 Pisa, Italy

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.

Keywords: Programming languages, stack functions fixed point semantics

DOI: 10.3233/FI-1978-2121

Journal: Fundamenta Informaticae, vol. 2, no. 1, pp. 337-349, 1978