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 clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- MetaML and MetaOCaml bibliography☆94Updated 8 months ago
- An experimental type checker for a modal dependent type theory.☆113Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Generation of abstract binding trees☆28Updated 9 months ago
- Experiments with sequent calculi☆27Updated 4 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
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- A string diagram generator for LaTeX.☆30Updated 2 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Efficient binder representation in OCaml☆43Updated last year