Alternatives and similar repositories for TeX

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

• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 11 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• meta-logic / lltp
  TPTP linear logic version
  ☆15Updated 9 months ago
• c-cube / choice
  Choice operator in OCaml, providing a backtracking monad
  ☆26Updated 3 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆12Updated 3 years ago
• standardml / parcom
  SML Parser Combinator Library
  ☆28Updated 9 years ago
• LPCIC / matita
  Matita (proof assistant) with embedded elpi
  ☆14Updated 7 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• JacquesCarette / TheoriesAndDataStructures
  Showing how some simple mathematical theories naturally give rise to some common data-structures
  ☆39Updated last year
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 5 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆49Updated 11 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• neel-krishnaswami / adjs
  Higher-order FRP compiler
  ☆15Updated 4 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• zinid / delimcc
  Delimited continuations in byte-code and native OCaml
  ☆27Updated 4 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆20Updated 5 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 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
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago