Alternatives and similar repositories for bonak

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

• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• ericfinster / catt.io
  Revised Omega-categorical Typechecker
  ☆27Updated 11 months ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆31Updated last year
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated 2 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 8 months ago
• jonsterling / project-pterosaur
  ☆45Updated 6 months ago
• Lysxia / coq-simple-io
  IO for Gallina
  ☆33Updated 3 months ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 6 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 2 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆22Updated 2 years ago
• thibautbenjamin / catt
  Coherence typechecker for infinity categories
  ☆20Updated 2 weeks ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆26Updated 2 months ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago