Ucombinator / parsing-with-zippers
A clean implementation of Parsing with Zippers.
☆37Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for parsing-with-zippers
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆36Updated 2 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- Brainfuck formalized in Coq☆26Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 5 months ago
- Choice operator in OCaml, providing a backtracking monad☆24Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- secret project☆17Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆28Updated 5 years ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- Type theory in type theory☆16Updated 12 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆30Updated 5 years ago
- multi-shot continuations in OCaml☆46Updated 3 weeks ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Session types in Idris2!☆27Updated 3 years ago