elpinal / modules-rsLinks
An interpreter of F-ing modules
☆19Updated 5 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 simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Type systems written in 1ML☆9Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- Example row-polymorphism implementations☆61Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A simple functional programming language.☆21Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A pretty-printing combinator library for OCaml☆51Updated 9 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago