michaelpj / abstract-machine-debuggersLinks
☆12Updated 6 years ago
Alternatives and similar repositories for abstract-machine-debuggers
Users that are interested in abstract-machine-debuggers are comparing it to the libraries listed below
Sorting:
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆17Updated 3 months ago
- Bring fusion to everyone☆13Updated 5 years ago
- Zippers for cofree types☆12Updated 3 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- ☆23Updated last year
- Funny little Haskell impl☆18Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Existential type.☆37Updated 5 months ago
- Haskell bindings to Chez Scheme☆10Updated last year
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- An experimental build system based on the Haxl library☆8Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Interval datatype, interval arithmetic, and interval-based containers for Haskell☆21Updated last week
- A package re-exporting the verified subset of containers☆20Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Flexible Haskell library for parsing and printing S-Expressions☆20Updated 7 months ago
- Regular expressions of types☆16Updated 6 years ago
- Staged Streams and other stuff☆18Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆18Updated 3 months ago
- An efficient finite map from (byte)strings to values.☆20Updated last month
- Types for ldtk☆15Updated last year
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago