Alternatives and similar repositories for autosubst-ocaml

Users that are interested in autosubst-ocaml are comparing it to the libraries listed below

• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• Beluga-lang / McTT
  A bottom-up approach to a verified implementation of MLTT
  ☆20Updated this week
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• yforster / coqtheorem
  A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.
  ☆16Updated 6 years ago
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 3 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆29Updated 3 months ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 6 months ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 4 months ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 9 months ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆13Updated last year
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 8 months ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• doctorn / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆18Updated 7 months ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago
• snu-sf / Ordinal
  ☆13Updated 2 months ago
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated 8 months ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 8 months ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• CoqHott / logrel-coq
  Logical Relation for MLTT in Coq
  ☆25Updated last week