DeepAI AI Chat
Log In Sign Up

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams

by   Bert Lindenhovius, et al.

Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL term calculus and LNL logic closely related to intuitionistic linear logic. Every such model induces a canonical enrichment that we show soundly models a LNL lambda calculus for string diagrams, introduced by Rios and Selinger (with primary application in quantum computing). Our abstract treatment of this language leads to simpler concrete models compared to those presented so far. We also extend the language with general recursion and prove soundness. Finally, we present an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion.


page 1

page 2

page 3

page 4


A Braided Lambda Calculus

We present an untyped linear lambda calculus with braids, the correspond...

Formalization of Metatheory of the Quipper Quantum Programming Language in a Linear Logic

We develop a linear logical framework within the Hybrid system and use i...

The ksmt calculus is a δ-complete decision procedure for non-linear constraints

ksmt is a CDCL-style calculus for solving non-linear constraints over re...

Linear lambda-calculus is linear

We prove a linearity theorem for an extension of linear logic with addit...

On embedding Lambek calculus into commutative categorial grammars

Abstract categorial grammars (ACG), as well as some other, closely relat...

The Logical Essentials of Bayesian Reasoning

This chapter offers an accessible introduction to the channel-based appr...

String Diagrams for Regular Logic (Extended Abstract)

Regular logic can be regarded as the internal language of regular catego...