Dynamic game semantics
From MaRDI portal
Publication:4988428
DOI10.1017/S0960129520000250zbMath1495.68128arXiv1601.04147MaRDI QIDQ4988428
Samson Abramsky, Norihiro Yamada
Publication date: 14 May 2021
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04147
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Categorical semantics of formal languages (18C50) General topics in the theory of computing (68Q01)
Related Items (1)
Cites Work
- Geometry of interaction. V: Logic in the hyperfinite factor
- Linear logic
- Totality in arena games
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
- Notions of computation and monads
- Lectures on the Curry-Howard isomorphism
- LCF considered as a programming language
- Categorical logic and type theory
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- The differential lambda-calculus
- Polarized games
- Multiple-Bias Modelling for Analysis of Observational Data
- Higher-Order Computability
- Data Types as Lattices
- Continuous Lattices and Domains
- Static Analysis
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamic game semantics