gelisam / typechecker-combinatorsLinks
☆17Updated last year
Alternatives and similar repositories for typechecker-combinators
Users that are interested in typechecker-combinators are comparing it to the libraries listed below
Sorting:
- A formalization of System Fω in Agda☆17Updated 4 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Organize mathematical thoughts☆20Updated last year
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Anders: Cubical Type Checker☆24Updated 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
- ☆13Updated 2 months ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆10Updated 9 months ago
- ☆17Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 3 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year