Alternatives and similar repositories for opetopic:

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

• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆46Updated 5 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• ericfinster / catt
  Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories
  ☆14Updated 8 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 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
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 4 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• mikeshulman / cohesivett
  Cohesive type theory
  ☆19Updated 3 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• mietek / research
  Work in progress
  ☆34Updated 4 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• frelindb / agsyHOL
  ☆22Updated 8 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆91Updated 7 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last month
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆77Updated 11 years ago
• markokoleznik / agda-writer
  A simple GUI for Agda
  ☆31Updated 9 years ago
• RedPRL / sml-typed-abts
  second-order abstract syntax
  ☆31Updated 3 years ago