Ken Sakayori ; Davide Sangiorgi - Extensional and Non-extensional Functions as Processes

lmcs:13557 - Logical Methods in Computer Science, September 5, 2025, Volume 21, Issue 3 - https://doi.org/10.46298/lmcs-21(3:25)2025
Extensional and Non-extensional Functions as ProcessesArticle

Authors: Ken Sakayori ORCID; Davide Sangiorgi ORCID

    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.


    Volume: Volume 21, Issue 3
    Published on: September 5, 2025
    Accepted on: June 16, 2025
    Submitted on: May 7, 2024
    Keywords: Logic in Computer Science, Programming Languages

    Consultation statistics

    This page has been seen 608 times.
    This article's PDF has been downloaded 136 times.