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:
- NbE course @ Chalmers☆28Updated 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.☆22Updated 8 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆16Updated 3 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- being an experiment with potato power☆23Updated 5 years ago
- 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
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A tool for translating imperative programs to CSP.☆12Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆21Updated last week
- Typing the linear pi calculus in Agda☆29Updated 3 years ago