CoFloCo is a static analysis tool written in prolog to infer automatically symbolic complexity bounds of imperative and recursive programs.
☆18Sep 25, 2021Updated 4 years ago
Alternatives and similar repositories for CoFloCo
Users that are interested in CoFloCo are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- llvm2KITTeL☆20Feb 16, 2017Updated 9 years ago
- KITTeL/KoAT☆21Dec 19, 2018Updated 7 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Nov 18, 2019Updated 6 years ago
- The ABS modeling language and surrounding tools☆37Updated this week
- Reincarnate Artifact for ICFP 2018☆13Jun 24, 2024Updated last year
- Timing attack resistant type systems☆24May 13, 2015Updated 10 years ago
- sliding fast fourier transform using haskell streaming☆13Feb 19, 2019Updated 7 years ago
- A tool that generates a data structure from a schema and some relational queries, using modern database techniques to make queries highly…☆10Jul 25, 2021Updated 4 years ago
- GHCJS FFI bindings to the Electron API (WIP).☆10May 21, 2017Updated 8 years ago
- GHC patched with the -fcompact-holes flag☆11Nov 12, 2018Updated 7 years ago
- A formally verified implementation of differential dynamic logic in Coq☆18May 16, 2022Updated 3 years ago
- Haskell numerical ODE solvers☆14Aug 21, 2017Updated 8 years ago
- nominal sets in haskell☆19Nov 18, 2018Updated 7 years ago
- "An Altruistic Processor", implemented in CLaSH (WARNING: incomplete code)☆13Mar 31, 2017Updated 8 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- Erlang Declarative Debugger☆20Jul 22, 2020Updated 5 years ago
- Pure haskell implementation of macaroons☆14Jan 26, 2021Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- This will, one day, be a Haskell implementation of Cap'n Proto.☆11Feb 21, 2016Updated 10 years ago
- A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.☆12Dec 27, 2016Updated 9 years ago
- SWI-Prolog lambda runtime☆17Aug 12, 2024Updated last year
- A linter for Soufflé Datalog☆17Apr 1, 2024Updated last year
- ☆14Dec 9, 2022Updated 3 years ago
- Cut-pursuit algorithms, parallelized along components☆10Aug 5, 2020Updated 5 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Explorations in relations and the algebra of programming☆17Oct 4, 2019Updated 6 years ago
- A bunch of NPM packages defined in the nix language.☆12May 25, 2021Updated 4 years ago
- ☆18Aug 31, 2022Updated 3 years ago
- Starfield renderer☆11Jun 26, 2019Updated 6 years ago
- Reason about Term Rewriting Systems☆18Jul 24, 2022Updated 3 years ago
- An ergonomic, mobile-first, Prolog playground!☆31Sep 13, 2022Updated 3 years ago
- ☆18May 23, 2020Updated 5 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Abelian sandpiles☆16Nov 16, 2024Updated last year
- Unpinned byte arrays in GHC haskell☆22Jan 8, 2019Updated 7 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Dec 29, 2023Updated 2 years ago
- Synthetic Differential Geometry in Agda☆13Jan 14, 2015Updated 11 years ago
- QuasiQuoter for GHCJS JavaScript FFI☆20Jul 1, 2016Updated 9 years ago
- Retypd plugin for Ghidra reverse engineering framework from NSA☆27Jul 6, 2023Updated 2 years ago