Categorical Message Passing Language (CaMPL) for programmers
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909030226591744 |
|---|---|
| author | Hashimoto, Daniel Kiyoshi Berg, Alexanna Little Srinivasan, Priyaa Varshinee |
| author_facet | Hashimoto, Daniel Kiyoshi Berg, Alexanna Little Srinivasan, Priyaa Varshinee |
| contents | Categorical Message Passing Language (CaMPL) is a functional-style concurrent programming language whose semantics is in category theory, more specifically, linear actegories. Its core programming feature is message passing along typed communication channels between concurrent processes. CaMPL also supports controlled non-determinism via 'races' which allow processes to adapt dynamically while they are running, higher-order processes which pass other processes as messages, and custom channel datatypes called protocols and coprotocols which allow one to define infinite channel types or implement session types.
The type system of CaMPL arises from a Curry-Howard-Lambek-like correspondence for concurrent programming, established by Cockett and Pastro in their paper titled "The logic of message passing". This type system ensures that a formal CaMPL program, i.e., one which does not allow general recursion, will never become deadlocked or livelocked. In this article, we explore the type system of CaMPL, custom channel types, and controlled non-determinism using code examples after briefly introducing its mathematical underpinnings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_09491 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Categorical Message Passing Language (CaMPL) for programmers Hashimoto, Daniel Kiyoshi Berg, Alexanna Little Srinivasan, Priyaa Varshinee Programming Languages Distributed, Parallel, and Cluster Computing Logic in Computer Science D.3.3; D.1.3 Categorical Message Passing Language (CaMPL) is a functional-style concurrent programming language whose semantics is in category theory, more specifically, linear actegories. Its core programming feature is message passing along typed communication channels between concurrent processes. CaMPL also supports controlled non-determinism via 'races' which allow processes to adapt dynamically while they are running, higher-order processes which pass other processes as messages, and custom channel datatypes called protocols and coprotocols which allow one to define infinite channel types or implement session types. The type system of CaMPL arises from a Curry-Howard-Lambek-like correspondence for concurrent programming, established by Cockett and Pastro in their paper titled "The logic of message passing". This type system ensures that a formal CaMPL program, i.e., one which does not allow general recursion, will never become deadlocked or livelocked. In this article, we explore the type system of CaMPL, custom channel types, and controlled non-determinism using code examples after briefly introducing its mathematical underpinnings. |
| title | Categorical Message Passing Language (CaMPL) for programmers |
| topic | Programming Languages Distributed, Parallel, and Cluster Computing Logic in Computer Science D.3.3; D.1.3 |
| url | https://arxiv.org/abs/2605.09491 |