Game-theoretic analysis of call-by-value computation

DOI10.1016/S0304-3975(99)00039-0zbMath0930.68061MaRDI QIDQ1960532

Nobuko Yoshida, Kohei Honda

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

game semanticscall-by-name computationcall-by-value computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Eager functions as processes, Polarized games, Continuous probability distributions in concurrent games, Algorithmic games for full ground references, Strong normalisation in the \(\pi\)-calculus, An observationally complete program logic for imperative higher-order functions, Full abstraction for Reduced ML, Block structure vs scope extrusion: between innocence and omniscience, Program equivalence in a simple language with state, ML and Extended Branching VASS, Leafy automata for higher-order concurrency, A Fragment of ML Decidable by Visibly Pushdown Automata, Algorithmic probabilistic game semantics. Playing games with automata, A game semantics of names and pointers, Towards Nominal Abramsky, Game semantics and linear CPS interpretation, A relational account of call-by-value sequentiality, Linearity and bisimulation, Full Abstraction in a Subtyped pi-Calculus with Linear Types, Genericity and the \(\pi\)-calculus, Definability and Full Abstraction, Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness

Uses Software

• ML

Cites Work

• Linear logic
• Notions of computation and monads
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Partial morphisms in categories of effective objects
• A fully abstract semantics for causality in the \(\pi\)-calculus
• A calculus of communicating systems
• Sequential algorithms on concrete data structures
• A game semantics for linear logic
• A calculus of mobile processes. II
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• Concrete domains
• Synchronization trees
• Games and full abstraction for FPC.
• On full abstraction for PCF: I, II and III
• Kripke logical relations and PCF
• 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
• Game theoretic analysis of call-by-value 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
• Unnamed Item
• Unnamed Item
• Unnamed Item