solomon-b / HowardLangLinks
An interpreted lambda calculus with Algebraic and Recursive Types.
☆19Updated 4 years ago
Alternatives and similar repositories for HowardLang
Users that are interested in HowardLang are comparing it to the libraries listed below
Sorting:
- checkers for algebra driven design☆34Updated 2 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Omit fields for instance deriving☆37Updated 5 years ago
- ScopeT and ScopeH☆13Updated last year
- Generic data types in Haskell, utilities for GHC.Generics☆45Updated last month
- Overloaded plugin☆30Updated last year
- Bidirectional Parsing. Work in Progress☆33Updated last year
- Haskell Type Level Example Programs☆28Updated 7 years ago
- There are many category theory implementations, but this one is mine☆16Updated last year
- Safe web routing in haskell☆30Updated 2 years ago
- Normalization by Evaluation for Embedded Domain-specific Languages☆31Updated 10 months ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Standard module for type-level programming in Haskell☆30Updated 6 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- ☆10Updated 4 years ago
- Haskell library for doing category theory with a central role for profunctors☆23Updated this week
- Session Types with Priority in Linear Haskell☆27Updated last year
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Fine-grained lattice primitives for Haskell☆37Updated 2 months ago
- Staged Streams and other stuff☆19Updated 3 years ago
- Existential type.☆37Updated 9 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- rewrite rules for type-level equalities☆62Updated 3 weeks ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 2 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Manually constructed STG programs compiled with the standard GHC codegen backend.☆23Updated 4 years ago
- Efficient parser combinators for Haskell☆39Updated 2 weeks ago
- ICFP tutorial☆39Updated 4 years ago