Step in Tine: Forking Processes in Functional Choreographies
The paper titled 'Step in Tine: Forking Processes in Functional Choreographies' introduces a new approach to concurrent programming. It presents the choreographic fork calculus λ{pitchfork}, which allows for process forking while ensuring deadlock freedom. This advancement simplifies the process of spawning new processes in concurrent systems, supporting practical applications such as load balancers.
- ▪Traditional concurrent programming requires separate programs for each participant in a system.
- ▪Choreographic programming enables a single centralized program to be compiled into individual programs.
- ▪The λ{pitchfork} language allows dynamic process spawning while guaranteeing deadlock freedom.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Programming Languages arXiv:2605.23031 (cs) [Submitted on 21 May 2026] Title:Step in Tine: Forking Processes in Functional Choreographies Authors:Ashley Samuelson, Andrew K. Hirsch, Ethan Cecchetti View a PDF of the paper titled Step in Tine: Forking Processes in Functional Choreographies, by Ashley Samuelson and 2 other authors View PDF Abstract:Traditional concurrent-programming techniques require programmers to painstakingly write programs for each participant in a concurrent system. Choreographic programming, in contrast, allows a programmer to write one centralized program and compile it to individual programs. This approach simplifies critical properties like deadlock freedom, but it complicates forking new processes, a core primitive in concurrent programming.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv.org.
Discussion
0 commentsMore from arXiv.org
