yallop / metaocaml-letrec
flexible 'let rec' generation for MetaOCaml
☆26Updated last year
Alternatives and similar repositories for metaocaml-letrec:
Users that are interested in metaocaml-letrec are comparing it to the libraries listed below
- A repository of MetaOCaml packages☆12Updated last year
- 👹 A library for hierarchical names and lexical scoping☆25Updated 7 months ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated last month
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆12Updated 5 years ago
- multi-shot continuations in OCaml☆48Updated 2 months ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- 🩺 A library for compiler diagnostics☆44Updated 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last year
- Experimental functional language☆17Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years 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 Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 weeks ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- ᚛ A type of divination employed in attempts to locate identifiers matching a given type expression☆34Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Tactic for polynomial manipulations☆10Updated last year
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- SubML (prototype) language☆23Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 7 months ago
- secret project☆17Updated 7 years ago