taktoa / eqsat
A language-generic implementation of equality saturation in Haskell
☆21Updated 6 years ago
Alternatives and similar repositories for eqsat:
Users that are interested in eqsat are comparing it to the libraries listed below
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 11 months ago
- NbE course @ Chalmers☆28Updated 5 months ago
- being an experiment with potato power☆23Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Linear map categories in Agda☆5Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 6 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆23Updated 8 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- ☆18Updated 2 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆26Updated last year
- A formalization of finite, constructive log analysis using linear temporal logic☆20Updated this week