Subtyping context-free session types

DOI10.1016/J.TCS.2025.115705MaRDI QIDQ6835800zbMATH OpenFDO

Authors Gil Márcio A. Silva, Andreia Mordido, Vasco T. Vasconcelos

Publication date 30 March 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115705

zbMATH Keywords

context-free session typesnon-regular recursionsimple grammarssimulation relationssubtyping

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A calculus of communicating systems
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• An elementary bisimulation decision procedure for arbitrary context-free processes
• Bounded polymorphism in session types
• Context-free session types
• Decidability of bisimulation equivalence for process generating context-free languages
• Deciding the bisimilarity of context-free session types
• scientific article; zbMATH DE number 954809 (Why is no real title available?)
• scientific article; zbMATH DE number 1183236 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 1361117 (Why is no real title available?)
• scientific article; zbMATH DE number 2209335 (Why is no real title available?)
• LALBLC A Program Testing the Equivalence of dpda’s
• Learning I/O automata
• Linear type theory for asynchronous session types
• Modelling session types using contracts
• Multiparty asynchronous session types
• Nested session types
• Non-strongly stable orders also define interesting simulation relations
• On the preciseness of subtyping in session types
• Polarized subtyping
• Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
• Polymorphic higher-order context-free session types
• Polymorphic lambda calculus with context-free session types
• Session-typed concurrent contracts
• Structured Communication-Centred Programming for Web Services
• Subtyping context-free session types
• Subtyping for session types in the pi calculus
• Subtyping Supports Safe Session Substitution
• Subtyping, declaratively. An exercise in mixed induction and coinduction
• System \(F^\mu_\omega\) with context-free session types
• The inclusion problem for simple languages
• Types and programing languages
• Undecidability of asynchronous session subtyping
• Undecidable equivalences for basic process algebra

This page was built for publication: Subtyping context-free session types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835800)