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
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated 2 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated last year
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated 2 weeks ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated 2 years ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆21Updated 8 months ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆29Updated last week
• yforster / coqtheorem
  A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.
  ☆21Updated 6 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 years ago
• decrn / tilogics
  Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.
  ☆11Updated last year
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated 2 years ago
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 4 years ago
• cofibrant / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• proofengineering / proofengineering-bib
  BibTeX bibliographies for proof engineering-related papers
  ☆30Updated 6 years ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• arthuraa / extructures
  Finite sets and maps for Coq with extensional equality
  ☆30Updated 3 weeks ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• nachivpn / k
  Meta-theory and normalization for Fitch-style modal lambda calculi
  ☆19Updated last year
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆15Updated last year
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆55Updated 2 months ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆24Updated 6 years ago
• AndrasKovacs / polynomial-model
  A polynomial model of a Martin-Löf type theory + a bit of game semantics
  ☆32Updated 4 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 last month