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
  ☆21Updated 3 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 3 months ago
• yforster / coqtheorem
  A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.
  ☆15Updated 5 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 5 months ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆28Updated 2 months ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆13Updated last year
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• L-TChen / ModalTypeTheory
  ☆21Updated 3 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• doctorn / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated 11 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated last week
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 3 years ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 12 years ago
• Beluga-lang / McTT
  A bottom-up approach to a verified implementation of MLTT
  ☆18Updated 2 months ago
• lpw25 / shifted-names
  Coq library for handling names
  ☆19Updated 2 years ago
• math-comp / mczify
  Micromega tactics for Mathematical Components
  ☆25Updated 5 months ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆33Updated 3 years ago