A ppx rewriter that generates hash functions from type expressions and definitions
☆17Jan 15, 2026Updated last month
Alternatives and similar repositories for ppx_hash
Users that are interested in ppx_hash are comparing it to the libraries listed below
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 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Self-adjusting computations☆23Oct 9, 2023Updated 2 years ago
- S-expression pretty-printer☆22Jan 15, 2026Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- A constraint solver built from scratch in OCaml☆12Dec 10, 2021Updated 4 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- OCaml backend for Agda☆39Oct 4, 2018Updated 7 years ago
- OCaml implementation of sets as hash tables by Jean-Christophe Filliatre☆10Feb 13, 2025Updated last year
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- ☆13Sep 15, 2022Updated 3 years ago
- ☆17Oct 31, 2025Updated 4 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 9 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- Deprecated, use ocaml-ppx/ppxlib instead☆13Mar 29, 2018Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- Various signed and unsigned integer types for OCaml☆66Dec 7, 2024Updated last year
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- ☆18May 10, 2022Updated 3 years ago
- A minimalist implementation of type theory, suitable for experimentation☆16Aug 9, 2025Updated 6 months ago
- An exact real arithmetic (aka constructive reals) for OCaml☆13Jun 14, 2024Updated last year
- A personal library, formalizing cohesive homotopy type theory in Agda.☆13Apr 30, 2019Updated 6 years ago
- Typeset version of EGA and SGA by Grothendieck.☆12Jan 28, 2014Updated 12 years ago
- safe FFI between OCaml and Rust (experimental)☆68Aug 23, 2020Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- ☆16Dec 28, 2021Updated 4 years ago
- [dead] combinators for type conversion (serialization/deserialization) to/from several formats. See this blog post (outdated): http://ced…☆27Mar 9, 2019Updated 6 years ago
- [beta] High-level wrapper around ocaml-sqlite3☆17Apr 28, 2022Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago
- ☆21Jan 24, 2022Updated 4 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 tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Lean course materials for Brown CS 22, Spring 2023☆20Nov 20, 2023Updated 2 years ago
- 🔙 Backward lists for OCaml☆22Nov 21, 2025Updated 3 months ago
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year