hazelgrove / diy-hazelnutLinks
A template for you to implement Hazelnut yourself
☆22Updated 2 weeks ago
Alternatives and similar repositories for diy-hazelnut
Users that are interested in diy-hazelnut are comparing it to the libraries listed below
Sorting:
- Playing with type systems☆51Updated 7 months ago
- An error-tolerant live programming environment (my Master's thesis)☆19Updated 3 years ago
- A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.☆15Updated last year
- A pretty-printing combinator library for OCaml☆51Updated 11 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆54Updated 5 months ago
- Fast, CommonMark-compliant Markdown parser written in Racket☆32Updated 9 months ago
- Kempe is a compiled stack-based language☆58Updated 10 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- A TOML parser for Idris 2☆17Updated last year
- A formalization of System Fω in Agda☆17Updated 5 months ago
- algebraic typechecking and elaboration of type systems☆13Updated 6 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- An implementation of "A Pretty Expressive Printer" in Racket☆28Updated last year
- User Interfaces for Programming Languages: The Compendium☆28Updated 4 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- 🩺 A library for compiler diagnostics☆47Updated 5 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- ☆36Updated last year
- 🦠 Reusable components based on algebraic effects☆51Updated 10 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Anders: Cubical Type Checker☆23Updated last year
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 6 months ago
- An implementation of Haskell’s MVars in Racket☆29Updated 9 months ago
- Quick explanation of eliminating left recursion in Haskell parsers☆51Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year