Inductive methods for proving properties of programs
Communications of the ACM
Correct and optimal implementations of recursion in a simple programming language
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Models of LCF.
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
On the Yoneda completion of a quasi-metric space
Theoretical Computer Science
Parameter-passing mechanisms and nondeterminism
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Some transformations for developing recursive programs
Proceedings of the international conference on Reliable software
Program equivalence and context-free grammars
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In this paper, we provide a simple recursive programming language with a semantics and a formal proof system, along the lines of [5], [17] and [23]. We show that the semantics used is the “best” possible if one admits the validity of Algol's copy rule, and that the proof system is complete with respect to the semantics. The definitions and methods used are meant to provide a basis for a broader theory of program schemas, which models parallel as well as sequential programs.