Equivalences on program schemes
β Scribed by R. Milner
- Book ID
- 104148014
- Publisher
- Elsevier Science
- Year
- 1970
- Tongue
- English
- Weight
- 654 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
A program scheme may be informally described as a program with the interpretation (i.e., the meaning of the basic instructions or standard functions) left unspecified. This paper studies the equivalence of program schemes under different classes of interpretations, with emphasis on those in which the functions are permitted to be partial. Several different equivalence relations are defined, and their interrelationship and solvability examined both for the class of all program schemes, and for each subclass (n >~ 1) in which the number of registers is at most n.
π SIMILAR VOLUMES
Some problems related to the class of program schemata introduced by R. M. Karp and R. M. Miller in paper [1] are solved in this paper. The method of the proof implemented in the paper allows us to obtain a negative solution of the existence problem of an algorithm for equivalence recognition for a