System \(F^\mu_\omega\) with context-free session types
From MaRDI portal
Publication:6535246
DOI10.1007/978-3-031-30044-8_15zbMATH Open1541.68258MaRDI QIDQ6535246
Vasco Thudichum Vasconcelos, Andreia Mordido, Diogo Poças, Diana Costa
Publication date: 24 November 2023
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
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
- Linear logic
- Polytypic values possess polykinded types
- Fundamentals of session types
- Combinatory logic. With two sections by William Craig.
- Comparing object encodings.
- 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 coalgebras: a coalgebraic view on session types and communication protocols
- Characteristic formulae for session types
- On polymorphic sessions and functions. A tale of two (fully abstract) encodings
- Session types revisited
- Subtyping for session types in the pi calculus
- System f-omega with equirecursive types for datatype-generic programming
- Recursive subtyping revealed
- Polarized Substructural Session Types
- 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
- 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
- Functions as processes
- The equivalence problem for deterministic pushdown automata is decidable
- Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
- Deciding the Bisimilarity of Context-Free Session Types
- Numbering matters
- Linear type theory for asynchronous session types
- Behavioral Polymorphism and Parametricity in Session-Based Communication
- Higher-Order Processes, Functions, and Sessions: A Monadic Integration
- Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types
- Practical coinduction
- Decidability of DPDA equivalence
- The different shades of infinite session types
This page was built for publication: System \(F^\mu_\omega\) with context-free session types
