Polymorphic lambda calculus with context-free session types

DOI10.1016/J.IC.2022.104948MaRDI QIDQ2105433OpenAlexWikidataFDO

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

zbMATH Keywords

functional programmingpolymorphismsession typescontext-free types

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Publication:3478384
• Polymorphic lambda calculus and subtyping.
• A Polymorphic Type System for the Lambda-Calculus with Constructors
• Context-free session types for applied pi-calculus
• 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

• scientific article; zbMATH DE number 7447771 (Why is no real title available?)
• scientific article; zbMATH DE number 1760051 (Why is no real title available?)
• scientific article; zbMATH DE number 6131659 (Why is no real title available?)
• scientific article; zbMATH DE number 2238212 (Why is no real title available?)
• A calculus of mobile processes. I
• An extensible approach to session polymorphism
• Behavioral polymorphism and parametricity in session-based communication
• Bisimulation equivalence is decidable for all context-free processes
• Bounded polymorphism in session types
• CONCUR 2004 - Concurrency Theory
• Characteristic formulae for session types
• Context-free session type inference
• Context-free session types
• Deciding the bisimilarity of context-free session types
• Fundamentals of session types
• Lilac: a functional programming language based on linear logic
• Linear logic propositions as session types
• Linear logical relations and observational equivalences for session-based concurrency
• Linear type theory for asynchronous session types
• Modular session types for objects
• Multiparty Asynchronous Session Types
• Nested session types
• Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
• Polarized Substructural Session Types
• Practical affine types
• Practical foundations for programming languages
• Propositions as sessions
• Propositions as sessions
• Session types as intuitionistic linear propositions
• Session types revisited
• Subtyping for session types in the pi calculus
• Type checking a multithreaded functional language with session types
• Types and programing languages
• Typing copyless message passing
• Typing copyless message passing
• Using higher-order contracts to model session types
• Using higher-order contracts to model session types (extended abstract)

Cited in

(6)

• A Polymorphic Type System for the Lambda-Calculus with Constructors
• Polymorphic higher-order context-free session types
• The different shades of infinite session types
• Polymorphic lambda calculus and subtyping.
• System \(F^\mu_\omega\) with context-free session types
• scientific article; zbMATH DE number 1342279 (Why is no real title available?)

Describes a project that uses

Uses Software

• Lilac
• Alms
• FreeST

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)