elpinal / bright-mlLinks
A statically-typed programming language based on "F-ing modules"
☆81Updated 5 years ago
Alternatives and similar repositories for bright-ml
Users that are interested in bright-ml are comparing it to the libraries listed below
Sorting:
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 7 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- SML reference interpreter☆120Updated 2 months ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 7 years ago
- ML Basis for Poly/ML☆11Updated 2 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Signature documentation tool for Standard ML☆14Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- MetaML and MetaOCaml bibliography☆97Updated last year
- Nanopass for OCaml☆149Updated 7 years ago
- A modular sat/smt solver with proof output.☆101Updated last year
- an implementation of stuck macros☆149Updated 2 weeks ago
- The Caml Light implementation of the Caml language☆68Updated 2 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- A toy language based on LLVM that implements the System Fω type-system☆113Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆64Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Efficient binder representation in OCaml☆43Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- a functional programming language with algebraic effects and handlers☆82Updated 10 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Web server infrastructure for Standard ML☆15Updated 2 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 6 months ago