solomon-b / HowardLangLinks
An interpreted lambda calculus with Algebraic and Recursive Types.
☆20Updated 4 years ago
Alternatives and similar repositories for HowardLang
Users that are interested in HowardLang are comparing it to the libraries listed below
Sorting:
- ☆33Updated 5 months ago
- Overloaded plugin☆31Updated last year
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Generic data types in Haskell, utilities for GHC.Generics☆45Updated 2 months ago
- Omit fields for instance deriving☆37Updated 5 years ago
- checkers for algebra driven design☆34Updated 3 years ago
- higher-kinded data☆30Updated 2 years ago
- Parse bytes fast☆25Updated this week
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 4 months ago
- ScopeT and ScopeH☆13Updated last year
- There are many category theory implementations, but this one is mine☆16Updated last year
- Efficient parser combinators for Haskell☆39Updated 2 months ago
- rewrite rules for type-level equalities☆62Updated 2 months ago
- a new, WIP Haskell compiler☆14Updated 5 years ago
- Staged Streams and other stuff☆19Updated 3 years ago
- Derive KnownNat constraints from other KnownNat constraints☆14Updated last month
- A library encoding monoidal functors and related structures in Haskell.☆17Updated 2 months ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- Existential type.☆37Updated 10 months ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- Standard module for type-level programming in Haskell☆31Updated 6 years ago
- ☆10Updated 4 years ago
- Classes for types where we know all the values☆39Updated 10 months ago
- ☆13Updated 5 years ago
- Bidirectional Parsing. Work in Progress☆33Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A very simple interface for incremental computation using STM in Haskell.☆13Updated 2 years ago
- A virtual memory scanner☆10Updated last year