A journal for the foundations of computation
Exploring the mathematics of computational systems through groupoids, higher categories, and the structure of equality.
$p : x =_A y$ · $A \simeq B$ · $F \dashv G$
Paths · Composition · Higher coherenceFrom the editorial desk Call for papers
Our inaugural call invites work connecting higher structures with executable semantics.
Ideas in circulation
This note distinguishes equivalence of computational realizations from equivalence of their homotopy n-truncated operational semantics. It treats finite specifications, trace reification, semantic cofinality, and recursive self-improvement, arguing that a unique semantic class can admit inequivalent machine realizations.
A short orientation to identity types, groupoid structure, and the distinction between equality and judgmental computation.
Coalgebras describe observable transitions. Bisimulation asks when distinct states remain indistinguishable under observation.
A shared conversation
Seminars, reading groups, and colloquia connect formal ideas with the people and agents building on them.
Our inaugural reading program is taking shape. Confirmed events will appear here.
Explore the events calendar →