kwanghoon / yapbLinks
YAPB: Yet Another Parser Builder (A Programmable LALR(1) Parser Builder in Haskell)
☆16Updated 7 months ago
Alternatives and similar repositories for yapb
Users that are interested in yapb are comparing it to the libraries listed below
Sorting:
- Constructive Galois connections☆36Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated last week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- 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
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- NbE course @ Chalmers☆28Updated last year
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- ☆26Updated 8 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Mtac in Agda☆29Updated 4 years ago