logicshan / pj-lester-book
☆16Updated 10 years ago
Related projects: ⓘ
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 7 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 8 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Updated 3 months ago
- Simple demonstration stack based virtual machine written in Haskell☆42Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- SPJ's tutorial on implementing functional languages☆28Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- The Prettiest Printer☆35Updated 7 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- GRIN backend for Idris☆51Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- ☆41Updated 7 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆53Updated 3 years ago
- minimalist polymorphic scheme-(co)monads, written to avoid use of any advanced language features except hygienic macros☆19Updated 11 years ago
- Interpreter for GHC Haskell☆22Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- JHC Haskell compiler split into reusable components☆58Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated 2 weeks ago
- ☆39Updated 4 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- being the materials for Summer 2013's course☆110Updated last year
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Efficient Haskell effect handlers based on evidence translation.☆80Updated 3 years ago
- Example row-polymorphism implementations☆59Updated 11 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆68Updated 2 years ago