acorrenson / modulusLinks
A constraint solver built from scratch in OCaml
☆11Updated 3 years ago
Alternatives and similar repositories for modulus
Users that are interested in modulus are comparing it to the libraries listed below
Sorting:
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- First-order automated theorem prover based on the tableau method☆17Updated last month
- Higher kinded polymorphism in SML☆15Updated 5 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated last month
- Prototype code for some Julia-OCaml bindings☆16Updated 4 years ago
- haha I'm graduating☆14Updated 4 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
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- A simple BDD library for OCaml☆13Updated 4 months ago
- A Deductive Verification Tool for OCaml Programs☆75Updated last month
- PL syntax macros.☆19Updated last week
- Tiny verified SAT-solver☆28Updated 3 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- An exact real arithmetic (aka constructive reals) for OCaml☆13Updated last year
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- (Extremely) simple standalone symbolic algebra library in OCaml. (Mirrored from original site.)☆12Updated 13 years ago
- UCI-compatible chess engine in OCaml.☆13Updated 5 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- IO should be just a library☆23Updated 2 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A parsing library that compiles grammars to combinators using elimination of left recursion☆22Updated last year
- Effects-based OCaml Nameserver☆20Updated 3 months ago