Sequential algorithms and strongly stable functions (Q2570134): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.05.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981700077 / rank | |||
Normal rank | |||
Revision as of 02:14, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential algorithms and strongly stable functions |
scientific article |
Statements
Sequential algorithms and strongly stable functions (English)
0 references
26 October 2005
0 references
The author develops a graph-theoretic approach to game semantics by shifting from sequential game plays on trees to sequential games played on acyclic graphs. This clarifies the sequential nature of hypercoherence spaces, and the reasons why the sequential algorithm hierarchy collapses extensionally to strongly stable hierarchy. The results underline more asynchronous and concurrent forms of game semantics --- even in the study of sequentiality.
0 references
game semantics
0 references
linear logic
0 references
sequential algorithms
0 references
strongly stable functions
0 references
extensional collapse
0 references
