Journal article
Computation by ‘While’ programs on topological partial algebras
Abstract
The language of while programs is a fundamental model for imperative programming on any data type. It leads to a generalisation of the theory of computable functions on the natural numbers to the theory of computable functions on any many-sorted algebra. The language is used to express many algorithms in scientific computing where while programs are applied to continuous data. In the theory of data, continuous data types are modelled by …
Authors
Tucker JV; Zucker JI
Journal
Theoretical Computer Science, Vol. 219, No. 1-2, pp. 379–420
Publisher
Elsevier
Publication Date
May 1999
DOI
10.1016/s0304-3975(98)00297-7
ISSN
0304-3975