slindley / effect-handlersLinks
☆84Updated 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:
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated 3 weeks ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Library of Unix effects for Coq.☆23Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Experiments with sequent calculi☆28Updated 4 years ago