ezyang / effLinks
Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators
☆13Updated 5 years ago
Alternatives and similar repositories for eff
Users that are interested in eff are comparing it to the libraries listed below
Sorting:
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Updated 2 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- An exact real arithmetic (aka constructive reals) for OCaml☆13Updated last year
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 7 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- A stack-driven generator of arbitrary WebAssembly programs☆19Updated 4 years ago
- A simple BDD library for OCaml☆13Updated 7 months ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- ☆11Updated 3 years ago
- Implementation of a language interpreter in the browser, using js_of_ocaml.☆15Updated 8 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 3 years ago
- OCaml implementation of histogram-approximation algorithm☆15Updated 3 years ago
- Tiny verified SAT-solver☆30Updated 3 years ago
- (Extremely) simple standalone symbolic algebra library in OCaml. (Mirrored from original site.)☆12Updated 14 years ago
- Js_of_ocaml bindings for the p5.js library☆11Updated last year
- A formally verified compiler for a simple language with numbers and sums☆27Updated 5 years ago
- Formal Semantics for Why3☆19Updated 2 months ago
- 🌳 Generate a fresh bonsai in your terminal☆29Updated 4 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- A verified Implementation of a mini prolog☆17Updated 3 years ago
- Prototype code for some Julia-OCaml bindings☆16Updated 4 years ago
- A mini language for logic programming☆23Updated 5 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superpos…☆27Updated 2 years ago
- Kleene algebra modulo theories☆27Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago