Generic implementation of different CFA families based on monadic decomposition
☆23Jan 16, 2013Updated 13 years ago
Alternatives and similar repositories for monadic-cfa
Users that are interested in monadic-cfa are comparing it to the libraries listed below
Sorting:
- Experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for LambdaJS and a subset of Scheme pro…☆30Nov 24, 2015Updated 10 years ago
- JVM Abstracting Abstract Machine☆25Jan 29, 2019Updated 7 years ago
- Regular expressions of types☆16Sep 13, 2018Updated 7 years ago
- The PGG Partial Evaluation System for Scheme 48☆18Dec 31, 2012Updated 13 years ago
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- An abstract-interpretation based static analyzer written in Scala.☆33Mar 23, 2022Updated 3 years ago
- The generalized intensional compiler for a Haskell-like language.☆14Nov 27, 2017Updated 8 years ago
- A PLT Redex implementation of Featherweight Java☆17Oct 8, 2012Updated 13 years ago
- new generation language☆20Aug 2, 2013Updated 12 years ago
- PPLite: convex polyhedra library for Abstract Interpretation☆30Jan 22, 2026Updated last month
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Jun 24, 2020Updated 5 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- SOM++ - C++ implementation of the Simple Object Machine Smalltalk☆13Aug 23, 2025Updated 6 months ago
- A DSL for generating GR(1) problems☆12Jul 27, 2021Updated 4 years ago
- just to keep a version of my code as I attempt to learn haskell.☆23May 3, 2016Updated 9 years ago
- Notes for CIS 700 (Fall '19) at Syracuse U.☆13Nov 6, 2019Updated 6 years ago
- The Elements of Statistical Learning in Haskell☆13Nov 29, 2017Updated 8 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆63Jun 23, 2023Updated 2 years ago
- A YAML library for Racket.☆20Jan 19, 2026Updated last month
- Parser and type analysis for the Go programming language☆12Aug 3, 2023Updated 2 years ago
- A parser generator generator☆19May 17, 2023Updated 2 years ago
- Abstracting Definitional Interpreters☆74Nov 25, 2017Updated 8 years ago
- ☆10Jan 24, 2016Updated 10 years ago
- Erlang BEAM emulator in Haskell☆48Jun 14, 2014Updated 11 years ago
- A fork of jhc. And also a Haskell compiler.☆136Jun 8, 2019Updated 6 years ago
- Version of IKOS abstract interpreter implementing parallel deterministic fixpoint computation☆16Aug 24, 2020Updated 5 years ago
- An llvm pretty printer inspired by the haskell llvm binding☆31Updated this week
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- A basic Parsec-like monadic parser combinator library implementation in Racket.☆49Dec 3, 2022Updated 3 years ago
- The uncurried minimal functional programming language for CPS transformation☆19Feb 23, 2024Updated 2 years ago
- Jhc: Haskell Compiler☆39Aug 31, 2015Updated 10 years ago
- A language-generic implementation of equality saturation in Haskell☆22Dec 4, 2018Updated 7 years ago
- Racket bindings for Z3☆20Aug 7, 2012Updated 13 years ago
- Experiments about intermediate representations in compilers☆28Aug 24, 2012Updated 13 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A very simple example of how to use Alex and Happy to build a language processor in Haskell.☆15Jan 23, 2015Updated 11 years ago
- constructors for Shift format AST nodes☆28Apr 27, 2022Updated 3 years ago
- A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…☆27Mar 30, 2018Updated 7 years ago
- ☆22Apr 1, 2013Updated 12 years ago