gelisam / klister
an implementation of stuck macros
☆139Updated last week
Alternatives and similar repositories for klister:
Users that are interested in klister are comparing it to the libraries listed below
- Benchmarks for capture-avoiding substitution☆113Updated last month
- ☆136Updated 2 years ago
- A less devious proof assistant☆223Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- Library of the ##dependent distributed research support group☆112Updated 8 months ago
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆214Updated last year
- A continuation-based backtracking logic programming monad☆86Updated 4 months ago
- Dependent type checker using normalisation by evaluation☆258Updated 6 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆96Updated 3 months ago
- SPLV20 course notes☆108Updated 2 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- A compiler for functional programs on serialized data☆158Updated this week
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 4 months ago
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- 😎TT☆225Updated last year