uwutech / Kind
A modern proof language
☆8Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for Kind
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Experimental effects library for Idris 2☆41Updated 2 years ago
- Specification of the Formality proof and programming language☆40Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Package manager for Idris☆35Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A bidirectional type checker☆57Updated 7 years ago
- GRIN backend for Idris2☆33Updated 2 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- ☆12Updated 4 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- ☆24Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- high-performance cubical evaluation☆68Updated 4 months ago
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated 11 months ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated last month
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- A core language and API for dependently typed languages☆89Updated 11 months ago
- a functional programming language with algebraic effects and handlers☆81Updated 2 years ago
- Idris port of Haskell's sop-core library☆33Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Fast equality saturation in Haskell☆77Updated 6 months ago
- Agda category theory library for denotational design☆48Updated 5 months ago
- A Language with Dependent Data and Codata Types☆58Updated this week
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Experimental JS bindings for idris2-rhone☆21Updated last year
- Work in progress on semi-simplicial types☆23Updated last year