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☆20Updated 9 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 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 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated this week
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- A formalization of the theory behind the mugen library☆19Updated last year
- my phd thesis☆26Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 2 weeks ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A simple λProlog interpreter☆20Updated 4 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- ☆17Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago