jwiegley / bytestring-fiatLinks
An implementation of the Haskell ByteString library using the Fiat system from MIT
☆34Updated 3 years ago
Alternatives and similar repositories for bytestring-fiat
Users that are interested in bytestring-fiat are comparing it to the libraries listed below
Sorting:
- An experimental intermediate language for GHC☆36Updated 8 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- ghc --make reimplemented with Shake☆32Updated 2 years ago
- rewrite rules for type-level equalities☆62Updated 3 months ago
- Kleene algebra, regular expressions☆33Updated 2 years ago
- Classes for types where we know all the values☆39Updated 11 months ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- ☆45Updated 4 years ago
- The Str signature and implementations☆21Updated 8 years ago
- A GHC plugin and library for analysing GHC Core☆54Updated 10 months ago
- Haskell Type Level Example Programs☆28Updated 8 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Folds for recursive types with GHC Generics☆28Updated 4 months ago
- Standard module for type-level programming in Haskell☆31Updated 6 years ago
- Quasiquoter for LLVM☆31Updated 7 years ago
- Various type-aligned sequence data structures.☆21Updated 4 years ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 7 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 5 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- ☆24Updated 5 years ago
- parser for config files, shell variables, command line args.☆22Updated 9 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆49Updated last year
- A HUnit/hspec assertion to verify that an expression does not typecheck☆43Updated 6 years ago
- ScopeT and ScopeH☆13Updated last year
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year