Ucombinator / parsing-with-zippers
A clean implementation of Parsing with Zippers.
☆38Updated 6 years ago
Alternatives and similar repositories for parsing-with-zippers
Users that are interested in parsing-with-zippers are comparing it to the libraries listed below
Sorting:
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆37Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A simple parser combinator library for Ocaml☆30Updated 3 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- secret project☆17Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Brainfuck formalized in Coq☆26Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- OCaml backend for Agda☆40Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 7 months ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- An MVC library for writing interactive webpages in OCaml☆35Updated 10 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- multi-shot continuations in OCaml☆48Updated 3 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated last month
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 4 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago