Polymorphic lambda calculus with context-free session types

DOI10.1016/j.ic.2022.104948OpenAlexW4289856072WikidataQ114014307 ScholiaQ114014307MaRDI QIDQ2105433

Peter Thiemann, Andreia Mordido, Bernardo F. Almeida, Vasco Thudichum Vasconcelos

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

polymorphismfunctional programmingsession typescontext-free types

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The different shades of infinite session types

Uses Software

• Lilac
• Alms
• FreeST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logical relations and observational equivalences for session-based concurrency
• Fundamentals of session types
• Type checking a multithreaded functional language with session types
• A calculus of mobile processes. I
• Bisimulation equivalence is decidable for all context-free processes
• Nested session types
• Characteristic formulae for session types
• Session types revisited
• Subtyping for session types in the pi calculus
• Practical Foundations for Programming Languages
• Propositions as sessions
• Polarized Substructural Session Types
• Context-free session types
• Context-Free Session Type Inference
• Multiparty Asynchronous Session Types
• Using Higher-Order Contracts to Model Session Types (Extended Abstract)
• Modular session types for objects
• Bounded polymorphism in session types
• Session Types as Intuitionistic Linear Propositions
• Lilac: a functional programming language based on linear logic
• Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
• Deciding the Bisimilarity of Context-Free Session Types
• Propositions as sessions
• Linear type theory for asynchronous session types
• CONCUR 2004 - Concurrency Theory
• Behavioral Polymorphism and Parametricity in Session-Based Communication
• Practical affine types
• Using higher-order contracts to model session types
• Linear logic propositions as session types
• An extensible approach to session polymorphism
• Typing Copyless Message Passing
• Typing Copyless Message Passing

This page was built for publication: Polymorphic lambda calculus with context-free session types