Pages that link to "Item:Q1170880"
From MaRDI portal
The following pages link to Sequential algorithms on concrete data structures (Q1170880):
Displaying 50 items.
- Preface to the special volume (Q534064) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Resource modalities in tensor logic (Q636303) (← links)
- I-categories as a framework for solving domain equations (Q685401) (← links)
- Prime algebraicity (Q843107) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Event structures and domains (Q1124367) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Universal homogeneous event structures and domains (Q1175945) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Information categories (Q1320330) (← links)
- Synchronization trees (Q1348524) (← links)
- Decidability results for primitive recursive algorithms (Q1399975) (← links)
- Recursive domain equations for concrete data structure (Q1823005) (← links)
- On the logic of unification (Q1823935) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
- Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Axiomatization and characterization of BSP algorithms (Q2011205) (← links)
- On dialogue games and graph games (Q2130592) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- A stable programming language (Q2492185) (← links)
- Locally Boolean domains (Q2566030) (← links)
- Sequential algorithms and strongly stable functions (Q2570134) (← links)
- Some Programming Languages Suggested by Game Models (Extended Abstract) (Q2805154) (← links)
- An Algebraic Account of References in Game Semantics (Q2805167) (← links)
- Non-Uniform Hypercoherences (Q2842815) (← links)
- (Q2851048) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- Probabilistic π-Calculus and Event Structures (Q2870289) (← links)
- From Qualitative to Quantitative Semantics (Q2988359) (← links)
- Non-uniform (hyper/multi)coherence spaces (Q3081320) (← links)
- Interpreting Localized Computational Effects Using Operators of Higher Type (Q3507453) (← links)
- Nondeterminism and Observable Sequentiality (Q3644761) (← links)
- Universal domains and the amalgamation property (Q4279243) (← links)
- (Q4513599) (← links)
- Game theoretic analysis of call-by-value computation (Q4571955) (← links)
- What is a universal higher-order programming language? (Q4630303) (← links)
- Symmetry and Interactivity in Programming (Q4650295) (← links)
- (Q5028431) (← links)
- Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
- Stable bistructure models of PCF (Q5096876) (← links)
- Redexes are stable in the λ-calculus (Q5269004) (← links)
- On the reification of semantic linearity (Q5741580) (← links)
