9 citations · 26 across the 9 of their papers we have counts for
6 papers · 1 filter
Meta-MeTTa: an operational semantics for MeTTa
Lucius Gregory Meredith, Ben Goertzel, Jonathan Warrell +1
We present an operational semantics for the language MeTTa.
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…
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…
Logic as a distributive law
Mike Stay, Lucius Gregory Meredith
We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv Cat for the free calcu…
Linear Types Can Change the Blockchain
Lucius Gregory Meredith
We give an interpretation of full classical linear logic, and linear proofs in terms of operations on the blockchain.
Higher category models of the pi-calculus
Mike Stay, Lucius Gregory Meredith
We present an approach to modeling computational calculi using higher category theory. Specifically we present a fully abstract semantics for the pi-calculus. The interpretation is…