Game-theoretic analysis of call-by-value computation
From MaRDI portal
Recommendations
- Game theoretic analysis of call-by-value computation
- scientific article; zbMATH DE number 1223609
- Game semantics for call-by-value polymorphism
- Call-by-value solvability, revisited
- scientific article; zbMATH DE number 2044494
- Static Analysis
- Complexity of model-checking call-by-value programs
- scientific article; zbMATH DE number 1226101
- Game-Theoretic Analysis of an Incentivized Verifiable Computation System
- Games for complexity of second-order call-by-name programs
Cites work
- scientific article; zbMATH DE number 431761 (Why is no real title available?)
- scientific article; zbMATH DE number 431762 (Why is no real title available?)
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3898875 (Why is no real title available?)
- scientific article; zbMATH DE number 3909708 (Why is no real title available?)
- scientific article; zbMATH DE number 18655 (Why is no real title available?)
- scientific article; zbMATH DE number 19484 (Why is no real title available?)
- scientific article; zbMATH DE number 1223609 (Why is no real title available?)
- scientific article; zbMATH DE number 1231510 (Why is no real title available?)
- scientific article; zbMATH DE number 1259144 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 1028820 (Why is no real title available?)
- scientific article; zbMATH DE number 1479606 (Why is no real title available?)
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- scientific article; zbMATH DE number 786494 (Why is no real title available?)
- A calculus of communicating systems
- A calculus of mobile processes. II
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A game semantics for linear logic
- A relational account of call-by-value sequentiality
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Concrete domains
- Functions as processes
- Game theoretic analysis of call-by-value computation
- Games and full abstraction for FPC.
- Games and full completeness for multiplicative linear logic
- Kripke logical relations and PCF
- LCF considered as a programming language
- Linear logic
- Notions of computation and monads
- On full abstraction for PCF: I, II and III
- Partial morphisms in categories of effective objects
- Premonoidal categories and notions of computation
- Sequential algorithms on concrete data structures
- Synchronization trees
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(24)- Continuous probability distributions in concurrent games
- Game theoretic analysis of call-by-value computation
- A relational account of call-by-value sequentiality
- Genericity and the \(\pi\)-calculus
- ML and extended branching VASS
- Eager functions as processes
- Towards nominal Abramsky
- Polarized games
- An observationally complete program logic for imperative higher-order functions
- A game semantics of names and pointers
- Deconstructing general references via game semantics
- Algorithmic games for full ground references
- Program equivalence in a simple language with state
- Full abstraction in a subtyped pi-calculus with linear types
- Definability and full abstraction
- Leafy automata for higher-order concurrency
- Block structure vs scope extrusion: between innocence and omniscience
- Strong normalisation in the \(\pi\)-calculus
- Type-based security for mobile computing integrity, secrecy and liveness
- Algorithmic probabilistic game semantics. Playing games with automata
- Linearity and bisimulation
- A fragment of ML decidable by visibly pushdown automata
- Game semantics and linear CPS interpretation
- Full abstraction for Reduced ML
This page was built for publication: Game-theoretic analysis of call-by-value computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960532)
