solomon-b / lambda-calculus-hs
Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
☆44Updated last month
Alternatives and similar repositories for lambda-calculus-hs:
Users that are interested in lambda-calculus-hs are comparing it to the libraries listed below
- Fωμ type checker and compiler☆52Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Fast equality saturation in Haskell☆84Updated last month
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆28Updated 2 weeks ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Type Your Matrices For Great Good☆30Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- A dependently typed programming language with direct style effects and linearity☆19Updated 8 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- ☆34Updated 11 months ago
- ☆40Updated 3 years ago
- A bidirectional type checker☆62Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Demo for dependent types + runtime code generation☆67Updated last month
- A work-in-progress core language for Agda, in Agda☆45Updated this week
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated last month
- A verified compiler for a lazy functional language☆34Updated last month
- ☆47Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month