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.☆112Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 2 weeks ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Library of Unix effects for Coq.☆24Updated 5 years ago
- MetaML and MetaOCaml bibliography☆94Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- Where my everyday research happens☆53Updated last month
- ☆84Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago