Open compliance in multiparty sessions with partial typing
From MaRDI portal
Cites work
- A theoretical perspective of coinductive logic programming
- A type system for lock-free processes
- An incremental unique representation for regular trees
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coinductive Logic Programming
- Compliance in behavioural contracts: a brief survey
- Composition and decomposition of multiparty sessions
- Computer Aided Verification
- Connecting open systems of communicating finite state machines
- Conversation types
- Conversation Types
- Deconfined Global Types for Asynchronous Sessions
- Dynamic multirole session types
- Full abstraction in a subtyped pi-calculus with linear types
- Fundamental properties of infinite trees
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- Globally Governed Session Semantics
- Iterative algebras at work
- Multiparty asynchronous session types
- Multiparty Asynchronous Session Types
- On Communicating Finite-State Machines
- On the undecidability of asynchronous session subtyping
- Partial typing for asynchronous multiparty sessions
- Partially Typed Multiparty Sessions
- Practical coinduction
- Reversible client/server interactions
- Subtyping for session types in the pi calculus
- The Conversation Calculus: A Model of Service-Oriented Computation
- Types and programing languages
- Undecidability of asynchronous session subtyping
This page was built for publication: Open compliance in multiparty sessions with partial typing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009389)