Abstract
This talk describes work on one of the first applications of algebra to theoretical computer science, the study of recursive program schemes. I would like to put a lot of the past work in perspective and then to describe recent work by Stefan Milius and myself which reworks the classical theory of uninterpreted and interpreted recursive program schemes using tools from coalgebraic recursion theory. Finally, I hope to speculate on whether the new work could be of interest to those pursuing AMAST’s goal of ”setting of software technology on a firm, mathematical basis.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moss, L.S. (2006). Recursive Program Schemes: Past, Present, and Future. In: Johnson, M., Vene, V. (eds) Algebraic Methodology and Software Technology. AMAST 2006. Lecture Notes in Computer Science, vol 4019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11784180_2
Download citation
DOI: https://doi.org/10.1007/11784180_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35633-2
Online ISBN: 978-3-540-35636-3
eBook Packages: Computer ScienceComputer Science (R0)