effect-handlers / effect-handlers-benchLinks
Benchmark repository of polyglot effect handler examples
☆25Updated 3 months ago
Alternatives and similar repositories for effect-handlers-bench
Users that are interested in effect-handlers-bench are comparing it to the libraries listed below
Sorting:
- ☆34Updated 9 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Deadlock freedom by type checking☆20Updated 2 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- ☆36Updated 3 years ago
- Racket Equivalence Graph Library☆19Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- Educational Proof Assistant for Type Theory☆74Updated 11 months ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- mirror of A simple type-theoretic language: Mini-TT☆39Updated 8 years ago
- ☆55Updated 3 months ago
- ☆16Updated 3 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- A cost-aware logical framework, embedded in Agda.☆63Updated last week
- Dafny for Metatheory of Programming Languages☆25Updated last month
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Updated 4 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 4 months ago
- EGraphs in OCaml☆65Updated last year
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆52Updated last week
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Graded Dependent Type systems☆24Updated 2 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago