Idea
A QW type combines W types with a system of equivalence relations.
Definitions
System of Equations over a Container
Definition
Let be a container. A system of containers over is specified by:
- A type
- A function
- For each , two elements
These represent the following notions.
- indexes the equations.
- indexes variables for each equation.
- represent AST’s in variables for the the left and right side of the equation.
Here is the free -algebra1 on . Specifically, it is the least type that consists of:
Link to original
Plump Order
Definition
Let be a W type for the container . We define the relations and via an inductive-inductive definition:
Link to original
WISC
Definition
A weakly initial set of covers over is just a weakly initial set in the category of covers .
That is:
Link to original
Remarks
Why WISC is needed
Suppose WISC doesn’t hold. Pick weakly initial. Construct fibration . with fibres containing all well-founded trees labeled by . If all ordinals have cofinality then the trees have unbounded height.
Examples
A (finite) multiset can be defined as:
data Bag (A : Type) : Type where
[] : Bag A
_::_ : A -> Bag A -> Bag A
x :: y :: xs == y :: x :: xs
References
Defined in fiore2022-quotient-inductive.