amblafont / unification
Notes (and implementation) of unification with binders
☆14Updated last month
Related projects ⓘ
Alternatives and complementary repositories for unification
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- my phd thesis☆26Updated 3 months ago
- ☆27Updated last year
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- ☆11Updated 4 years ago
- ☆21Updated 3 years ago
- A formalization of the theory behind the mugen library☆15Updated 4 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆25Updated 2 weeks ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- ☆17Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- ☆18Updated 2 years ago
- ModTT in Agda☆11Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆17Updated last month
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- ☆17Updated 2 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Higher Algebra with Opetopic Types☆14Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 5 months ago