cronburg / antlr-haskell
A language parsing quasiquoter for Haskell based heavily on ANTLR4.
☆51Updated 4 years ago
Alternatives and similar repositories for antlr-haskell:
Users that are interested in antlr-haskell are comparing it to the libraries listed below
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- The Software Foundations book, in GHC☆82Updated 2 months ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆77Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Examples for Haskell bindings to LLVM☆71Updated 3 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- ICFP tutorial☆39Updated 3 years ago
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- A collection of Notes on GHC☆69Updated 5 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Named parameters (keyword arguments) for Haskell☆94Updated last week
- Dependently-typed finite maps (partial dependent products)☆65Updated last month
- Lightweight package providing commonly useful parser combinators☆54Updated last month