j-mie6 / gigaparsec
Refreshed parsec-style library for compatibility with Scala parsley
☆19Updated last month
Alternatives and similar repositories for gigaparsec:
Users that are interested in gigaparsec are comparing it to the libraries listed below
- Reimplementation of Parsley in Haskell, with improvements☆52Updated last year
- being an operating system for typechecking processes☆126Updated 2 years ago
- Compiling Agda code to readable Haskell☆187Updated last week
- A core language and API for dependently typed languages☆92Updated 2 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Horn Clause Constraint Solving for Liquid Types☆145Updated 2 weeks ago
- 🚧 a work in progress effect system for Haskell 🚧☆126Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Staged push/pull fusion with typed Template Haskell☆59Updated last year
- ☆47Updated 5 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Language Server for Agda☆108Updated 4 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- LLVM code generation in Haskell☆54Updated 6 months ago
- A verified compiler for a lazy functional language☆35Updated last week
- bollu learns implementation of dependent typing☆28Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- ☆33Updated 7 months ago
- high-performance cubical evaluation☆72Updated last week
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated last month
- Example language server (LSP) implementation for a toy language☆59Updated 3 years ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago