robrix / abstract-interpretationLinks
Experiments in abstracting definitional interpreters
☆16Updated 8 years ago
Alternatives and similar repositories for abstract-interpretation
Users that are interested in abstract-interpretation are comparing it to the libraries listed below
Sorting:
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Authenticated Data Structures☆16Updated 10 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 8 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 10 months ago
- SPAKE2 key exchange protocol for Haskell☆14Updated 2 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆19Updated 8 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- A nullary type class for partial functions☆15Updated 7 years ago
- Talk on generic parallel scan☆14Updated 8 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A simple ML dialect☆11Updated 8 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- GRIN Haskell backend stripped out from JHC. (GRIN from scratch: https://github.com/grin-tech/grin)☆16Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Yet another concurrent playground☆33Updated 10 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated this week
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- static analysis of free monads☆24Updated 7 years ago
- ☆23Updated 8 years ago
- A hashing-based graph implementation in Haskell☆33Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Updated 9 years ago