Polymorphic higher-order context-free session types

DOI10.1016/J.TCS.2024.114582MaRDI QIDQ6499549

Diogo Poças, Diana Costa, Andreia Mordido, Vasco Thudichum Vasconcelos

Publication date: 8 May 2024

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

zbMATH Keywords

polymorphismbisimulationtype equivalencecontext-free session typeshigher-order session types

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type inference with recursive types: Syntax and semantics
• Fundamental properties of infinite trees
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Bisimulation equivalence is decidable for all context-free processes
• BPA bisimilarity is EXPTIME-hard
• Polymorphic lambda calculus with context-free session types
• Nested session types
• Session types revisited
• Subtyping for session types in the pi calculus
• System f-omega with equirecursive types for datatype-generic programming
• Context-free session types
• Context-Free Session Type Inference
• Decidability of bisimulation equivalence for process generating context-free languages
• Bounded polymorphism in session types
• An elementary bisimulation decision procedure for arbitrary context-free processes
• Deciding the Bisimilarity of Context-Free Session Types
• Propositions as sessions
• Numbering matters
• Behavioral Polymorphism and Parametricity in Session-Based Communication
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

This page was built for publication: Polymorphic higher-order context-free session types