slindley / effect-handlers
☆82Updated 11 months ago
Alternatives and similar repositories for effect-handlers:
Users that are interested in effect-handlers are comparing it to the libraries listed below
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- OCaml backend for Agda☆40Updated 6 years 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
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 2 weeks ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆94Updated 7 years ago
- Where my everyday research happens☆52Updated last week
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- ☆84Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- The Prettiest Printer☆34Updated last year