Formal Models and Semantics

Formal Models and Semantics

Handbook of Theoretical Computer Science
1990, Pages 459, 461-492
Formal Models and Semantics

CHAPTER 9 - Recursive Applicative Program Schemes

https://doi.org/10.1016/B978-0-444-88074-1.50014-7Get rights and content

Publisher Summary

This chapter presents a survey of recursive applicative program schemes. This class has a very rich mathematical theory. The chapter describes the syntax of schemes and the class of interpretations, and discusses semantical mapping. It also discusses terminating computations in continuous interpretations. The chapter presents a few transformation rules applicable to recursive applicative programs. As iterative programs can be expressed recursively, these rules can be used to transform recursive programs into iterative ones. One method consists of using tranformation rules that are known to transform programs or program schemes into equivalent ones. The chapter also provides an overview of the historical development of the notion of program scheme.

References (0)

Cited by (0)

View full text