ghulette / haskell-parser-examples
Examples of a simple parser written in both Parsec and Happy/Alex
☆49Updated 9 years ago
Related projects: ⓘ
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- compile your own functional language☆36Updated 5 years ago
- Simple demonstration stack based virtual machine written in Haskell☆42Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 7 years ago
- JHC Haskell compiler split into reusable components☆58Updated 5 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- NES programming in Haskell? No way!☆38Updated 8 years ago
- Interpreter for GHC Haskell☆22Updated 4 years ago
- A collection of Notes on GHC☆69Updated 5 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆77Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- A useful type for working with integers modulo some constant.☆30Updated last year
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆93Updated 7 months ago
- SPJ's tutorial on implementing functional languages☆28Updated 5 years ago
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- ☆41Updated 7 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 6 years ago
- Pure memoization combinators for Haskell☆37Updated 8 years ago
- Generic random generators☆81Updated last year
- Haskell 98 comonads☆77Updated 11 months ago
- ☆82Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A very simple example of how to use Alex and Happy to build a language processor in Haskell.☆16Updated 9 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 6 months ago
- A syntax for unions of constraints in Haskell☆70Updated 7 years ago