Alternatives and similar repositories for pi-dual:

Users that are interested in pi-dual are comparing it to the libraries listed below

• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 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
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last year
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 7 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• amblafont / unification
  Notes (and implementation) of unification with binders
  ☆14Updated last month
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆17Updated 4 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆20Updated this week
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated last week
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 5 months ago
• vikraman / 2DTypes
  Collaborative work on reversible computing
  ☆18Updated 2 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆14Updated 7 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 3 months ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• TOTBWF / agda-sgd
  Experiments in Synthetic Differential Geometry
  ☆16Updated 3 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago