L-TChen / MtacAR

Related projects: ⓘ

• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 5 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 4 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆28Updated 3 years ago
• UlfNorell / agda-bench
  Benchmarking tool for compile-time performance of Agda programs
  ☆18Updated 2 years ago
• flupe / generics
  ☆21Updated 2 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆26Updated 5 months ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 5 months ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• jespercockx / agda2scheme
  Compiler backend for generating Scheme code
  ☆25Updated 9 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆33Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• laMudri / quantitative
  ☆16Updated 2 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated 10 months ago
• Deducteam / Agda2Dedukti
  ☆16Updated 2 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆35Updated last year
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆21Updated 4 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆14Updated 9 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• logsem / mitten_preorder
  ☆26Updated last year
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 4 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 9 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆13Updated 6 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 5 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆16Updated 3 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago