Semantic synthesis of programs by matching compositions
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.
scientific article; zbMATH DE number 4074453