Polymorphic higher-order context-free session types

DOI10.1016/J.TCS.2024.114582MaRDI QIDQ6499549FDOQ6499549

Authors: Diana Costa, Andreia Mordido, Diogo Poças, Vasco T. 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

• Fundamental properties of infinite trees
• Title not available (Why is that?)
• Subtyping for session types in the pi calculus
• Types and programing languages
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Bisimulation equivalence is decidable for all context-free processes
• Propositions as sessions
• Behavioral polymorphism and parametricity in session-based communication
• Decidability of bisimulation equivalence for process generating context-free languages
• Title not available (Why is that?)
• Type inference with recursive types: Syntax and semantics
• An elementary bisimulation decision procedure for arbitrary context-free processes
• Session types revisited
• Title not available (Why is that?)
• Numbering matters
• Bounded polymorphism in session types
• Polymorphic lambda calculus with context-free session types
• BPA bisimilarity is EXPTIME-hard
• Context-free session types
• Deciding the bisimilarity of context-free session types
• Nested session types
• Context-free session type inference
• System F-omega with equirecursive types for datatype-generic programming

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

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