wrengr / unification-fd
Generic functions for single-sorted first-order structural unification
☆41Updated this week
Related projects ⓘ
Alternatives and complementary repositories for unification-fd
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Where my everyday research happens☆53Updated last week
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆28Updated 3 years ago
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- NbE course @ Chalmers☆28Updated 2 months ago
- Ghosts of Departed Proofs☆60Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- ☆23Updated last year
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- rewrite rules for type-level equalities☆62Updated 7 months ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Fine-grained lattice primitives for Haskell☆35Updated 3 months ago
- ☆28Updated 6 years ago
- Dependently-typed finite maps (partial dependent products)☆63Updated 5 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆33Updated 5 months ago
- Implementing grep in Agda☆32Updated 3 years ago
- The Prettiest Printer☆35Updated 9 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago