跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.23031 · v2

Step in Tine: Forking Processes in Functional Choreographies

首次提交 2026-05-22 04:56
版本更新 2026-11-17 07:12
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

Choreographic programming allows a concurrent programmer to write one centralized program and compile it to individual programs for each system participant. This approach simplifies critical properties like deadlock freedom, but it complicates forking new processes, a core concurrent primitive. This work addresses that gap with the choreographic fork calculus λ⋔λ{\pitchfork}, the first functional choreographic language with process spawning. λ⋔λ{\pitchfork} provides a deadlock-freedom guarantee while allowing programs to dynamically determine when to spawn new processes, what they will do, and who will communicate with them. All results are formalized in Lean.

作者备注:45 pages, 10 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-17 07:12 · 最新观测版本

Step in Tine: Forking Processes in Functional Choreographies

Choreographic programming allows a concurrent programmer to write one centralized program and compile it to individual programs for each system participant. This approach simplifies critical properties like deadlock freedom, but it complicates forking new processes, a core concurrent primitive. This work addresses that gap with the choreographic fork calculus λ⋔λ{\pitchfork}, the first functional choreographic language with process spawning. λ⋔λ{\pitchfork} provides a deadlock-freedom guarantee while allowing programs to dynamically determine when to spawn new processes, what they will do, and who will communicate with them. All results are formalized in Lean.

查看此版本解读 →查看此版本原文 ↗