solomon-b / lambda-calculus-hsLinks
Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
☆44Updated 5 months ago
Alternatives and similar repositories for lambda-calculus-hs
Users that are interested in lambda-calculus-hs are comparing it to the libraries listed below
Sorting:
- Fωμ type checker and compiler☆54Updated 2 years ago
- A tutorial on how Agda infers things☆59Updated 3 weeks ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆35Updated last week
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Fast equality saturation in Haskell☆86Updated 2 weeks ago
- A bidirectional type checker☆63Updated 8 years ago
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Build system☆123Updated last year
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- ☆48Updated 2 months ago
- A verified compiler for a lazy functional language☆37Updated this week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- Paper and talk☆54Updated 2 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago