stoeffel / haskell-simple-dsl-examples
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 tutorial on how Agda infers things☆41Updated 4 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 9 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- Distributors - Unifying Parsers, Printers & Grammars☆24Updated last week
- Fine-grained lattice primitives for Haskell☆37Updated last week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 2 weeks ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 3 months ago
- ☆47Updated 5 months ago
- apkg - package manager for Agda☆37Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- APIs for more recursive definitions☆19Updated 6 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- ☆18Updated 4 years ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- ☆14Updated 5 years ago
- Paper and talk☆54Updated last year
- NbE course @ Chalmers☆28Updated 7 months ago