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:
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated this week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated 11 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- ☆29Updated 2 years ago
- An itree-like data-structure to additionally support internal non-determinism☆17Updated this week
- A type checker for the Lean theorem prover☆41Updated 4 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- ☆21Updated 7 years ago
- Command-like expressions for real infinite-precision calculations☆50Updated last month
- Paper and talk☆54Updated 2 years ago
- Graded Dependent Type systems☆24Updated 2 years ago
- # A simple variable binding library based on well-scoped indices and environments☆11Updated 2 weeks ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- ☆36Updated 3 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆34Updated last week
- The opentheory tool processes higher order logic theory packages☆16Updated 2 years ago
- Type theory in type theory☆16Updated 13 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 3 weeks ago
- ☆13Updated 3 years ago