Alternatives and similar repositories for oplss-notes-2018

Users that are interested in oplss-notes-2018 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
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆76Updated 3 weeks ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆96Updated 3 months ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆114Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated 2 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆75Updated 3 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆72Updated 6 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆49Updated 11 months ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆75Updated 5 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆83Updated 5 years ago
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆72Updated 4 years ago
• plclub / cis670-16fa
  Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016
  ☆42Updated 2 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 8 months ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆32Updated 10 months ago
• xgrommx / agda-ecosystem
  ☆32Updated 7 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year