draperlaboratory / cspgenLinks
A tool for translating imperative programs to CSP.
☆12Updated 8 years ago
Alternatives and similar repositories for cspgen
Users that are interested in cspgen 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
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A package re-exporting the verified subset of containers☆20Updated 7 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- ☆21Updated 8 months ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Authenticated Data Structures☆16Updated 10 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
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- ☆12Updated 9 years ago
- "An Altruistic Processor", implemented in CLaSH (WARNING: incomplete code)☆13Updated 8 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 6 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Regular expressions of types☆16Updated 6 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago