Alternatives and similar repositories for frugel

Users that are interested in frugel are comparing it to the libraries listed below

• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆22Updated 2 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆61Updated this week
• joelburget / lvca
  language verification, construction, and analysis
  ☆20Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 6 months ago
• joom / dilim
  A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.
  ☆15Updated last year
• fplab / ui-for-pl
  User Interfaces for Programming Languages: The Compendium
  ☆28Updated 4 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• contificate / match
  Match compilation algorithm in OCaml
  ☆30Updated 7 months ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆17Updated last year
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• TyOverby / sdui
  A frontend for the 1111 stable diffusion API
  ☆17Updated 2 weeks ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• cyberglot / faeth
  algebraic typechecking and elaboration of type systems
  ☆13Updated 8 months ago
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 2 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• eashanhatti / konna
  ☆16Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆40Updated 4 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 6 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• lunarcast / lunarflow
  Lambda calculus go brrrr
  ☆30Updated 2 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• jkoppel / ecta
  ☆37Updated last year
• FrankBro / ordo
  Ordo: A minimalist language with row polymorphism
  ☆85Updated 5 months ago
• mb64 / prolog
  A simple prolog implementation in Rust
  ☆26Updated 4 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• hmac / kite
  A Haskell-like language for scripting and web apps
  ☆14Updated last year
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆27Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago