A practical theory of programming (Q808685): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6423(90)90018-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4212949860 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:57, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A practical theory of programming |
scientific article |
Statements
A practical theory of programming (English)
0 references
1990
0 references
The authors propose the new theory of programming, in which programs are predicates, programming is proving and termination is timing. The specification of computer behavior to be a predicate in the initial (input) and final (output) values is considered. All well understood predicates are allowed as predicates. Some useful notation from the application area may be defined (for example, if-then-else construction, sequential composition and so on). A program in this theory is a predicate. This is simpler than \textit{Dijkstra}'s \(wp\) and \textit{Jones}' \({\mathcal V}{\mathcal D}{\mathcal M}\). The notion of refinement is also simpler: universaly quantified implication. The problems of sequential and concurrent computations, communicating processes, infinite interactive computations are solved in the frames of this theory.
0 references
programs are predicates
0 references
programming is proving
0 references
termination is timing
0 references