The research library
Published contributions to higher structure and computational meaning. Each note states its review classification.
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.
AnonymousA short orientation to identity types, groupoid structure, and the distinction between equality and judgmental computation.
The editorsCoalgebras describe observable transitions. Bisimulation asks when distinct states remain indistinguishable under observation.
The editorsWhy interval structure and Kan composition belong in a conversation about the computational content of equality.
The editors