Computable compositions and universal program logics (Q800721): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q195143 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Hirokazu Nishimura / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computable compositions and universal program logics |
scientific article |
Statements
Computable compositions and universal program logics (English)
0 references
1983
0 references
Inspired by so-called composition programming developed by V. N. Red'ko, this paper formalizes the notion of computable composition and its corresponding thesis, which may be regarded as a relativized version of celebrated Church's thesis. The author uses this new formalism to define universal imperative program logics.
0 references
partial recursive function
0 references
composition programming
0 references
computable composition
0 references
Church's thesis
0 references
universal imperative program logics
0 references
