liam923 / remora
A dependently-typed, array-polymorphic language that runs on parallel architectures
☆18Updated 6 months ago
Alternatives and similar repositories for remora:
Users that are interested in remora are comparing it to the libraries listed below
- Runtime assertion checking based on Gospel specifications☆45Updated last week
- A simple parser combinator library for Ocaml☆30Updated 3 years ago
- A Framework for building Batched Concurrent Services☆21Updated 5 months ago
- A parsing library that compiles grammars to combinators using elimination of left recursion☆22Updated last year
- multi-shot continuations in OCaml☆48Updated last month
- Tools for record-and-replay debugging☆43Updated 2 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 5 years ago
- Playing with type systems☆50Updated 3 months ago
- A Rust to OCaml source to source translator☆21Updated last year
- Fωμ type checker and compiler☆52Updated 2 years ago
- 🩺 A library for compiler diagnostics☆39Updated last month
- Commodity thread pools and concurrency primitives for OCaml 5☆57Updated 2 weeks ago
- How do you do that recursive GADT thing again?☆27Updated last year
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Algebraic structures in OCaml.☆23Updated 3 weeks ago
- Experimental functional language☆17Updated 2 years ago
- A small library to output memory graph for ocaml values☆37Updated 9 months ago
- For Jar artifacts☆14Updated last month
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- OCaml plus Jane Street extensions☆74Updated 8 months ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Forging Standard ML (SML) in emacs☆10Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- 🦠 Reusable components based on algebraic effects☆49Updated 6 months ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 2 months ago