Alternatives and similar repositories for popl19-tutorial

Users that are interested in popl19-tutorial are comparing it to the libraries listed below

• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 6 months ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated last year
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated 2 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 2 weeks ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 6 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 4 months ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 6 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 last month
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 8 months ago
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆14Updated last year
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 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…
  ☆20Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆27Updated 10 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 5 months ago
• gallais / agda-presburger
  Deciding Presburger arithmetic in agda
  ☆33Updated 2 years ago
• pi8027 / efficient-finfun
  ☆13Updated 6 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated last year
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• YouyouCong / type-preserving-cps
  Type-preserving CPS translation for simply- and dependently-typed lambda calculi
  ☆19Updated 8 years ago