Where my everyday research happens
☆56Feb 17, 2026Updated 2 weeks ago
Alternatives and similar repositories for potpourri
Users that are interested in potpourri are comparing it to the libraries listed below
Sorting:
- ☆12Jul 8, 2019Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104May 25, 2022Updated 3 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago
- A TACtic library for Agda☆51Sep 14, 2024Updated last year
- ☆17Oct 16, 2018Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- ☆18May 10, 2022Updated 3 years ago
- Programming library for Agda☆135Aug 22, 2024Updated last year
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago
- Total Parser Combinators in Agda☆132Aug 5, 2025Updated 7 months ago
- ☆11Jul 20, 2016Updated 9 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Playing with incremental parsing and later compiler passes☆12Dec 12, 2018Updated 7 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago