Pages that link to "Item:Q4571955"
From MaRDI portal
The following pages link to Game theoretic analysis of call-by-value computation (Q4571955):
Displaying 14 items.
- Functions with local state: regularity and undecidability (Q557802) (← links)
- Premonoidal categories as categories with algebraic structure (Q1605185) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- On full abstraction for PCF: I, II and III (Q1854393) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Bayesian strategies: probabilistic programs as generalised graphical models (Q2233478) (← links)
- Games for complexity of second-order call-by-name programs (Q2570133) (← links)
- Processes and games (Q2851048) (← links)
- Full Abstraction for Reduced ML (Q3617719) (← links)
- A Game Semantics of Idealized CSP (Q4917059) (← links)
- Dialogue Categories and Frobenius Monoids (Q4922083) (← links)
- Models for the computational λ-calculus (Q4923379) (← links)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators (Q5958469) (← links)
- An axiomatic account of a fully abstract game semantics for general references (Q6612783) (← links)