Coroutines in a Theory of Programmable Machines
ID
TR-77-08
Publishing date
July 1977
Abstract
It is shown that, in the author's theory of programmable machines, the composition of functions computable by programs is in some important cases computable by a program constructed to use the given programs as coroutines. To illustrate the utility of this result, a characterization of the full AFLs in terms of programmable machines is established with its help.
File(s)