j-mie6 / gigaparsec
Refreshed parsec-style library for compatibility with Scala parsley
☆16Updated this week
Related projects ⓘ
Alternatives and complementary repositories for gigaparsec
- A Language with Dependent Data and Codata Types☆57Updated this week
- being an operating system for typechecking processes☆121Updated last year
- Language Server for Agda☆102Updated 2 weeks ago
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆29Updated 7 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A core language and API for dependently typed languages☆89Updated 11 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 2 years ago
- A verified compiler for a lazy functional language☆32Updated last month
- bollu learns implementation of dependent typing☆25Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- high-performance cubical evaluation☆68Updated 4 months ago
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- High level commands to declare a hierarchy based on packed classes☆97Updated this week
- Staged compilation with dependent types☆162Updated this week
- A fast and modern parser combinator library for Scala☆178Updated this week
- A mechanisation of Wasm in Coq☆97Updated 2 weeks ago
- ☆47Updated last month
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆146Updated 8 months ago
- Coq plugin embedding elpi☆139Updated this week
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- ☆24Updated last month
- 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
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- A compiler for functional programs on serialized data☆158Updated this week
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- ☆79Updated last week
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆43Updated 4 months ago