9 citations · 26 across the 9 of their papers we have counts for
9 papers
OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond
Ben Goertzel, Vitaly Bogdanov, Michael Duncan +10
An introduction to the OpenCog Hyperon framework for Artificiai General Intelligence is presented. Hyperon is a new, mostly from-the-ground-up rewrite/redesign of the OpenCog AGI f…
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…
Policy as Types
Lucius G Meredith, Mike Stay, Sophia Drossopoulou
Drossopoulou and Noble argue persuasively for the need for a means to express policy in object-capability-based systems. We investigate a practical means to realize their aim via t…
Knots as processes: a new kind of invariant
L. G. Meredith, David F. Snyder
We exhibit an encoding of knots into processes in the π-calculus such that knots are ambient isotopic if and only their encodings are weakly bisimilar.