The following pages link to Indexed containers (Q5371943):
Displaying 18 items.
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Deep induction: induction rules for (truly) nested types (Q2200833) (← links)
- From Proposition to Program (Q2798255) (← links)
- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) (Q2888481) (← links)
- Data Types with Symmetries and Polynomial Functors over Groupoids (Q3178294) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- Directed Containers as Categories (Q5013830) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- (Q5094144) (← links)
- Variations on inductive-recursive definitions (Q5111280) (← links)
- (Q5155674) (← links)
- (Q5216301) (← links)
- Indexed containers (Q5371943) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- The essence of ornaments (Q5372005) (← links)
- 2-Dimensional Directed Type Theory (Q5739362) (← links)
- (Q5875411) (← links)
- For Finitary Induction-Induction, Induction is Enough (Q6079233) (← links)
