Recursive Program Schemes: Past, Present, and Future

  • Lawrence S. Moss
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4019)


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.”

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Lawrence S. Moss
    • 1
  1. 1.Department of MathematicsIndiana UniversityBloomingtonUSA

Personalised recommendations