kwanghoon / yapb
YAPB: Yet Another Parser Builder (A Programmable LALR(1) Parser Builder in Haskell)
☆15Updated 7 months ago
Related projects ⓘ
Alternatives and complementary repositories for yapb
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- bidirectional type checking algorithms for higher-ranked polymorphism☆18Updated 2 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆17Updated 8 years ago
- A tool for translating imperative programs to CSP.☆10Updated 7 years ago
- A bottom-up approach to a verified implementation of MLTT☆15Updated this week
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 2 months ago
- The Prettiest Printer☆35Updated 8 months ago
- https://metaborg.github.io/mj.agda/☆12Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated last week
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Constructive Galois connections☆32Updated 6 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Updated 5 years ago
- ☆14Updated 5 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- ICFP tutorial☆40Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- A tutorial on how Agda infers things☆34Updated 3 years ago
- A cost-aware logical framework, embedded in Agda.☆55Updated 2 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago