uwutech / Kind
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
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- A simple functional programming language.☆21Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- ☆27Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Package manager for Idris☆35Updated 2 years ago
- Demo for dependent types + runtime code generation☆68Updated last month
- A bidirectional type checker☆62Updated 7 years ago
- A work-in-progress core language for Agda, in Agda☆48Updated 2 weeks ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- GRIN backend for Idris2☆34Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- LLVM code generation in Haskell☆54Updated 5 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last month
- Specification of the Cedille Core language☆29Updated 4 years ago
- Javascript DOM bindings for Idris2☆51Updated 10 months ago
- An Agda library for programming with ternary relations☆17Updated last month
- Setoid type theory implementation☆38Updated last year
- Idris port of Haskell's sop-core library☆34Updated last year
- Eventually a practical 2-level TT-based compiler☆27Updated last week
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- bollu learns implementation of dependent typing☆28Updated 2 years ago