typesanitizer / edit
Edit is a monad for rewriting things.
☆23Updated 4 years ago
Alternatives and similar repositories for edit:
Users that are interested in edit are comparing it to the libraries listed below
- ☆23Updated 7 years ago
- Dependent hash maps☆14Updated 8 months ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 6 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 7 years ago
- 🌋 Idris implementation of patricia tree☆22Updated 4 years ago
- Experiments with effect systems☆12Updated 8 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Linear map categories in Agda☆5Updated last year
- 🔖 Better Haskell documentation.☆17Updated 4 years ago
- More strongly typed variant of the ixset Haskell package☆24Updated 5 months ago
- A Haskell library for parsing, pretty-printing, and evaluating the Ninja build language.☆34Updated 6 years ago
- Run lifted IO operations asynchronously and wait for their results☆28Updated 2 months ago
- Types representing line and column positions and ranges in text files☆11Updated last year
- Type Theory in Type Theory using Cubical Agda☆12Updated 5 years ago
- Reification of data structures using observable sharing☆28Updated 3 months ago
- ☆20Updated 5 years ago
- Efficiently hash Haskell values with MD5, SHA256, SHA512 and other hashing algorithms☆15Updated 2 weeks ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- open union and open product types in Haskell☆32Updated 4 years ago
- ☆23Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated last month
- Recursion schemes in ATS☆9Updated 2 years ago
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆17Updated 3 months ago
- Manage Nix Haskell override sets☆11Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A usable type system for call by push-value☆30Updated 5 years ago