jozefg / higher-order-unificationView external linksLinks
A small implementation of higher-order unification
☆192Aug 6, 2017Updated 8 years ago
Alternatives and similar repositories for higher-order-unification
Users that are interested in higher-order-unification are comparing it to the libraries listed below
Sorting:
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Demo for high-performance type theory elaboration☆580Feb 2, 2026Updated last week
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101May 9, 2017Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆389Oct 23, 2023Updated 2 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features☆121Sep 12, 2018Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆77Jul 30, 2018Updated 7 years ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Dependent type checker using normalisation by evaluation☆273Sep 5, 2024Updated last year
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Minimal implementations for dependent type checking and elaboration☆762Jan 30, 2026Updated 2 weeks ago
- A Super Kawaii Dependently Typed Programming Language☆176Jul 12, 2018Updated 7 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Inspection Testing for Haskell☆189Jan 17, 2026Updated 3 weeks ago
- higher order dependently typed logic programing☆173Aug 7, 2018Updated 7 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆215Mar 25, 2022Updated 3 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago