Representing operational semantics with enriched Lawvere theories

TL;DR

This paper introduces a novel approach using enriched Lawvere theories and combinators to represent the operational semantics of a reflective higher-order pi calculus, eliminating nominal complexities.

Contribution

It presents an alternative set of combinators built from SKI plus reflection that faithfully embeds the calculus and simplifies the handling of bound names.

Findings

Enriched Lawvere theories can capture the operational semantics of the calculus.

The combinators eliminate nominal phenomena, simplifying the calculus.

Faithful embedding of the reflective higher-order pi calculus achieved.

Abstract

Many term calculi, like lambda calculus or pi calculus, involve binders for names, and the mathematics of bound variable names is subtle. Schoenfinkel introduced the SKI combinator calculus in 1924 to clarify the role of quantified variables in intuitionistic logic by eliminating them. Yoshida demonstrated how to eliminate the bound names coming from the input prefix in the asynchronous pi calculus, but her combinators still depend on the new operator to bind names. Recently, Meredith and Stay showed how to modify Yoshida's combinators by replacing new and replication with reflective operators to provide the first combinator calculus with no bound names into which the asynchronous pi calculus has a faithful embedding. Here we provide an alternative set of combinators built from SKI plus reflection that also eliminates all nominal phenomena, yet provides a faithful embedding of a reflective higher-order pi calculus. We show that with the nominal features effectively eliminated as syntactic sugar, multisorted Lawvere theories enriched over graphs suffice to capture the operational semantics of the calculus.