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:
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- Bring fusion to everyone☆14Updated 5 years 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
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 6 years ago
- ☆26Updated 8 years ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- An efficient graph library for Haskell☆38Updated last month
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- ☆16Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- topos programming☆31Updated 7 years ago