Alternatives and similar repositories for yas

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

• hazelgrove / HZ
  Simple reference implementation of Hazelnut using js_of_ocaml and OCaml React. (frozen -- ongoing development in the hazel repo)
  ☆29Updated 7 years ago
• osa1 / MANTI
  A pure subset of Prolog, implemented in Haskell
  ☆31Updated 11 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year
• halfaya / BayHac
  ☆11Updated 7 years ago
• LaifsV1 / YUP
  YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…
  ☆36Updated 2 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• ilya-klyuchnikov / henk
  Pure Type Systems for Functional Programming
  ☆31Updated 4 years ago
• slindley / effect-handlers
  ☆82Updated last year
• mietek / et-lang
  ET (IPL) language interpreters and literature
  ☆26Updated 6 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• gallais / agdARGS
  Dealing with Flags and Options
  ☆13Updated 3 years ago
• YouyouCong / type-preserving-cps
  Type-preserving CPS translation for simply- and dependently-typed lambda calculi
  ☆19Updated 8 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• pdarragh / parsing-with-zippers-paper-artifact
  The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
  ☆28Updated last year
• bitonic / tog
  ☆26Updated 8 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
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• pigworker / shonky
  being some experiments, working towards some equipment I wish I had
  ☆37Updated 9 years ago
• neel-krishnaswami / adjs
  Higher-order FRP compiler
  ☆15Updated 3 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• cgswords / texsem
  A template set for writing semantics in LaTeX
  ☆12Updated 9 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 7 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago