DeepAI AI Chat
Log In Sign Up

A categorical construction for the computational definition of vector spaces

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 has a constructor S such that a type A is considered as the base of a vector space while S(A) is its span. Lambda-S can also be seen as a language for the computational manipulation of vector spaces: The vector spaces axioms are given as a rewrite system, describing the computational steps to be performed. In this paper we give an abstract categorical semantics of Lambda-S* (a fragment of Lambda-S), showing that S can be interpreted as the composition of two functors in an adjunction relation between a Cartesian category and an additive symmetric monoidal category. The right adjoint is a forgetful functor U, which is hidden in the language, and plays a central role in the computational reasoning.


A concrete categorical semantics of Lambda-S

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

Classical linear logic, cobordisms and categorical semantics of categorial grammars

We propose a categorial grammar based on classical multiplicative linear...

A Graphical Calculus for Lagrangian Relations

Symplectic vector spaces are the phase space of linear mechanical system...

Pregeometric Spaces from Wolfram Model Rewriting Systems as Homotopy Types

How do spaces emerge from pregeometric discrete building blocks governed...

Pregroup Grammars, their Syntax and Semantics

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

Semantic Spaces

Any natural language can be considered as a tool for producing large dat...

A Frobenius Algebraic Analysis for Parasitic Gaps

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