DeepAI AI Chat
Log In Sign Up

A concrete categorical semantics of Lambda-S

by   Alejandro Díaz-Caro, et al.

Lambda-S is an extension to first-order lambda calculus unifying two approaches of non-cloning in quantum lambda-calculi. One is to forbid duplication of variables, while the other is to consider all lambda-terms as algebraic linear functions. The type system of Lambda-S have a constructor S such that a type A is considered as the base of a vector space while S(A) is its span. A first semantics of this calculus have been given when first presented, with such an interpretation: superposed types are interpreted as vectors spaces while non-superposed types as their basis. In this paper we give a concrete categorical semantics of Lambda-S, showing that S is interpreted as the composition of two functors in an adjunction relation between the category of sets and the category of vector spaces over C. The right adjoint is a forgetful functor U, which is hidden in the language, and plays a central role in the computational reasoning.


page 1

page 2

page 3

page 4


A categorical construction for the computational definition of vector spaces

Lambda-S is an extension to first-order lambda calculus unifying two app...

Categorical Vector Space Semantics for Lambek Calculus with a Relevant Modality

We develop a categorical compositional distributional semantics for Lamb...

Distributive Laws, Spans and the ZX-Calculus

We modularly build increasingly larger fragments of the ZX-calculus by m...

A Frobenius Algebraic Analysis for Parasitic Gaps

The interpretation of parasitic gaps is an ostensible case of non-linear...

Pregroup Grammars, their Syntax and Semantics

Pregroup grammars were developed in 1999 and stayed Lambek's preferred a...

Semantics for first-order affine inductive data types via slice categories

Affine type systems are substructural type systems where copying of info...