amosr / folderolLinks
machine fusion
☆16Updated 7 years ago
Alternatives and similar repositories for folderol
Users that are interested in folderol are comparing it to the libraries listed below
Sorting:
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- ☆26Updated 9 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 6 years ago
- Agda-style equational reasoning in Haskell☆54Updated 3 weeks ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 5 months ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- topos programming☆31Updated 7 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- An efficient graph library for Haskell☆40Updated 5 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 6 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- Compiler backend for generating Scheme code☆28Updated 2 months ago
- IO using sized types and copatterns☆36Updated 4 years ago