gsakkas / rite
Type Error Feedback via Analytic Program Repair
☆16Updated last year
Related projects ⓘ
Alternatives and complementary repositories for rite
- Kleene algebra modulo theories☆27Updated 2 years ago
- Testing and benchmarking tool for logic-related programs.☆25Updated 2 months ago
- QUICr parametric abstract domain for sets☆12Updated 9 years ago
- ☆16Updated 5 years ago
- Examples to illustrate the use of experimental OCaml macros☆11Updated 6 years ago
- Tools for record-and-replay debugging☆42Updated last year
- A model-based QuickCheck test of ptrees (Patricia trees)☆12Updated 5 years ago
- First-order automated theorem prover based on the tableau method☆12Updated last week
- Datatype-generic object-oriented transformations for OCaml☆16Updated 3 months ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated 10 months ago
- Experimental model finder/SMT solver for functional programming.☆23Updated 2 years ago
- The MemCAD static analyzer☆25Updated 3 years ago
- An experimental programming language that combines effect handlers and implicit parameters☆20Updated this week
- Small tensor library a la GLSL☆17Updated 2 years ago
- An overview of property-based testing functionality☆54Updated 6 months ago
- An OCaml library providing a C parser and lexer☆40Updated 2 weeks ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Unofficial git mirror of the BER MetaOCaml patchset.☆64Updated last year
- OCaml syntax extension for synchronous programming...☆31Updated last year
- multi-shot continuations in OCaml☆46Updated last month
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Choice operator in OCaml, providing a backtracking monad☆24Updated 2 years ago
- Runtime assertion checking based on Gospel specifications☆38Updated last week
- Tool for suggesting lemma names in Coq verification projects☆18Updated 2 years ago
- ᚛ A type of divination employed in attempts to locate identifiers matching a given type expression☆33Updated 3 weeks ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 10 months ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated last week
- Formal Semantics for Why3☆14Updated this week
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- EGraphs in OCaml☆60Updated 10 months ago