Ucombinator / parsing-with-zippers
A clean implementation of Parsing with Zippers.
☆37Updated 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
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 weeks ago
- 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
- A simple implementation of linear type theory☆38Updated 8 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Brainfuck formalized in Coq☆26Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 10 months ago
- secret project☆17Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated last year
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Experimental functional language☆17Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- 🌳 Generate a fresh bonsai in your terminal☆23Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago