Alternatives and similar repositories for sml-compiler-utils:

Users that are interested in sml-compiler-utils are comparing it to the libraries listed below

• JohnReppy / sml-lsp-kit
  Standard ML Infrastructure for writing LSP servers
  ☆11Updated 4 months ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 4 months ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated last year
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated 4 months ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• dhil / ocaml-multicont
  multi-shot continuations in OCaml
  ☆48Updated last week
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• jonsterling / tt
  secret project
  ☆17Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• niccoloveltri / final-pfin
  ☆12Updated 3 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 2 months ago
• umazalakain / session-types-coq
  Formalising session types in Coq
  ☆17Updated 5 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago