robrix / abstract-interpretationLinks
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 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months 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
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- ☆23Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 8 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated last week
- being an experiment with potato power☆23Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Regular expressions of types☆16Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A compiler from mini-STG to Wasm (**far from complete**)☆14Updated 8 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago