effect-handlers / effect-handlers-benchLinks
Benchmark repository of polyglot effect handler examples
☆29Updated 2 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:
- ☆39Updated 2 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- EGraphs in OCaml☆76Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- an implementation of Observational Type Theory (OTT) and more☆29Updated 3 years ago
- ☆56Updated this week
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Coq library for tactics, basic definitions, sets, maps☆49Updated 3 weeks ago
- Gallina to Bedrock2 compilation toolkit☆61Updated 3 weeks ago
- Ocaml Linear Engine for JavaScript Regexes, implementing the algorithms described in Linear Matching of JavaScript Regular Expressions at…☆18Updated last year
- 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
- Racket Equivalence Graph Library☆19Updated 3 years ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- ☆36Updated 4 years ago
- ☆16Updated 3 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆56Updated 3 months ago
- Educational Proof Assistant for Type Theory☆75Updated last year
- Graded Dependent Type systems☆25Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Coq library on rewriting theory and termination☆37Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Tiny verified SAT-solver☆30Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week