Alternatives and similar repositories for smlnj:

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

• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆47Updated 10 years ago
• camlp5 / camlp5
  Preprocessor / Pretty Printer for OCaml
  ☆75Updated last month
• rossberg / hamlet
  SML reference interpreter
  ☆112Updated last year
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆80Updated 4 years ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆34Updated 8 years ago
• SMLFamily / BasisLibrary
  Repository and Wiki for enriching the Standard ML Basis Library
  ☆61Updated 3 years ago
• standardml / cmlib
  A basic library of algorithms and data structures (a la NJlib)
  ☆74Updated last year
• CertiCoq / certicoq
  A Verified Compiler for Gallina, Written in Gallina
  ☆140Updated this week
• ats-lang / ATS-Postiats-release
  ATS2: Unleashing the Potentials of Types and Templates
  ☆41Updated 5 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆91Updated 2 weeks ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last year
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 4 months ago
• coq-community / reglang
  Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
  ☆41Updated 6 months ago
• imdea-software / htt
  Hoare Type Theory
  ☆70Updated last week
• standardml / twelf
  The Twelf Programming Language
  ☆117Updated last week
• kit-ty-kate / labrys
  A toy language based on LLVM that implements the System Fω type-system
  ☆106Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 2 months ago
• LPCIC / coq-elpi
  Coq plugin embedding elpi
  ☆142Updated this week
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆56Updated 8 months ago
• coq-community / semantics
  A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…
  ☆47Updated 3 years ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆72Updated last year
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 2 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆72Updated 2 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆141Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆56Updated 7 months ago
• camllight / camllight
  The Caml Light implementation of the Caml language
  ☆65Updated last year
• coq-community / graph-theory
  Graph Theory [maintainers=@chdoc,@damien-pous]
  ☆34Updated 2 months ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago