The paper introduces Stratified Type Theory (StraTT), a type theory that takes a different approach to preventing logical inconsistency compared to the typical universe hierarchy. Instead of stratifying universes, StraTT stratifies the typing judgements themselves.
The key features of StraTT are:
The authors prove logical consistency for the subsystem subStraTT, which includes only stratified dependent functions and displacement. They also prove type safety for the full StraTT, including floating nondependent functions, though consistency of the full system remains an open problem.
The paper also includes several examples demonstrating the expressivity of StraTT, such as defining decidable types, Leibniz equality, and dependent pairs. Finally, the authors describe a prototype implementation that extends StraTT with datatypes and type inference.
他の言語に翻訳
原文コンテンツから
arxiv.org
深掘り質問