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
  ☆98Updated 3 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆166Updated 2 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• ollef / rock
  Build system
  ☆124Updated last year
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 6 months ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 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.
  ☆82Updated 3 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 8 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated last week
• joom / type.systems
  joke page until I decide what to do with this domain name
  ☆38Updated last month
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆142Updated 6 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 3 weeks ago
• jdreaver / amy
  Strict Haskell-like programming language that compiles to LLVM
  ☆70Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆114Updated 5 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆199Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆265Updated 11 months ago
• 0xd34df00d / refinedt
  Refinement types + dependent types = ❤️
  ☆59Updated 3 years ago
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆148Updated last year
• idris-community / inigo
  Inigo: A Package Manager for Idris2
  ☆62Updated 2 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year