Hans-Halverson / myte
Compiler and tooling for the Myte programming language.
☆21Updated last year
Alternatives and similar repositories for myte:
Users that are interested in myte are comparing it to the libraries listed below
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆89Updated 6 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆60Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Standard ML Parser Combinator Library☆15Updated 5 months ago
- A simple functional programming language.☆21Updated 3 years ago
- Tina, a programming language with typed algebraic effects and handlers.☆13Updated 3 years ago
- ☆30Updated 4 months ago
- 🩺 A library for compiler diagnostics☆38Updated 2 weeks ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Demo for dependent types + runtime code generation☆66Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A core language and API for dependently typed languages☆89Updated this week
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A toy language based on LLVM that implements the System Fω type-system☆107Updated last year
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- A toy dependent typed language.☆28Updated this week
- Match compilation algorithm in OCaml☆23Updated last year
- ☆15Updated 8 years ago
- Call Futhark programs from Standard ML☆10Updated 5 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 9 months ago
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- Algebraic structures in OCaml.☆24Updated last week
- Dromedary is an experimental subset of OCaml, using constraint-based type inference!☆48Updated 3 months ago
- The Caml Light implementation of the Caml language☆65Updated last year
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- A verified compiler for a lazy functional language☆34Updated last week
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆63Updated last year