metaocaml / metaocaml-opamLinks
A repository of MetaOCaml packages
☆12Updated 2 weeks ago
Alternatives and similar repositories for metaocaml-opam
Users that are interested in metaocaml-opam are comparing it to the libraries listed below
Sorting:
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 weeks ago
- IO using sized types and copatterns☆35Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- ☆18Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- ☆17Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆12Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- ModTT in Agda☆11Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experimental functional language☆17Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- 🔙 Backward lists for OCaml☆22Updated 8 months ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- multi-shot continuations in OCaml☆48Updated 3 months ago