gelisam / typechecker-combinators
☆16Updated 7 months ago
Related projects ⓘ
Alternatives and complementary repositories for typechecker-combinators
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 2 weeks ago
- my phd thesis☆26Updated 3 months ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 2 months ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- A formalization of the theory behind the mugen library☆15Updated 5 months ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months 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
- Linear map categories in Agda☆5Updated last year
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆25Updated 2 weeks ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Organize mathematical thoughts☆19Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Anders: Cubical Type Checker☆18Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- A Teeny Type Theory☆26Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- ModTT in Agda☆11Updated 3 years ago
- A type theory for tiny objects☆10Updated 11 months ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- A compiler that translates a form of lambda calculus to C☆12Updated 7 months ago