Understanding game semantics through coherence spaces
From MaRDI portal
Recommendations
Cites work
- A categorical semantics of higher order store
- Asynchronous games 3 an innocent model of linear logic
- Asynchronous games. II: The true concurrency of innocence
- Full abstraction for PCF
- Games and full abstraction for FPC.
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 1223612 (Why is no real title available?)
- scientific article; zbMATH DE number 1231510 (Why is no real title available?)
- scientific article; zbMATH DE number 1318513 (Why is no real title available?)
- scientific article; zbMATH DE number 1497810 (Why is no real title available?)
- On full abstraction for PCF: I, II and III
- Sequential algorithms and strongly stable functions
- Thick Subtrees, Games and Experiments
Cited in
(6)- Weighted models for higher-order computation
- Latent semantic analysis of game models using LSTM
- From qualitative to quantitative semantics. By change of base
- Grounding game semantics in categorical algebra
- From thin concurrent games to generalized species of structures (extended version)
- The relational machine calculus
This page was built for publication: Understanding game semantics through coherence spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178256)