amblafont / unificationLinks
Notes (and implementation) of unification with binders
☆14Updated last month
Alternatives and similar repositories for unification
Users that are interested in unification are comparing it to the libraries listed below
Sorting:
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆21Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experiments with Realizability in Univalent Type Theory☆18Updated 8 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- my phd thesis☆26Updated 11 months ago
- ☆11Updated 5 years ago
- ☆15Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆19Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- ☆18Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago