yallop / metaocaml-letrecLinks
flexible 'let rec' generation for MetaOCaml
☆28Updated last week
Alternatives and similar repositories for metaocaml-letrec
Users that are interested in metaocaml-letrec are comparing it to the libraries listed below
Sorting:
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- multi-shot continuations in OCaml☆51Updated 2 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- A Datalog implementation with an OCaml inspired module system☆42Updated 7 years ago
- Tactic for polynomial manipulations☆12Updated 8 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- 🔙 Backward lists for OCaml☆22Updated 2 months ago
- A Coq plugin that implements exceptions in Coq☆13Updated 5 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated this week
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Unofficial git mirror of the BER MetaOCaml patchset.☆69Updated 8 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 9 months ago
- Formalising session types in Coq☆17Updated 6 years ago
- Example Coq plugin☆18Updated 7 years ago
- ☆11Updated 3 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14Updated 8 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Lenses in Coq☆17Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- ☆19Updated 2 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago