Pages that link to "Item:Q1960532"
From MaRDI portal
The following pages link to Game-theoretic analysis of call-by-value computation (Q1960532):
Displaying 23 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Linearity and bisimulation (Q997996) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Game semantics and linear CPS interpretation (Q1770417) (← links)
- Polarized games (Q1886321) (← links)
- Eager functions as processes (Q2123050) (← links)
- Continuous probability distributions in concurrent games (Q2134837) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- A game semantics of names and pointers (Q2474444) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- Definability and full abstraction (Q2864154) (← links)
- Block structure vs scope extrusion: between innocence and omniscience (Q2974774) (← links)
- ML and Extended Branching VASS (Q2988645) (← links)
- A Fragment of ML Decidable by Visibly Pushdown Automata (Q3012916) (← links)
- Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
- Towards Nominal Abramsky (Q4922085) (← links)
- Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness (Q5262979) (← links)
- Deconstructing general references via game semantics (Q6612784) (← links)
