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:
- The Evolution of a Typechecker☆54Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 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
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- MetaML and MetaOCaml bibliography☆97Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Library of Unix effects for Coq.☆23Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 8 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago