unnohideyuki / Tiger-in-Haskell
"Modern compiler implementation" in Haskell!
☆26Updated 10 years ago
Alternatives and similar repositories for Tiger-in-Haskell:
Users that are interested in Tiger-in-Haskell are comparing it to the libraries listed below
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 weeks ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- A collection of Notes on GHC☆69Updated 5 years ago
- Simplified Observational Type Theory☆81Updated last year
- JHC Haskell compiler split into reusable components☆57Updated 6 years ago
- Haskell library for type-inference with Hindley-Milner type-system.☆33Updated 7 months ago
- Chapelure is a diagnostic library for Haskell☆44Updated last year
- An effect system based on type classes, written in Haskell.☆44Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Examples for Haskell bindings to LLVM☆71Updated 3 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆59Updated last month
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆89Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- ☆92Updated 9 months ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 3 months ago
- Fast and concise extensible effects☆107Updated last year
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 3 weeks ago
- ☆47Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- Effects libraries in Haskell☆71Updated last year
- ☆80Updated 2 weeks ago
- Generic functions for single-sorted first-order structural unification☆41Updated 3 weeks ago
- Examples of a simple parser written in both Parsec and Happy/Alex☆51Updated 9 years ago