The following pages link to Advanced Functional Programming (Q5394302):
Displaying 13 items.
- Recursive coalgebras from comonads (Q2495640) (← links)
- Containers: Constructing strictly positive types (Q2566024) (← links)
- Congruence Closure in Intensional Type Theory (Q2817913) (← links)
- Web Interfaces for Proof Assistants (Q2867935) (← links)
- Program Calculation in Coq (Q3067474) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- A UNIVERSE OF STRICTLY POSITIVE FAMILIES (Q3620616) (← links)
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (Q3637183) (← links)
- A New Elimination Rule for the Calculus of Inductive Constructions (Q3638245) (← links)
- Heterogeneous binary random-access lists (Q5110935) (← links)
- Dependent Types at Work (Q5191088) (← links)
- Eliminating dependent pattern matching without K (Q5371975) (← links)
- A correct-by-construction conversion from lambda calculus to combinatory logic (Q6065511) (← links)
