Alternatives and similar repositories for pfp-e2020-pub

Users that are interested in pfp-e2020-pub are comparing it to the libraries listed below

• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 5 months ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆88Updated this week
• pamellies / lambda-calculus-and-categories
  A repository for the material of my course on lambda-calculus and categories
  ☆43Updated 4 years ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆31Updated last year
• lsrcz / grisette
  A monadic library for symbolic evaluation
  ☆71Updated 3 months ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated last week
• jtkristensen / Jeopardy
  The official interpreter for the Jeopardy language
  ☆16Updated 2 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆43Updated 5 years ago
• frex-project / idris-frex
  ☆50Updated 2 months ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• T-Brick / molasses
  MLB support for CM (the SML/NJ Compilation and Library Manager)
  ☆18Updated 5 months ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 3 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆28Updated this week
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated last month
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated last year
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 5 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆58Updated 3 weeks ago
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated 2 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 7 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 3 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 weeks ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆84Updated 4 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆50Updated last year