Reproduce “Any colour you like, as long as it's UIP: Semi-simplicial types from weakenings and thinnings” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Thorsten Altenkirch
The paper constructs K-free syntax for describing semi-simplicial types uniformly at every level. It encodes families and projections so boundary selections compose, and stores equations to avoid requiring K in the syntax. But interpreting it in the universe needs UIP: any two proofs of the same equality must be equal. This limits the naive interpretation, not every possible semantics.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.