elpinal / modulesLinks
Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
☆31Updated 2 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☆19Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 7 months ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Coq library for handling names☆19Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- OCaml backend for Agda☆39Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- MetaML and MetaOCaml bibliography☆95Updated 11 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
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- flexible 'let rec' generation for MetaOCaml☆27Updated 2 months ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 3 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- Simplified Observational Type Theory☆85Updated 2 years ago