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:
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- ☆60Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- MetaML and MetaOCaml bibliography☆91Updated 6 months ago
- Efficient binder representation in OCaml☆42Updated 11 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- Experiments with sequent calculi☆27Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Deferring the Details and Deriving Programs☆14Updated 5 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- ☆22Updated 9 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