A Toolkit for Structured Lifts
By: Chris Kapulkin, Yufeng Li
We develop a general framework for working with structured lifting problems, establishing closure and uniqueness properties of their solutions. In a subsequent paper, we apply these results to axiomatize computation rules of cubical type theory.
Similar Papers
Combinatory Completeness in Structured Multicategories
Category Theory
Makes computers understand math rules better.
A Judgmental Construction of Directed Type Theory
Logic in Computer Science
Makes computer code safer and more organized.
Mechanizing Synthetic Tait Computability in Istari
Programming Languages
Makes computer proofs correct and easier.