kwanghoon / yapbLinks
YAPB: Yet Another Parser Builder (A Programmable LALR(1) Parser Builder in Haskell)
☆16Updated 3 months ago
Alternatives and similar repositories for yapb
Users that are interested in yapb are comparing it to the libraries listed below
Sorting:
- 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☆35Updated 5 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- PolyRPC, A multi-tier functional programming language☆20Updated 2 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- ICFP tutorial☆39Updated 4 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated last week
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 4 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago