robrix / abstract-interpretation
Experiments in abstracting definitional interpreters
☆16Updated 7 years ago
Alternatives and similar repositories for abstract-interpretation:
Users that are interested in abstract-interpretation are comparing it to the libraries listed below
- ☆23Updated 7 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- Experimentation project☆16Updated 11 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- static analysis of free monads☆24Updated 6 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- ☆17Updated 6 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 6 years ago
- Convert data to and from a natural number representation☆13Updated 3 years ago
- A tutorial on writing a concurrency testing tool in Haskell☆13Updated 7 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆20Updated this week
- A package re-exporting the verified subset of containers☆20Updated 6 years ago