Game theoretic analysis of call-by-value computation
From MaRDI portal
Publication:4571955
DOI10.1007/3-540-63165-8_180zbMath1401.68032OpenAlexW1533929999MaRDI QIDQ4571955
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_180
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Related Items (13)
Game-theoretic analysis of call-by-value computation ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ A Game Semantics of Idealized CSP ⋮ Dialogue Categories and Frobenius Monoids ⋮ Unnamed Item ⋮ Models for the computational λ-calculus ⋮ Functions with local state: regularity and undecidability ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Full Abstraction for Reduced ML ⋮ Games for complexity of second-order call-by-name programs ⋮ Games and full abstraction for FPC. ⋮ On full abstraction for PCF: I, II and III ⋮ Premonoidal categories as categories with algebraic structure
Uses Software
Cites Work
- Linear logic
- Notions of computation and monads
- Partial morphisms in categories of effective objects
- Categories of partial maps
- A calculus of communicating systems
- Sequential algorithms on concrete data structures
- A game semantics for linear logic
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- Synchronization trees
- Games and full abstraction for FPC.
- A relational account of call-by-value sequentiality
- Functions as processes
- Games and full completeness for multiplicative linear logic
- Premonoidal categories and notions of computation
- 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: Game theoretic analysis of call-by-value computation