stoeffel / haskell-simple-dsl-examplesLinks
Simple examples on how to implement a DSL in Haskell.
☆19Updated 5 years ago
Alternatives and similar repositories for haskell-simple-dsl-examples
Users that are interested in haskell-simple-dsl-examples are comparing it to the libraries listed below
Sorting:
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 10 months ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Chapelure is a diagnostic library for Haskell☆45Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Where my everyday research happens☆53Updated 2 weeks ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- Implementation of an efficient thread-safe global Symbol Table, with garbage collection☆19Updated 3 months ago
- A tutorial on how Agda infers things☆43Updated 4 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated last month
- ☆40Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- coverage driven random testing framework☆23Updated 7 months ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Extend GHC's type checker with user-defined rules, without writing a type checker plugin.☆18Updated 3 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- higher-kinded data☆30Updated 2 years ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- An effect system based on type classes, written in Haskell.☆45Updated 3 years ago
- GHC plugin to desugar ! into do-notation☆37Updated 3 months ago
- Implementing a small functional language with a combinator based graph-reduction machine☆31Updated last year