Similar Items: Exhaustible sets in higher-type computation
- Constructing Higher Inductive Types as Groupoid Quotients
- Using higher-order contracts to model session types
- Signatures and Induction Principles for Higher Inductive-Inductive Types
- A unifying framework for continuity and complexity in higher types
- The Complexity of Infinite Computations In Models of Set Theory
- Representations of measurable sets in computable measure theory