Abstract
We introduce an extension of the pure lambda calculus 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. Moreover, terms are subject to identities similar to the usual pointwise definition of linear combinations of functions with values in a vector space. We then study a natural extension of beta reduction in this setting: we prove it is confluent, then discuss consistency and conservativity over the ordinary lambda calculus. We also provide normalisation results for a simple type system.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Relational Machine Calculus;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. A linear linear lambda-calculus;Mathematical Structures in Computer Science;2024-05-31
3. A Linear Proof Language for Second-Order Intuitionistic Linear Logic;Lecture Notes in Computer Science;2024
4. A concrete model for a typed linear algebraic lambda calculus;Mathematical Structures in Computer Science;2023-11-21
5. Extensional proofs in a propositional logic modulo isomorphisms;Theoretical Computer Science;2023-10