Session Types with Arithmetic Refinements
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2079022 (Why is no real title available?)
- scientific article; zbMATH DE number 1398002 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- A Sound Algorithm for Asynchronous Session Subtyping
- A theory of design-by-contract for distributed multiparty interactions
- Behavioral polymorphism and parametricity in session-based communication
- Context-free session types
- Deciding the bisimilarity of context-free session types
- Depending on session-typed processes
- Fundamentals of session types
- Indexed types
- Linear logic propositions as session types
- Linear type theory for asynchronous session types
- Linearly refined session types
- Multiparty asynchronous session types
- On the undecidability of asynchronous session subtyping
- Polarized Substructural Session Types
- Proof-carrying code in a session-typed process calculus
- Propositions as sessions
- Session types as intuitionistic linear propositions
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Session-typed concurrent contracts
- Subtyping for session types in the pi calculus
- Talking bananas: structural recursion for session types
- Types for Proofs and Programs
- Undecidability of asynchronous session subtyping
- Work analysis with resource-aware session types
Cited in
(6)
This page was built for publication: Session Types with Arithmetic Refinements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089277)