poitin / Distiller
Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".
☆27Updated 2 years ago
Alternatives and similar repositories for Distiller:
Users that are interested in Distiller are comparing it to the libraries listed below
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- SC Mini is a "minimal" positive supercompiler☆47Updated 4 years ago
- Experimental functional language☆18Updated 2 years ago
- MetaML and MetaOCaml bibliography☆86Updated last month
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆26Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆29Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- SPSC: A Small Positive Supercompiler☆33Updated 8 months ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- ☆35Updated 3 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆119Updated 3 years ago
- Experiments with sequent calculi☆26Updated 3 years ago
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- A verified compiler for a lazy functional language☆33Updated 2 weeks ago