跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 10:37 — 2026-11-22 10:37(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
新论文 · v1arXiv:2611.24984

Mode Inference for Substructural Adjoint Types

Sophia Roshal, Frank Pfenning

原文摘要

Adjoint types [Jang et al. 2024] provide a method of mixing substructural modes (for example, linear, affine, strict, or unrestricted) in a type system while preserving the proof-theoretic and computational properties of each mode. Uses of such a system include performing compiler optimizations or providing safety guarantees on parts of a program whose modes support them, while not restricting the programmer's ability to write other code as they usually do. However, Jang et al.'s algorithmic type system is monomorphic in the modes, requiring the programmer to anticipate a potentially large number of combinations of modes, and possibly copy code to conform to each of them. In this paper we define a mode inference algorithm for programs with adjoint types that produces principal modes, summarizing all possible substructural modes of a function in a simple constraint language. This removes the burden from the programmer to a priori analyze the substructural properties of their code, and, furthermore, allows a single function definition to subsume all its instances at different modes. We show that our system is sound and complete with respect to a mild restriction of Jang et al.'s monomorphic version.

cs.PL