The different shades of infinite session types

DOI10.1007/978-3-030-99253-8_18arXiv2201.08275OpenAlexW4225555565MaRDI QIDQ6141781

Diogo Poças, Vasco Thudichum Vasconcelos, Simon J. Gay

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.08275

zbMATH Keywords

session typesrecursive typesautomata and formal language theoryinfinite types

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of session types
• On NFAs where all states are final, initial, or both
• Two iteration theorems for some families of languages
• Deterministic one-counter automata
• The inclusion problem for simple languages
• Undecidable equivalences for basic process algebra
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Polymorphic lambda calculus with context-free session types
• Nested session types
• Session coalgebras: a coalgebraic view on session types and communication protocols
• Characteristic formulae for session types
• Subtyping for session types in the pi calculus
• Multiparty Session Types Meet Communicating Automata
• Talking bananas: structural recursion for session types
• Context-free session types
• Context-Free Session Type Inference
• Proof-Carrying Code in a Session-Typed Process Calculus
• Introduction to Bisimulation and Coinduction
• The equivalence problem for deterministic pushdown automata is decidable
• Recursive subtyping revealed
• Deciding the Bisimilarity of Context-Free Session Types
• Equivalence of deterministic one-counter automata is NL-complete
• Using higher-order contracts to model session types
• Parameterised Multiparty Session Types
• Parameterised Multiparty Session Types