The Parallel Intensionally Fully Abstract Games Model of PCF
From MaRDI portal
Publication:4635807
Recommendations
- The concurrent game semantics of probabilistic PCF
- Qualitative concurrent parity games: bounded rationality
- Toward a Generic Mathematical Model of Abstract Game Theories
- Game theoretical semantics for paraconsistent logics
- An application of model checking games to abstract argumentation
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- A parallel game semantics for linear logic
- Intuitionistic games: determinacy, completeness, and normalization
- An abstraction-refinement methodology for reasoning about network games
- Payoffs, intensionality and abstraction in games
Cited in
(15)- Continuous probability distributions in concurrent games
- Bayesian strategies: probabilistic programs as generalised graphical models
- scientific article; zbMATH DE number 7533341 (Why is no real title available?)
- The concurrent game semantics of probabilistic PCF
- Full abstraction for PCF
- On full abstraction for PCF: I, II and III
- The mays and musts of concurrent strategies
- A truly concurrent game model of the asynchronous \(\pi\)-calculus
- A tale of additives and concurrency in game semantics
- Concurrent structures in game semantics
- Fibred pseudo double categories for game semantics
- Foundations of Software Science and Computation Structures
- Disentangling parallelism and interference in game semantics
- Concurrent quantum strategies
- scientific article; zbMATH DE number 7204431 (Why is no real title available?)
This page was built for publication: The Parallel Intensionally Fully Abstract Games Model of PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635807)