slindley / effect-handlersLinks
☆83Updated 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
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 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
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated 2 weeks ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- ☆84Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Where my everyday research happens☆53Updated last week
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Logical relations proof in Agda☆26Updated 10 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago