The paper introduces a class of program schemata based on recursion and non-determination whose expressive power overcomes the capability of the recursive non-deterministic schemata defined so far. The class contains complex schemata for which no equivalent standard recursive non-deterministic schema can be defined. As an example, we consider schemata express in a purely-syntactic way control constructs related to parallelism, such as coperation, synchronization, co-routing etc.
A logically based class of program schemata and its relation to complex control structures
1975
Abstract
The paper introduces a class of program schemata based on recursion and non-determination whose expressive power overcomes the capability of the recursive non-deterministic schemata defined so far. The class contains complex schemata for which no equivalent standard recursive non-deterministic schema can be defined. As an example, we consider schemata express in a purely-syntactic way control constructs related to parallelism, such as coperation, synchronization, co-routing etc.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_489357-doc_203764.pdf
accesso aperto
Descrizione: A logically based class of program schemata and its relation to complex control structures
Tipologia:
Versione Editoriale (PDF)
Dimensione
680.83 kB
Formato
Adobe PDF
|
680.83 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
