Alternatives and similar repositories for pl-thesaurus

Users that are interested in pl-thesaurus are comparing it to the libraries listed below

• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆132Updated 5 years ago
• ollef / rock
  Build system
  ☆126Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆167Updated this week
• 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
• joom / type.systems
  joke page until I decide what to do with this domain name
  ☆39Updated 2 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆142Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 8 years ago
• imdea-software / htt
  Hoare Type Theory
  ☆78Updated 3 months ago
• evertedsphere / shorshe
  freshly-fermented, dependently-typed mustard, with a substructural aftertaste
  ☆30Updated 5 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated 3 weeks ago
• lexa-lang / lexa
  ☆37Updated last month
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆150Updated last year
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆96Updated 3 months ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆90Updated 6 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆180Updated 4 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆265Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 3 months ago
• astampoulis / makam
  The Makam Metalanguage
  ☆199Updated 2 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆128Updated 2 years ago