Kind inference for the \textsc{FreeST} programming language

DOI10.1016/J.JLAMP.2025.101083MaRDI QIDQ6879441zbMATH OpenFDO

Authors Bernardo F. Almeida, Andreia Mordido, Vasco T. Vasconcelos

Publication date 30 December 2025

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2025.101083

zbMATH Keywords

functional programmingpolymorphismcontext-free session typeskind inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites work

• 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 simple library implementation of binary sessions
• CONCUR 2004 - Concurrency Theory
• Context-free session type inference
• Context-free session types
• Linear logic
• Linear type theory for asynchronous session types
• Modular session types for objects
• Polymorphic lambda calculus with context-free session types
• Practical affine types
• Practical foundations for programming languages
• The best of both worlds: linear functional programming without compromise
• Types and programing languages

Cited in

(1)

• Preface of the PLACES 2023 special issue

This page was built for publication: Kind inference for the \textsc{FreeST} programming language

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