gallais / potpourriLinks
Where my everyday research happens
☆55Updated last month
Alternatives and similar repositories for potpourri
Users that are interested in potpourri are comparing it to the libraries listed below
Sorting:
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- ☆45Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆53Updated 4 months ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- A formalization of category theory in cubical Agda☆59Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Compiler backend for generating Scheme code☆28Updated 3 weeks ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago