poitin / DistillerLinks
Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".
☆28Updated 3 years ago
Alternatives and similar repositories for Distiller
Users that are interested in Distiller are comparing it to the libraries listed below
Sorting:
- A dependent type theory with user defined data types☆47Updated 3 years ago
- MetaML and MetaOCaml bibliography☆93Updated 8 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- a self-hosting lambda calculus compiler☆36Updated 5 months ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- SPSC: A Small Positive Supercompiler☆38Updated last year
- Setoid type theory implementation☆38Updated 2 years ago
- An enhanced unification algorithm for Coq☆56Updated 4 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- Constructive Galois connections☆35Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- ☆26Updated 8 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆45Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago