Hash Array Mapped Tries for Racket
☆21Jan 30, 2017Updated 9 years ago
Alternatives and similar repositories for hamt
Users that are interested in hamt are comparing it to the libraries listed below
Sorting:
- Import SRFI metadata into the Scheme API☆11Jan 19, 2026Updated last month
- A practical http client library for sending data to http servers.☆10Jul 10, 2024Updated last year
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Jan 1, 2024Updated 2 years ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 3 years ago
- miniKanren for search, SMT for solving☆13Oct 20, 2019Updated 6 years ago
- ☆12Jul 1, 2025Updated 8 months ago
- Racket Equivalence Graph Library☆19May 24, 2022Updated 3 years ago
- ☆11Feb 21, 2026Updated last week
- Object Algebra Composition☆24Jul 4, 2013Updated 12 years ago
- A basic Parsec-like monadic parser combinator library implementation in Racket.☆49Dec 3, 2022Updated 3 years ago
- Parallel ML benchmark suite☆21Dec 8, 2025Updated 2 months ago
- An llvm pretty printer inspired by the haskell llvm binding☆31Updated this week
- Racket bindings for Z3☆20Aug 7, 2012Updated 13 years ago
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- An abstract machine for analyzing Racket bytecode.☆29May 1, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- What do you mean?☆47Dec 10, 2025Updated 2 months ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- Jane Street Capital's asynchronous execution library (unix)☆34Jan 15, 2026Updated last month
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- A model of the WebAssembly language in Redex☆21Mar 25, 2021Updated 4 years ago
- IO should be just a library☆24Jul 17, 2023Updated 2 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Sep 27, 2021Updated 4 years ago
- Generate PostScript diagrams from an EBNF grammar☆25Aug 26, 2015Updated 10 years ago
- Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine☆29Feb 18, 2021Updated 5 years ago
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Staged push/pull fusion with typed Template Haskell☆62Dec 17, 2023Updated 2 years ago
- OCaml plus Jane Street extensions☆73Jul 17, 2024Updated last year
- Choice operator in OCaml, providing a backtracking monad☆26Jan 26, 2022Updated 4 years ago
- ☆26May 5, 2015Updated 10 years ago
- Logical Relation for MLTT in Coq☆30Jan 14, 2026Updated last month