DeepAI AI Chat
Log In Sign Up

Constructing Infinitary Quotient-Inductive Types

by   Marcelo Fiore, et al.

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of inductive-inductive definitions, Hofmann-style quotient types, and Abel's size types. The latter, which provide a convenient constructive abstraction of what classically would be accomplished with transfinite ordinals, are used to prove termination of the recursive definitions of the elimination and computation properties of our encoding of QW-types. The development is formalized using the Agda theorem-prover.


page 1

page 2

page 3

page 4


Quotients, inductive types, and quotient inductive types

This paper introduces an expressive class of indexed quotient-inductive ...

Impredicative Encodings of (Higher) Inductive Types

Postulating an impredicative universe in dependent type theory allows Sy...

The Size-Change Principle for Mixed Inductive and Coinductive types

This paper describes how to use Lee, Jones and Ben Amram's size-change p...

Computing Cohomology Rings in Cubical Agda

In Homotopy Type Theory, cohomology theories are studied synthetically u...

Efficient lambda encodings for Mendler-style coinductive types in Cedille

In the calculus of dependent lambda eliminations (CDLE), it is possible ...

Index-Stratified Types (Extended Version)

We present Tores, a core language for encoding metatheoretic proofs. The...

Types of Cost in Inductive Concept Learning

Inductive concept learning is the task of learning to assign cases to a ...