Similar Items: A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
- Refining Inductive Types
- Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
- Consistency and Completeness of Rewriting in the Calculus of Constructions
- Constructive Canonicity of Inductive Inequalities
- Correct and Efficient Antichain Algorithms for Refinement Checking
- Constructing Higher Inductive Types as Groupoid Quotients