Alternatives and similar repositories for BayHac

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

• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated last month
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 9 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆26Updated 10 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆24Updated 5 months ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago
• mietek / research
  Work in progress
  ☆37Updated 2 weeks ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆18Updated 9 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• jonsterling / lcf-sequent-calculus-example
  A self-contained implementation of forward and backward inference for intuitionistic propositional logic
  ☆18Updated 7 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆34Updated 8 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 3 months ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆50Updated 6 months ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 3 months ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• gallais / type-scope-semantics
  A self-contained repository for the paper Type and Scope Preserving Semantics
  ☆23Updated 6 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year