Alternatives and similar repositories for sasylf

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

• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆96Updated 4 months ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆59Updated last week
• tchajed / iris-simp-lang
  We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …
  ☆55Updated 2 months ago
• rocq-community / reglang
  Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
  ☆45Updated 4 months ago
• leanprover / tc
  Reference type checker for the Lean theorem prover
  ☆62Updated 8 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆81Updated 5 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆76Updated 3 weeks ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 7 months ago
• lsrcz / grisette
  A monadic library for symbolic evaluation
  ☆69Updated 2 months ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆74Updated last month
• rocq-archive / coq-in-coq
  A formalisation of the Calculus of Constructions
  ☆70Updated last year
• rocq-community / coqeal
  The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
  ☆72Updated last week
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆66Updated last week
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 5 months ago
• plclub / hs-to-coq
  Convert Haskell source code to Coq source code.
  ☆87Updated 2 months ago
• lexa-lang / lexa
  ☆37Updated last month
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆62Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆35Updated 7 years ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆36Updated 5 years ago
• verse-lab / ego
  EGraphs in OCaml
  ☆73Updated last year
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 3 weeks ago
• Mtac2 / Mtac2
  ☆55Updated 5 months ago
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 7 months ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆75Updated 5 months ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 12 years ago
• mtt-lang / mtt-lang
  A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web
  ☆45Updated 3 years ago