Alternatives and similar repositories for B629-denotational:

Users that are interested in B629-denotational are comparing it to the libraries listed below

• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 3 months ago
• plum-umd / abstracting-definitional-interpreters
  Abstracting Definitional Interpreters
  ☆68Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• OPLSS / oplss-notes-2018
  Notes and handouts from OPLSS 2018
  ☆55Updated 6 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆33Updated 8 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆76Updated 6 years ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated 5 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 4 years ago
• plclub / cis670-16fa
  Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016
  ☆42Updated 2 years 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.
  ☆81Updated 3 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆31Updated 6 months ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆82Updated 8 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• AndrasKovacs / SemanticsWithApplications
  Formal semantics in Agda.
  ☆16Updated 9 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 7 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated this week
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago