Alternatives and similar repositories for cs1113f16

Users that are interested in cs1113f16 are comparing it to the libraries listed below

• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• dlicata335 / hott-agda
  ☆84Updated 8 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 7 years ago
• Coq-Math-Problems / Problems
  ☆16Updated 8 years ago
• andrejbauer / what-is-algebraic-about-algebraic-effects
  ☆47Updated 6 years ago
• mietek / research
  Work in progress
  ☆38Updated 5 months ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 8 months ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• zaklogician / linear-constructive
  Linear Logic for Constructive Mathematics, in Agda
  ☆17Updated 6 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆56Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆34Updated 8 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 2 months ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 8 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 8 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆57Updated last year
• OPLSS / oplss-notes-2018
  Notes and handouts from OPLSS 2018
  ☆55Updated 7 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆73Updated 6 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆46Updated 11 months ago
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆71Updated 4 years ago
• yveszhang / ldtyping
  ☆12Updated 9 years ago
• abooij / wiwikwlhott
  What I wish I knew when learning HoTT
  ☆53Updated 6 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago