Processes and games
From MaRDI portal
Recommendations
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 theoretic analysis of call-by-value computation
- 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 1259144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342254 (Why is no real title available?)
- scientific article; zbMATH DE number 1342276 (Why is no real title available?)
- scientific article; zbMATH DE number 1088217 (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
- Sequential algorithms on concrete data structures
Cited in
(5)
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)