mietek / researchLinks
Work in progress
☆38Updated 3 months ago
Alternatives and similar repositories for research
Users that are interested in research are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Where my everyday research happens☆55Updated 3 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Constructive Galois connections☆35Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Category theory and algebra☆27Updated 9 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- ☆84Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- The Prettiest Printer☆35Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago