A linear linear lambda-calculus

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS Mathematical Structures in Computer Science Pub Date : 2024-05-31 DOI:10.1017/s0960129524000197

Alejandro Díaz-Caro, Gilles Dowek

引用次数: 0

Abstract

We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part of a broader research program aiming to define a logic with a proof language that forms a quantum programming language.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

线性λ演算法

我们提出了包含加法和标量乘法的直观乘法加法线性逻辑证明语言的线性定理。这种语言的证明在代数意义上是线性的。这项工作是更广泛研究计划的一部分，该计划旨在定义一种具有证明语言的逻辑，从而形成一种量子编程语言。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Mathematical Structures in Computer Science 工程技术-计算机：理论方法

CiteScore

1.50

自引率

0.00%

发文量

审稿时长

12 months

期刊介绍： Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.

期刊最新文献

On Hofmann–Streicher universes T0-spaces and the lower topology GADTs are not (Even partial) functors A linear linear lambda-calculus Countability constraints in order-theoretic approaches to computability