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
Sorting:
- 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
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 4 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- ☆17Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- ☆16Updated 2 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Authenticated Data Structures☆16Updated 9 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆21Updated 2 weeks ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Experimentation project☆16Updated 11 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- 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
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago