[2605.23031] Step in Tine: Forking Processes in Functional Choreographies

-->

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<br>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. This work addresses that gap with the choreographic fork calculus $\lambda{\pitchfork}$, the first functional choreographic language with process forking. $\lambda{\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. In doing so, it supports practical applications like load balancers and parallel divide-and-conquer.

Comments:<br>81 pages, 10 figures

Subjects:

Programming Languages (cs.PL)

Cite as:<br>arXiv:2605.23031 [cs.PL]

(or<br>arXiv:2605.23031v1 [cs.PL] for this version)

https://doi.org/10.48550/arXiv.2605.23031

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: Ashley Samuelson [view email]<br>[v1]<br>Thu, 21 May 2026 20:56:27 UTC (119 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Step in Tine: Forking Processes in Functional Choreographies, by Ashley Samuelson and 2 other authors<br>View PDF<br>TeX Source

view license

Current browse context:

cs.PL

next >

new<br>recent<br>| 2026-05

Change to browse by:

cs

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)