vmchale / recursion
Recursion schemes in ATS
ā9Updated 2 years ago
Related projects ā
Alternatives and complementary repositories for recursion
- š Idris implementation of patricia treeā22Updated 4 years ago
- ā23Updated 7 years ago
- More strongly typed variant of the ixset Haskell packageā23Updated 3 months ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of sā¦ā21Updated 5 years ago
- Type Safe LLVM IR ( Experimental )ā49Updated 6 years ago
- Austin's supercompiler workā21Updated 5 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis projectā18Updated 5 years ago
- van Laarhoven lenses for Idrisā20Updated 7 years ago
- ā23Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)ā15Updated 6 years ago
- Minimal binary serialization library with focus on performanceā17Updated 3 years ago
- Resin: high performance variable binder and ast manipulation libā13Updated 5 years ago
- Dependently typed elimination functions using singletonsā28Updated 3 weeks ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)ā25Updated 6 years ago
- ā41Updated 7 years ago
- Edit is a monad for rewriting things.ā23Updated 4 years ago
- Dependently typed Algorithm M and friendsā25Updated 6 years ago
- A natural transformation packageā16Updated 3 weeks 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
- Reification of data structures using observable sharingā28Updated 3 weeks ago
- š Better Haskell documentation.ā17Updated 4 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.ā48Updated 7 months ago
- A constant-memory approximation of set membershipā24Updated 4 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.ā28Updated 9 years ago
- A partial binary associative operator (appendMaybe :: a ā a ā Maybe a)ā14Updated last month
- A copy of Daan Leijen's reference implementation of HMF (type inference)ā16Updated 8 years ago
- phantom typesā37Updated 2 months ago
- a logic-based trust-management systemā19Updated 12 years ago