david-christiansen / final-pretty-printer
A monadic (and pretty) pretty printer for Haskell
☆38Updated last year
Alternatives and similar repositories for final-pretty-printer
Users that are interested in final-pretty-printer are comparing it to the libraries listed below
Sorting:
- An experimental intermediate language for GHC☆36Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- ☆14Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Standard module for type-level programming in Haskell☆31Updated 5 years ago
- Dual Traversable☆42Updated 2 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- Agda-style equational reasoning in Haskell☆53Updated last month
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Maps using values' monoidal structure during merging☆42Updated last month
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- An experiment in functional interface design☆24Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 2 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated 2 weeks ago
- higher-kinded data☆30Updated 2 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- The Str signature and implementations☆21Updated 7 years ago