System F^_ with context-free session types

DOI10.1007/978-3-031-30044-8_15MaRDI QIDQ6535246zbMATH OpenFDO

Authors Diogo Poças, Diana Costa, Andreia Mordido, Vasco T. Vasconcelos

Publication date 24 November 2023

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

System Fhigher-order kindscontext-free session types

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Polymorphic lambda calculus with context-free session types
• Deciding the bisimilarity of context-free session types
• Context-free session types for applied pi-calculus
• Context-free session type inference
• Nested session types

Cites work

• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 4035115 (Why is no real title available?)
• scientific article; zbMATH DE number 1183236 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 1760051 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 2086608 (Why is no real title available?)
• scientific article; zbMATH DE number 2086674 (Why is no real title available?)
• scientific article; zbMATH DE number 2087543 (Why is no real title available?)
• scientific article; zbMATH DE number 1398002 (Why is no real title available?)
• scientific article; zbMATH DE number 7471698 (Why is no real title available?)
• scientific article; zbMATH DE number 3400430 (Why is no real title available?)
• An elementary bisimulation decision procedure for arbitrary context-free processes
• BPA bisimilarity is EXPTIME-hard
• Behavioral polymorphism and parametricity in session-based communication
• Bisimilarity on basic process algebra is in 2-ExpTime (an explicit proof)
• Bisimulation equivalence is decidable for all context-free processes
• Bounded polymorphism in session types
• Characteristic formulae for session types
• Combinatory logic. With two sections by William Craig.
• Comparing object encodings.
• Context-free session type inference
• Context-free session types
• Contractive signatures with recursive types, type parameters, and abstract types
• Decidability of DPDA equivalence
• Decidability of bisimulation equivalence for process generating context-free languages
• Deciding the bisimilarity of context-free session types
• Functions as processes
• Fundamentals of session types
• Higher-order processes, functions, and sessions: a monadic integration
• Linear logic
• Linear type theory for asynchronous session types
• Nested session types
• Numbering matters
• On polymorphic sessions and functions. A tale of two (fully abstract) encodings
• Polarized Substructural Session Types
• Polymorphic lambda calculus with context-free session types
• Polytypic values possess polykinded types
• Practical coinduction
• Proof-carrying code in a session-typed process calculus
• Recursive subtyping revealed (functional pearl)
• Session coalgebras: a coalgebraic view on session types and communication protocols
• Session types revisited
• Subtyping for session types in the pi calculus
• System F-omega with equirecursive types for datatype-generic programming
• Talking bananas: structural recursion for session types
• The different shades of infinite session types
• The equivalence problem for deterministic pushdown automata is decidable
• Types and programing languages

Cited in

(1)

• The different shades of infinite session types

This page was built for publication: System \(F^\mu_\omega\) with context-free session types

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