Fairness and communication-based semantics for session-typed languages
Publication:2672270
DOI10.1016/J.IC.2022.104892zbMath1504.68030arXiv2104.01065OpenAlexW3208810957MaRDI QIDQ2672270
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.01065
fairnesssession typesprogram equivalencemultiset rewritingobserved communication semanticstesting preorders
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logical relations and observational equivalences for session-based concurrency
- Relating state-based and process-based concurrency through linear logic (full-version)
- Linearity and bisimulation
- An algebraic theory of fair asynchronous communicating processes
- Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
- A calculus of communicating systems
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Fully abstract models of typed \(\lambda\)-calculi
- Full abstraction in the lazy lambda calculus
- Plain CHOCS. A second generation calculus for higher order processes
- Testing equivalences for processes
- Depending on session-typed processes
- Weak and strong fairness in CCS
- Proving congruence of bisimulation in functional programming languages
- A message-passing interpretation of adjoint logic
- On polymorphic sessions and functions. A tale of two (fully abstract) encodings
- Practical Foundations for Programming Languages
- Propositions as sessions
- Linear Logical Relations for Session-Based Concurrency
- Polarized Substructural Session Types
- Observed Communication Semantics for Classical Processes
- Proof-Carrying Code in a Session-Typed Process Calculus
- Introduction to Bisimulation and Coinduction
- Synchronous and asynchronous experiments on processes
- Session Types as Intuitionistic Linear Propositions
- *-Autonomous categories and linear logic
- Proving the Correctness of Multiprocess Programs
- Polycategories
- Theories of Programming Languages
- Typed Multiset Rewriting Specifications of Security Protocols
- Classical Higher-Order Processes
- Linear type theory for asynchronous session types
- Barbed bisimulation
- Verification: Theory and Practice
- Higher-Order Processes, Functions, and Sessions: A Monadic Integration
- An introduction to (co)algebra and (co)induction
- Howe's method for higher-order languages
- Derivatives of Regular Expressions
- Session-typed concurrent contracts
- Separating Sessions Smoothly
This page was built for publication: Fairness and communication-based semantics for session-typed languages
