LNL-FPC: the linear/non-linear fixpoint calculus

MaRDI QIDQ4989404zbMATH OpenFDO

Authors Bert Lindenhovius, Vladimir Zamdzhiev, Michael Mislove

Publication date 25 May 2021

Full work available at URL https://arxiv.org/abs/1906.09503, https://lmcs.episciences.org/7390

zbMATH Keywords

categorical semanticsrecursive typesintuitionistic linear logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Enriching a linear/non-linear lambda calculus: a programming language for string diagrams
• scientific article; zbMATH DE number 2079022
• Enriching an Effect Calculus with Linear Types
• Categorical models of linear logic with fixed points of formulas
• The best of both worlds: linear functional programming without compromise

Cites work

• scientific article; zbMATH DE number 3458870 (Why is no real title available?)
• scientific article; zbMATH DE number 3572382 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 692330 (Why is no real title available?)
• scientific article; zbMATH DE number 2079022 (Why is no real title available?)
• scientific article; zbMATH DE number 2120508 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• A general adequacy result for a linear functional language
• Algebraic specification of data types: A synthetic approach
• Applying quantitative semantics to higher-order quantum computing
• Classical control, quantum circuits and linear logic in enriched category theory
• Computational interpretations of linear logic
• Enriching a linear/non-linear lambda calculus: a programming language for string diagrams
• Linear logic
• Linear logic propositions as session types
• On Finitary Functors and Their Presentations
• Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
• Practical affine types
• Presheaf models of quantum computation: an outline
• Quantum programming with inductive datatypes: causality and affine type theory
• Relational properties of domains
• Synthetic domain theory and models of linear Abadi {\&} Plotkin logic
• The Category-Theoretic Solution of Recursive Domain Equations
• The best of both worlds: linear functional programming without compromise

Cited in

(9)

• LNL-FPC: The Linear/Non-linear Fixpoint Calculus
• Semantics for a lambda calculus for string diagrams
• Quantum programming with inductive datatypes: causality and affine type theory
• Quantum Suplattices
• Quantum CPOs
• Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction
• scientific article; zbMATH DE number 7453968 (Why is no real title available?)
• scientific article; zbMATH DE number 7454912 (Why is no real title available?)
• Gradual type theory

Describes a project that uses

Uses Software

• Alms

This page was built for publication: LNL-FPC: the linear/non-linear fixpoint calculus

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