Alternatives and similar repositories for adjs:

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

• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 9 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated last month
• 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 6 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆30Updated last year
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 7 years ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 8 years ago
• pedagand / MPRI-2.4-DTP
  MPRI-2.4 Dependently-typed Functional Programming
  ☆32Updated 4 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 3 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• JohnReppy / sml-compiler-utils
  A collection of SML utility modules that are useful for compiler writing.
  ☆11Updated 3 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 9 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆11Updated 5 years ago