Predicative programming Part I
- 1 February 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 27 (2), 134-143
- https://doi.org/10.1145/69610.357988
Abstract
Programs are given a new semantics with the merit that a specification written as a first-order predicate can be refined, step by step, to a program via the rules of Predicate Calculus. The semantics allows a free mixture of predicate and programming notations, and manipulation of programs.Keywords
This publication has 8 references indexed in Scilit:
- A generalized control structure and its formal definitionCommunications of the ACM, 1983
- Fixed point theorems and semantics: a folk taleInformation Processing Letters, 1982
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Lucid—A Formal System for Writing and Proving ProgramsSIAM Journal on Computing, 1976
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967