Semantic synthesis of programs by matching compositions (Q1111007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1111007 |
scientific article; zbMATH DE number 4074453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semantic synthesis of programs by matching compositions |
scientific article; zbMATH DE number 4074453 |
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
0.7431158423423767
0 references
