elpinal / modules-rsLinks
An interpreter of F-ing modules
☆19Updated 6 years ago
Alternatives and similar repositories for modules-rs
Users that are interested in modules-rs are comparing it to the libraries listed below
Sorting:
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- A simple functional programming language.☆22Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- A simple implementation of linear type theory☆38Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- MixML prototype interpreter☆27Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- ☆40Updated last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- The Evolution of a Typechecker☆54Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- The Alms Programming Language☆44Updated 7 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Specification of Agda.☆25Updated 7 years ago
- First class patterns and pattern matching, using type families☆18Updated 5 years ago
- System F in coq.☆19Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- ☆52Updated 5 months ago