Polymorphic lambda calculus with context-free session types
From MaRDI portal
Publication:2105433
DOI10.1016/J.IC.2022.104948OpenAlexW4289856072WikidataQ114014307 ScholiaQ114014307MaRDI QIDQ2105433FDOQ2105433
Authors: Andreia Mordido, Peter J. Thiemann, Bernardo F. Almeida, Vasco T. 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
Recommendations
- Publication:3478384
- Polymorphic lambda calculus and subtyping.
- A Polymorphic Type System for the Lambda-Calculus with Constructors
- scientific article
- On functors expressible in the polymorphic typed lambda calculus
- scientific article; zbMATH DE number 3941503
- scientific article; zbMATH DE number 1342279
- Polymorphic types in functional logic programming
- Type Inference for a Polynomial Lambda Calculus
- Polymorphic lambda calculus: The Church-Rosser property
Cites Work
- Practical affine types
- A calculus of mobile processes. I
- Practical foundations for programming languages
- Subtyping for session types in the pi calculus
- Types and programing languages
- Multiparty Asynchronous Session Types
- Propositions as sessions
- Using Higher-Order Contracts to Model Session Types (Extended Abstract)
- Session types as intuitionistic linear propositions
- Linear type theory for asynchronous session types
- Bisimulation equivalence is decidable for all context-free processes
- Title not available (Why is that?)
- Linear logical relations and observational equivalences for session-based concurrency
- Propositions as sessions
- Behavioral Polymorphism and Parametricity in Session-Based Communication
- Lilac: a functional programming language based on linear logic
- Session types revisited
- Modular session types for objects
- Title not available (Why is that?)
- Linear logic propositions as session types
- Fundamentals of session types
- Title not available (Why is that?)
- Type checking a multithreaded functional language with session types
- CONCUR 2004 - Concurrency Theory
- Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
- Bounded polymorphism in session types
- An extensible approach to session polymorphism
- Using higher-order contracts to model session types
- Typing copyless message passing
- Polarized Substructural Session Types
- Context-free session types
- Typing copyless message passing
- Deciding the Bisimilarity of Context-Free Session Types
- Nested session types
- Characteristic formulae for session types
- Context-Free Session Type Inference
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: Polymorphic lambda calculus with context-free session types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105433)