uwutech / KindLinks
A modern proof language
☆8Updated 4 years ago
Alternatives and similar repositories for Kind
Users that are interested in Kind are comparing it to the libraries listed below
Sorting:
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆31Updated last year
- GRIN backend for Idris2☆33Updated 2 years ago
- A core language and API for dependently typed languages☆94Updated 4 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 4 months ago
- Experimental effects library for Idris 2☆42Updated 3 years ago
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- Package manager for Idris☆37Updated 2 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Specification of the Cedille Core language☆30Updated 4 years ago
- SDL2 bindings for lean☆22Updated last year
- Setoid type theory implementation☆38Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Fast equality saturation in Haskell☆84Updated 4 months ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- Lean 4 port of Megaparsec☆29Updated last year
- Subtyping calculus of inductive constructions☆54Updated last year
- LLVM code generation in Haskell☆54Updated 7 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A toy dependent typed language.☆29Updated last week