Alternatives and similar repositories for quasi-quote:

Users that are interested in quasi-quote are comparing it to the libraries listed below

• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 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…
  ☆20Updated 3 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• nachivpn / k
  Meta-theory and normalization for Fitch-style modal lambda calculi
  ☆18Updated 9 months ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 7 months ago
• JacquesCarette / Notes
  ☆13Updated 4 months ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆17Updated 4 years ago
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆14Updated last year
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 2 months ago
• L-TChen / ModalTypeTheory
  ☆21Updated 3 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago
• Deducteam / Agda2Dedukti
  ☆18Updated 3 years ago
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated last year
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• logsem / mitten_preorder
  ☆29Updated last year
• flupe / generics
  ☆23Updated 8 months ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆21Updated 2 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 3 months ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year