Alternatives and similar repositories for subtyping-agda:

Users that are interested in subtyping-agda are comparing it to the libraries listed below

• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 2 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• JacquesCarette / Notes
  ☆13Updated 4 months ago
• kckennylau / mathlib4
  Unofficial repository for the experimental porting of mathlib into lean4
  ☆10Updated 4 years ago
• elpinal / focused-modules
  A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
  ☆10Updated 4 years ago
• andrejbauer / partial-combinatory-algebras
  A Lean 4 formalization of partial combinatory algebras.
  ☆13Updated 2 months ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated 5 months 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
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• gelisam / typechecker-combinators
  ☆17Updated 11 months ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated last month
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 3 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated last year
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 3 months ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• TOTBWF / teenytt
  A Teeny Type Theory
  ☆26Updated 2 years ago
• edwinb / SchemeEval
  Experimental normalisation via scheme
  ☆12Updated 3 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• wenkokke / chez-scheme-hs
  Haskell bindings to Chez Scheme
  ☆10Updated last year
• jonsterling / coq-domains
  ☆18Updated 2 years ago