9 citations · 26 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LO2017★ 2 cited
Representing operational semantics with enriched Lawvere theories
Michael Stay, L. G. Meredith
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…
cs.LO2017★ 2 cited
Name-free combinators for concurrency
Lucius Gregory Meredith, Michael Stay
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 n…