Processes and games

MaRDI QIDQ2851048zbMATH OpenFDO

Authors Kohei Honda

Publication date 2 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105825289

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Genericity and the \(\pi\)-calculus
• A truly concurrent game model of the asynchronous -calculus
• scientific article; zbMATH DE number 1722647
• A Theory for Game Theories
• Theory by process

Cites work

• A calculus of communicating systems
• A calculus of mobile processes. II
• A uniform type structure for secure information flow
• Abstract Böhm trees
• Bigraphs and transitions
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Concrete domains
• Full abstraction for PCF
• Fully abstract models of typed \(\lambda\)-calculi
• Functions as processes
• Game semantics for untyped -calculus
• Game theoretic analysis of call-by-value computation
• Games and full abstraction for a functional metalanguage with recursive types
• scientific article; zbMATH DE number 1722647 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 954809 (Why is no real title available?)
• scientific article; zbMATH DE number 1231510 (Why is no real title available?)
• scientific article; zbMATH DE number 1956508 (Why is no real title available?)
• scientific article; zbMATH DE number 1499102 (Why is no real title available?)
• scientific article; zbMATH DE number 2087446 (Why is no real title available?)
• scientific article; zbMATH DE number 1398002 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• Innocent game models of untyped -calculus
• Linear logic
• On full abstraction for PCF: I, II and III
• Process Algebra
• Research directions in rewriting logic
• Sequential algorithms on concrete data structures
• Unified theories of programming

Cited in

(5)

• Learning to win process-control games watching game-masters
• Twenty years of rewriting logic
• Strategies as concurrent processes
• Full abstraction in a subtyped pi-calculus with linear types
• First-order store and visibility in name-passing calculi

This page was built for publication: Processes and games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851048)