kwanghoon / yapbLinks
YAPB: Yet Another Parser Builder (A Programmable LALR(1) Parser Builder in Haskell)
☆16Updated 5 months ago
Alternatives and similar repositories for yapb
Users that are interested in yapb are comparing it to the libraries listed below
Sorting:
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated 2 months ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- ICFP tutorial☆39Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- ☆21Updated 4 years ago