Sequential algorithms and strongly stable functions (Q2570134)

From MaRDI portal
Revision as of 07:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references