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 week
- 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
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 2 weeks ago
- Prototype code for some Julia-OCaml bindings☆16Updated 4 years ago
- A simple BDD library for OCaml☆13Updated 3 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- (Extremely) simple standalone symbolic algebra library in OCaml. (Mirrored from original site.)☆12Updated 13 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 3 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Tiny verified SAT-solver☆28Updated 3 years ago
- A Coq plugin that implements exceptions in Coq☆14Updated 4 years ago
- haha I'm graduating☆14Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 weeks ago
- An exact real arithmetic (aka constructive reals) for OCaml☆13Updated last year
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 weeks ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- Effects-based OCaml Nameserver☆20Updated 3 months ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 3 weeks ago
- IO should be just a library☆23Updated 2 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Updated 2 years ago
- PL syntax macros.☆19Updated 2 months ago
- Formal Semantics for Why3☆18Updated last month
- IO for Gallina☆33Updated 2 months ago