slindley / effect-handlersLinks
☆82Updated last year
Alternatives and similar repositories for effect-handlers
Users that are interested in effect-handlers are comparing it to the libraries listed below
Sorting:
- The Evolution of a Typechecker☆54Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated this week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Logical relations proof in Agda☆26Updated 10 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 7 months ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Simplified Observational Type Theory☆82Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- A TACtic library for Agda☆48Updated 8 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago