solomon-b / lambda-calculus-hs
Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
☆44Updated last year
Related projects ⓘ
Alternatives and complementary repositories for lambda-calculus-hs
- Fωμ type checker and compiler☆51Updated last year
- Fast equality saturation in Haskell☆77Updated 6 months ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆29Updated 11 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- ☆38Updated 2 years ago
- A bidirectional type checker☆57Updated 7 years ago
- A verified compiler for a lazy functional language☆32Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Anders: Cubical Type Checker☆18Updated last year
- Demo for dependent types + runtime code generation☆48Updated this week
- ICFP tutorial☆40Updated 3 years ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- A simple functional programming language.☆21Updated 3 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- APIs for more recursive definitions☆19Updated 3 weeks ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 4 years ago
- 🪆 A Staged Type Theory☆34Updated last year