All Stories

  1. Bounded Sort Polymorphism with Elimination Constraints
  2. All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants
  3. Correct and Complete Type Checking and Certified Erasure for Coq, in Coq
  4. Verified Extraction from Coq to OCaml
  5. Types Are Internal ∞-Groupoids
  6. The Marriage of Univalence and Parametricity
  7. Coq Coq correct! verification of type checking and erasure for Coq, in Coq
  8. Equations reloaded: high-level dependently-typed functional programming and proving in Coq
  9. Definitional proof-irrelevance without K
  10. Equivalences for free: univalent parametricity for effective transport
  11. A unification algorithm for Coq featuring universe polymorphism and overloading
  12. A unification algorithm for Coq featuring universe polymorphism and overloading
  13. Partiality and recursion in interactive theorem provers – an overview