poitin / DistillerLinks
Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".
☆29Updated 3 years ago
Alternatives and similar repositories for Distiller
Users that are interested in Distiller are comparing it to the libraries listed below
Sorting:
- Coq & Haskell code for Calculating Correct Compilers II☆12Updated 3 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆69Updated 8 months ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- ☆26Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆32Updated 4 months ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- SPSC: A Small Positive Supercompiler☆39Updated last year
- An enhanced unification algorithm for Coq☆58Updated last month
- Hoare Type Theory☆84Updated 6 months ago
- Benchmarking algebraic effect handler implementations☆26Updated 4 years ago