You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Five approaches to building a programming language with every known level of type safety (10 levels, from basic types to homotopy types). An exploration mapping the territory of type safety via five concurrent routes (extend, dyadic, aspect, aggregate, clean-slate) sharing a common test suite and documenting all failures in a stumble journal.
Constructive Agda prototype for standpoint-indexed epistemic modalities, separating knowledge (factive) from belief and warrant. Provides a tropical-graded bridge from standpoint access to echo-type residues, and a compositional proof-transport calculus with a no-smuggling guarantee across trust boundaries.
An executable finite-domain Julia companion to the Agda echo-types library, for running echo/residue and Landauer/Bennett constructions on small models and finding counterexamples. It is a model and test aid, not a proof checker.
Constructive Agda development of Echo Types: proof-relevant fibers as typed witnesses for structured information loss under non-injective maps. Provides a mechanised loss taxonomy, separation proofs distinguishing Echo from Shannon entropy and resource grades, and audience surfaces for provenance, security, and sensitivity analysis.
Pre-registration and research notebook for a graded multiparty-session type theory combining echo loss-grades and epistemic warrants on partial causal orders. Central artefact: K-CUT, the open conjecture that grading and transport commute with endpoint projection across a consistent frontier. Agda is the intended prover; no checked module yet.