joelburget / typed-algebraic-parsingLinks
An implementation of "A Typed, Algebraic Approach to Parsing"
☆11Updated 3 years ago
Alternatives and similar repositories for typed-algebraic-parsing
Users that are interested in typed-algebraic-parsing are comparing it to the libraries listed below
Sorting:
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A type checker for the Lean theorem prover☆40Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Graded Dependent Type systems☆25Updated 2 years ago
- A OCaml generator for well-typed terms (that use their arguments).☆11Updated 10 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 2 months ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 3 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 5 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- The Next Generation of Compositional Programming☆56Updated last week
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Partition refinement☆16Updated 2 years ago
- Coq library on rewriting theory and termination☆37Updated last month
- Benchmark repository of polyglot effect handler examples☆32Updated 4 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Kleene algebra modulo theories☆27Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago