Deducteam / Agda2Dedukti

Related projects: ⓘ

• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 6 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• flupe / generics
  ☆21Updated 2 months ago
• logsem / mitten_preorder
  ☆26Updated last year
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 5 months ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated last year
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated 7 months ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆16Updated 3 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 3 years ago
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated 10 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 5 years ago
• laMudri / quantitative
  ☆16Updated 2 years ago
• doctorn / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated 4 months ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 4 years ago
• maxsnew / grammars-and-semantic-actions
  Monoidal Toposes of Grammars and Semantic Actions
  ☆16Updated this week
• bobatkey / agda-metric-reals
  ☆28Updated 2 years ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆16Updated 3 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆26Updated 5 months ago
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆13Updated last year
• amblafont / unification
  Notes (and implementation) of unification with binders
  ☆14Updated this week
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆32Updated 2 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆19Updated 2 years ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆19Updated 2 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆21Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago