# A Categorical Construction for the Computational Definition of Vector Spaces

@article{DazCaro2020ACC,
title={A Categorical Construction for the Computational Definition of Vector Spaces},
author={Alejandro D{\'i}az-Caro and Octavio Malherbe},
journal={Applied Categorical Structures},
year={2020},
pages={1-38}
}
• Published 2020
• Mathematics, Computer Science
• Applied Categorical Structures
Lambda- $${\mathcal {S}}$$ 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- $${\mathcal {S}}$$ 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- $${\mathcal {S}}$$ S can also be seen as a language for the… Expand
1 Citations
Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model
• Computer Science, Mathematics
• ArXiv
• 2020
This paper introduces a valid subset of typing rules, defining an expressive enough quantum calculus, and proposes a categorical semantics for it, which consists of an adjunction between the category of semi-vector spaces of value distributions and the categories of sets of value distribution. Expand

#### References

SHOWING 1-10 OF 38 REFERENCES
A concrete categorical semantics of Lambda-S
• Computer Science, Mathematics
• LSFA
• 2018
A concrete categorical semantics of Lambda-S is given, showing that S is interpreted as the composition of two functors in an adjunction relation between the categories of sets and the category of vector spaces over C. Expand
A fully abstract model for quantum controlled lambda calculus
• Mathematics
• 2018
We give a fully-abstract, concrete, categorical model for Lambda-S. Lambda-S is an extension to first-order lambda calculus unifying two approaches of non-cloning in quantum lambda-calculi: to forbidExpand
Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2014
Four canonical languages based on each of the possible choices of the algebraic lambda-calculus are proposed, making them general enough to be valid for any sub-language satisfying the corresponding properties. Expand
Lineal: A linear-algebraic Lambda-calculus
• Computer Science, Physics
• Log. Methods Comput. Sci.
• 2017
A minimal language combining higher-order computation and linear algebra is introduced, which extends the Lambda-calculus with the possibility to make arbitrary linear combinations of terms alpha.t + beta.u.t and the confluence of the entire calculus is proved. Expand
Two linearities for quantum computing in the lambda calculus
• Computer Science, Mathematics
• Biosyst.
• 2019
A quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors, and provides an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis. Expand
The algebraic lambda calculus
• L. Vaux
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
• 2009
An extension of the pure lambda calculus is introduced by endowing the set of terms with the structure of a vector space, or, more generally, of a module, over a fixed set of scalars, and it is proved it is confluent. Expand
Typing Quantum Superpositions and Measurement
• Computer Science, Physics
• TPNC
• 2017
A quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors, and provides an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis. Expand
Confluence in Probabilistic Rewriting
• Computer Science
• LSFA
• 2017
A property of distribution confluence is defined which is shown to imply the desired uniqueness (even for infinite sequences of reduction) and further properties and carried over several criteria from the classical case to simplify proving confluence in concrete languages. Expand
Realizability in the Unitary Sphere
• Computer Science, Mathematics
• 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2019
This paper derives from the semantics a set of typing rules for a simply-typed linear algebraic lambda-calculus, and shows how it extends both to classical and quantumlambda-calculi. Expand
Families parametrized by coalgebras
• Mathematics
• 1987
Since Hopf [H] first introduced the coalgebra structure on the homology ring of a grouplike manifold, making it into what is now called a Hopf algebra, coalgebras have been appearing more and moreExpand