Technical Reports

The ICICS/CS Reading Room


UBC CS TR-77-08 Summary

Coroutines in a Theory of Programmable Machines, July 1977 J. L. Baker

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.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.