Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
☆31Feb 5, 2023Updated 3 years ago
Alternatives and similar repositories for modules
Users that are interested in modules are comparing it to the libraries listed below
Sorting:
- An interpreter of F-ing modules☆19Jun 21, 2019Updated 6 years ago
- A statically-typed programming language based on "F-ing modules"☆81Jul 25, 2020Updated 5 years ago
- MixML prototype interpreter☆27Dec 13, 2019Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- ☆10May 3, 2017Updated 8 years ago
- 1ML prototype interpreter☆292Jun 28, 2020Updated 5 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- Work on modular implicits☆25Oct 23, 2018Updated 7 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- A prototype programming language for programming with runners☆92Aug 20, 2021Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- An experimental Haskell library for programming with effectful runners.☆30Dec 6, 2019Updated 6 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- A derivation explorer and logger for menhir parser☆23Dec 13, 2025Updated 2 months ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Coq library for handling names☆19Aug 5, 2022Updated 3 years ago
- Fωμ type checker and compiler☆56Jan 28, 2023Updated 3 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- Unicode text segmentation for OCaml☆25Feb 13, 2026Updated 2 weeks ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Jun 16, 2024Updated last year