Alternatives and similar repositories for smyth

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

• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 3 months ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 7 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆126Updated 2 years ago
• lsrcz / grisette
  A monadic library for symbolic evaluation
  ☆66Updated 2 weeks ago
• plfa / plfl
  Programming Language Foundations in Lean
  ☆37Updated last month
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated 3 weeks ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 11 months ago
• lexa-lang / lexa
  ☆33Updated 7 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆94Updated 3 months ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆108Updated 10 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆30Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆114Updated this week
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated 2 years ago
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆44Updated 2 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆127Updated 11 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆73Updated last month