pdarragh / parsing-with-zippers-paper-artifactView external linksLinks
The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
☆29Jan 24, 2024Updated 2 years ago
Alternatives and similar repositories for parsing-with-zippers-paper-artifact
Users that are interested in parsing-with-zippers-paper-artifact are comparing it to the libraries listed below
Sorting:
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Formalising session types in Coq☆17Sep 6, 2019Updated 6 years ago
- ☆19Sep 18, 2021Updated 4 years ago
- ☆12Mar 15, 2021Updated 4 years ago
- Library for tokenizing code with TextMate grammars☆12Jan 4, 2024Updated 2 years ago
- Static site generator☆12Apr 6, 2025Updated 10 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- A simple BDD library for OCaml☆13May 20, 2025Updated 8 months ago
- A splay tree implementation.☆14Jan 15, 2026Updated last month
- LINQ-like combinators for manipulating collections of in-memory data☆16Sep 21, 2020Updated 5 years ago
- Small tensor library a la GLSL☆17Oct 28, 2022Updated 3 years ago
- Verifier for effectful, higher-order programs☆17Feb 10, 2026Updated last week
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- A stack-driven generator of arbitrary WebAssembly programs☆19Sep 5, 2021Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 10 months ago
- ☆16Mar 11, 2022Updated 3 years ago
- Yet another concurrent playground☆33Nov 18, 2015Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- Plotting for ocaml based on matplotlib.pyplot☆33Jun 19, 2022Updated 3 years ago
- [beta] persistent memoization of computations, e.g. for repeatable tests and benchmarks☆16Jan 31, 2020Updated 6 years ago
- NumLin: Linear Types for Linear Algebra☆23Jan 21, 2023Updated 3 years ago
- OCaml library for manipulating context-free grammars☆20Nov 28, 2025Updated 2 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 2 months ago
- A (formalised) general definition of type theories☆59Jun 10, 2021Updated 4 years ago
- Simple, in-memory, monomorphic and heterogeneous search indexes in OCaml☆25Jan 11, 2023Updated 3 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Composable byte stream readers and writers for OCaml☆22Updated this week
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Jun 3, 2022Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- ☆21Mar 15, 2016Updated 9 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆75Nov 7, 2025Updated 3 months ago
- Declarative JSON data manipulation for OCaml☆23Updated this week
- Bedrock Bit Vector Library☆28Oct 28, 2025Updated 3 months ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A library with an encoding of higher kinded types in OCaml☆43Jan 15, 2026Updated last month
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago