Game theoretic analysis of call-by-value computation

DOI10.1007/3-540-63165-8_180MaRDI QIDQ4571955zbMATH OpenOpenAlexFDO

Authors Kohei Honda, Nobuko Yoshida

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

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 in a basic logic for interaction
• Game Semantics for Higher-Order Concurrency

Cites work

• A calculus of communicating systems
• A game semantics for linear logic
• A relational account of call-by-value sequentiality
• Categories of partial maps
• Fully abstract models of typed \(\lambda\)-calculi
• Functions as processes
• Games and full abstraction for FPC.
• Games and full completeness for multiplicative linear logic
• scientific article; zbMATH DE number 431761 (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 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?)
• LCF considered as a programming language
• Linear logic
• Notions of computation and monads
• Partial morphisms in categories of effective objects
• Premonoidal categories and notions of computation
• Sequential algorithms on concrete data structures
• Synchronization trees

Cited in

(17)

• Premonoidal categories as categories with algebraic structure
• Games and full abstraction for FPC.
• On full abstraction for PCF: I, II and III
• Game-theoretic analysis of call-by-value computation
• Bayesian strategies: probabilistic programs as generalised graphical models
• Games for complexity of second-order call-by-name programs
• Call-by-value in a basic logic for interaction
• Processes and games
• Block structure vs. scope extrusion: between innocence and omniscience
• Full Abstraction for Reduced ML
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• A Game Semantics of Idealized CSP
• Dialogue categories and Frobenius monoids
• Models for the computational \(\lambda\)-calculus
• Functions with local state: regularity and undecidability
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• An axiomatic account of a fully abstract game semantics for general references

Describes a project that uses

Uses Software

• 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 Q4571955)