owainlewis / lambda-calculusLinks
Lambda calculus parser in Haskell
☆14Updated 8 years ago
Alternatives and similar repositories for lambda-calculus
Users that are interested in lambda-calculus are comparing it to the libraries listed below
Sorting:
- Yoneda lemma in every known language☆17Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 9 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Haskell library for type-inference with Hindley-Milner type-system.☆34Updated last year
- Paper and talk☆54Updated 2 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- ☆48Updated last month
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆74Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago