Alternatives and similar repositories for pl-thesaurus

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

• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆100Updated 3 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• ollef / rock
  Build system
  ☆131Updated 2 weeks ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆133Updated 5 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆172Updated 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 4 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆66Updated 8 years ago
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆150Updated last month
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 8 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 8 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆58Updated 2 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated last month
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 2 weeks ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆112Updated 3 months ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆143Updated 6 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• evertedsphere / shorshe
  freshly-fermented, dependently-typed mustard, with a substructural aftertaste
  ☆30Updated 5 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆183Updated 6 months ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• lexa-lang / lexa
  ☆39Updated 3 months ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆55Updated 4 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆81Updated 8 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year