Pages that link to "Item:Q2407107"
From MaRDI portal
The following pages link to Undecidability of asynchronous session subtyping (Q2407107):
Displaying 18 items.
- On the boundary between decidability and undecidability of asynchronous session subtyping (Q1704600) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Composition and decomposition of multiparty sessions (Q1996856) (← links)
- Fair refinement for asynchronous session types (Q2233400) (← links)
- Probabilistic software product lines (Q2329442) (← links)
- Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
- On the Undecidability of Asynchronous Session Subtyping (Q2988385) (← links)
- Progress-preserving Refinements of CTA (Q5009458) (← links)
- Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types (Q5041094) (← links)
- Session Types with Arithmetic Refinements (Q5089277) (← links)
- (Q5856424) (← links)
- A Sound Algorithm for Asynchronous Session Subtyping (Q5875400) (← links)
- Deconfined Global Types for Asynchronous Sessions (Q5883749) (← links)
- A formal theory of choreographic programming (Q6161233) (← links)
- Partially Typed Multiparty Sessions (Q6197376) (← links)
- Global types and event structure semantics for asynchronous multiparty sessions (Q6614546) (← links)
- Fair asynchronous session subtyping (Q6635515) (← links)
- Partially typed multiparty sessions with internal delegation (Q6643472) (← links)
