Fundamentals of session types
DOI10.1016/J.IC.2012.05.002zbMATH Open1254.68068OpenAlexW2080718905MaRDI QIDQ714736FDOQ714736
Authors: Vasco T. Vasconcelos 
Publication date: 11 October 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.05.002
Recommendations
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Functions as processes
- Title not available (Why is that?)
- Multiparty asynchronous session types
- Subtyping for session types in the pi calculus
- Types and programing languages
- Conversation types
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Session types as intuitionistic linear propositions
- Linear type theory for asynchronous session types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Full abstraction in a subtyped pi-calculus with linear types
- A linear account of session types in the pi calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linearity, session types and the pi calculus
- Linear logic propositions as session types
- Fundamentals of session types
Cited In (48)
- Title not available (Why is that?)
- The different shades of infinite session types
- Title not available (Why is that?)
- Session-based concurrency in Maude: executable semantics and type checking
- Type reconstruction for the linear \(\pi \)-calculus with composite and equi-recursive types
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- Executable Semantics and Type Checking for Session-Based Concurrency in Maude
- Polymorphic lambda calculus with context-free session types
- A calculus for modeling floating authorizations
- Session-based concurrency, declaratively
- Session coalgebras: a coalgebraic view on session types and communication protocols
- Fundamentals of session types
- Comparing type systems for deadlock freedom
- On session types and polynomial time
- On sessions and infinite data
- Affine sessions
- A message-passing interpretation of adjoint logic
- Type checking a multithreaded functional language with session types
- A linear account of session types in the pi calculus
- A semantic deconstruction of session types
- Linearity, session types and the pi calculus
- Title not available (Why is that?)
- Session types without sophistry. System description
- Comparing deadlock-free session typed processes
- Title not available (Why is that?)
- Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
- Deadlock freedom for asynchronous and cyclic process networks
- Mixed sessions
- Mixed sessions
- Session types revisited
- Linear type theory for asynchronous session types
- On projecting processes into session types
- Comparing session type systems derived from linear logic
- Non-linear communication via graded modal session types
- Honesty by typing
- Linearly refined session types
- Session Types with Arithmetic Refinements
- Towards races in linear logic
- Multiparty session types as coherence proofs
- A universal session type for untyped asynchronous communication
- A calculus of global interaction based on session types
- Type-checking liveness for collaborative processes with bounded and unbounded recursion
- MAG\(\pi\): types for failure-prone communication
- System \(F^\mu_\omega\) with context-free session types
- Resource sharing via capability-based multiparty session types
- Separating Sessions Smoothly
- Type reconstruction for the linear \(\pi\)-calculus with composite regular types
- Subtyping for session types in the pi calculus
Uses Software
This page was built for publication: Fundamentals of session types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714736)
