amblafont / unification
Notes (and implementation) of unification with binders
☆14Updated 3 weeks ago
Alternatives and similar repositories for unification:
Users that are interested in unification are comparing it to the libraries listed below
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆12Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- my phd thesis☆26Updated 8 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- ☆15Updated last year
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆11Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- 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
- ModTT in Agda☆11Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated 9 months ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last week
- Experiments with Realizability in Univalent Type Theory☆18Updated 5 months ago
- ☆29Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- ☆21Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆17Updated 2 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- Organize mathematical thoughts☆20Updated last year
- ☆18Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 10 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆23Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago