uwplse / reincarnate-aecLinks
Reincarnate Artifact for ICFP 2018
☆13Updated last year
Alternatives and similar repositories for reincarnate-aec
Users that are interested in reincarnate-aec are comparing it to the libraries listed below
Sorting:
- An elegant implementation of discrete diffgeo in haskell☆34Updated 5 years ago
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A Haskell library for Approximating Exact Real Numbers (AERN) based on interval computation. (aern2 is a rewrite of aern.)☆23Updated 4 months ago
- Generalized Convolution and Efficient Language Recognition☆17Updated 6 years ago
- A static analysis tool for C.☆28Updated 6 years ago
- Collaborative work on reversible computing☆25Updated 4 years ago
- Embedded C code generation DSL for Haskell.☆28Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- A geometric algebra implementation in Haskell☆32Updated 5 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last month
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- ideally, this will become a pure Haskell library for Linear Integer/Mixed Programming☆16Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- Constructive Galois connections☆36Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Formal topology (and some probability) in Coq☆31Updated 7 years ago
- ☆26Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Monadic Constraint Programming framework☆28Updated 7 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Updated 3 weeks ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- Selective applicative functors laws and theorems☆15Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago