A ppx rewriter that generates hash functions from type expressions and definitions
☆16Jul 10, 2026Updated 3 months ago
Alternatives and similar repositories for ppx_hash
Users that are interested in ppx_hash are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆16Jul 10, 2019Updated 7 years ago
- OCaml backend for Agda☆40Oct 4, 2018Updated 8 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- IO using sized types and copatterns☆36Apr 14, 2021Updated 5 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Self-adjusting computations☆23Oct 9, 2023Updated 3 years ago
- S-expression pretty-printer☆22Jul 10, 2026Updated 3 months ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 10 years ago
- A discouraging story.☆19May 8, 2018Updated 8 years ago
- ☆13Sep 15, 2022Updated 4 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- secret project☆17Mar 14, 2018Updated 8 years ago
- Deprecated, use ocaml-ppx/ppxlib instead☆13Mar 29, 2018Updated 8 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Syntaxes with Binding, Their Programs, and Proofs☆23Oct 26, 2023Updated 2 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Llama2 inference in one file of pure OCaml.☆26Sep 16, 2023Updated 3 years ago
- safe FFI between OCaml and Rust (experimental)☆68Aug 23, 2020Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- A personal library, formalizing cohesive homotopy type theory in Agda.☆13Apr 30, 2019Updated 7 years ago
- Typeset version of EGA and SGA by Grothendieck.☆14Jan 28, 2014Updated 12 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated last year
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆13May 15, 2017Updated 9 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Fintie Sets in Cubical Agda☆13Aug 30, 2019Updated 7 years ago
- Fast websocket library for OCaml, based on angstrom/httpaf☆32Sep 24, 2026Updated 2 weeks ago
- A constraint solver built from scratch in OCaml☆12Dec 10, 2021Updated 4 years ago
- OCaml implementation of sets as hash tables by Jean-Christophe Filliatre☆11Feb 13, 2025Updated last year
- An Irmin backend for a web browser's IndexedDB store☆33Jan 2, 2025Updated last year
- A minimalist implementation of type theory, suitable for experimentation☆16Jun 13, 2026Updated 4 months ago
- Extension of nom to apply "Packrat Parsing"