Ptival / language-ocamlLinks
Language tools for manipulating OCaml programs in Haskell (parser, pretty-printer, ...)
☆14Updated 4 years ago
Alternatives and similar repositories for language-ocaml
Users that are interested in language-ocaml are comparing it to the libraries listed below
Sorting:
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Session types in Idris2!☆27Updated 5 years ago
- MixML prototype interpreter☆27Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- MetaML and MetaOCaml bibliography☆99Updated last year
- OCaml backend for Agda☆39Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆84Updated last year
- Collection of Idris snippets☆23Updated last month
- SubML (prototype) language☆22Updated 3 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 10 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- xmonad in Coq☆46Updated 13 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A prototype implementation of the Frank programming language☆17Updated 10 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A simple build system for Idris☆22Updated 4 years ago