Semantic synthesis of programs by matching compositions (Q1111007): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:16, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semantic synthesis of programs by matching compositions |
scientific article |
Statements
Semantic synthesis of programs by matching compositions (English)
0 references
1987
0 references
We identify classes of functions induced by programs with the property of requesting the presence and the values of the input data. Classes of matching compositions are defined, formalizing the main tools of program construction and simplifying the semantic synthesis of programs in the corresponding classes. The relationship between matching compositions and traditional compositions is established.
0 references
program algebras
0 references
matching compositions
0 references
program construction
0 references
semantic synthesis of programs
0 references