There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953)
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: There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations |
scientific article; zbMATH DE number 6585357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations |
scientific article; zbMATH DE number 6585357 |
Statements
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (English)
0 references
26 May 2016
0 references
formal semantics
0 references
denotational semantics
0 references
fixpoint semantics
0 references
fully abstract semantics
0 references
non-determinism
0 references
infinite computations
0 references
concurrency
0 references
0 references
0.7898623943328857
0 references
0.7744894623756409
0 references
