csabahruska / p4f-control-flow-analysisLinks
Haskell implementation of P4F Control-Flow Analysis
☆21Updated 3 years ago
Alternatives and similar repositories for p4f-control-flow-analysis
Users that are interested in p4f-control-flow-analysis are comparing it to the libraries listed below
Sorting:
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Genetic program repair using GHC☆33Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Constructive Galois connections☆36Updated 7 years ago
- ☆23Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- The Prettiest Printer☆35Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆63Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆18Updated 9 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- ICFP tutorial☆39Updated 4 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago