Programming and reasoning about actors that share state
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1705164 (Why is no real title available?)
- scientific article; zbMATH DE number 3731310 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 2182600 (Why is no real title available?)
- scientific article; zbMATH DE number 2090726 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- A Complete Guide to the Future
- A cost-effective estimation of uncaught exceptions in Standard ML programs
- A generic type system for the -calculus
- A syntactic approach to type soundness
- An axiomatic basis for computer programming
- ConGolog, a concurrent programming language based on the situation calculus
- Conversation Types
- Deadlock-freedom-by-design, multiparty asynchronous global programming
- Formal methods for open object-based distributed systems. 10th IFIP WG 6.1 international conference, FMOODS 2008, Oslo, Norway, June 4--6, 2008. Proceedings
- Fortifying macros
- Fortifying macros
- Linear temporal logic symbolic model checking
- Mobile ambients
- Multiparty asynchronous session types
- Programming Languages and Systems
- The Conversation Calculus: A Model of Service-Oriented Computation
- The Esterel synchronous programming language: Design, semantics, implementation
- The Linda alternative to message-passing systems
- The network as a language construct
- Type systems as macros
- Types as models: model checking message-passing programs
- Typestate: A programming language concept for enhancing software reliability
This page was built for publication: Programming and reasoning about actors that share state
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976540)