Extensional and Non-extensional Functions as Processes

May 06, 2024 ยท The Ethereal ยท ๐Ÿ› Logic in Computer Science

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ken Sakayori, Davide Sangiorgi arXiv ID 2405.03536 Category cs.LO: Logic in CS Cross-listed cs.PL Citations 2 Venue Logic in Computer Science Last Checked 5 months ago
Abstract
Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $ฮป$-calculus, the process representations yield (at best) non-extensional $ฮป$-theories (i.e., $ฮฒ$ rule holds, whereas $ฮท$ does not). In the paper, we study how to obtain extensional representations, and how to move between extensional and non-extensional representations. Using Internal $ฯ€$, $\mathrm{I}ฯ€$ (a subset of the $ฯ€$-calculus in which all outputs are bound), we develop a refinement of Milner's original encoding of functions as processes that is parametric on certain abstract components called wires. These are, intuitively, processes whose task is to connect two end-point channels. We show that when a few algebraic properties of wires hold, the encoding yields a $ฮป$-theory. Exploiting the symmetries and dualities of $\mathrm{I}ฯ€$, we isolate three main classes of wires. The first two have a sequential behaviour and are dual of each other; the third has a parallel behaviour and is the dual of itself. We show the adoption of the parallel wires yields an extensional $ฮป$-theory; in fact, it yields an equality that coincides with that of Bรถhm trees with infinite $ฮท$. In contrast, the other two classes of wires yield non-extensional $ฮป$-theories whose equalities are those of the Lรฉvy-Longo and Bรถhm trees.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS