taktoa / eqsatLinks
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
Sorting:
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- ☆26Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Regular expressions of types☆16Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A tool for translating imperative programs to CSP.☆12Updated 8 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago