Predicative programming Part II
- 1 February 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 27 (2) , 144-151
- https://doi.org/10.1145/69610.357990
Abstract
Part I of this two-part paper presented a new semantics of programs. Each program is considered to be a predicate, in a restricted notation, that specifies the observable behavior of a computer executing the program. We considered a variety of notations, including assignment, composition (semicolon), deterministic choice (if), nondeterministic choice, definition (nonrecursive and recursive), and variable declaration. We did not consider any input or output notations, or concurrency; that is the subject of Part II. We assume the reader is familiar with Part I, so that we can build on ideas presented there.Keywords
This publication has 4 references indexed in Scilit:
- A more complete model of communicating processesTheoretical Computer Science, 1983
- A methodology for programming with concurrency: An informal presentationScience of Computer Programming, 1982
- A calculus of total correctness for communicating processesScience of Computer Programming, 1981
- Communicating sequential processesCommunications of the ACM, 1978