pdarragh / parsing-with-zippers-paper-artifactLinks
The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
☆28Updated last year
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 Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- MetaML and MetaOCaml bibliography☆94Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Simple reference implementation of Hazelnut using js_of_ocaml and OCaml React. (frozen -- ongoing development in the hazel repo)☆29Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Generation of abstract binding trees☆28Updated 8 months ago
- Efficient binder representation in OCaml☆43Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- ☆29Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 9 months ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 months ago