Alternatives and similar repositories for WangsAlgorithm

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

• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 10 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• dalaing / type-systems
  ☆23Updated 8 years ago
• jwiegley / linearscan
  ☆17Updated 3 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• yav / presburger
  Decision procedures for Presburger arithmetic in Haskell
  ☆30Updated 6 months ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 6 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 5 months ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆27Updated 9 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• yveszhang / ldtyping
  ☆12Updated 9 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 8 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago