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:
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆16Updated 3 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Constructive Galois connections☆35Updated 7 years ago
- ICFP tutorial☆39Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months 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
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- ☆21Updated 8 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 years ago