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
  ☆68Updated last month
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 11 months ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆62Updated 7 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 9 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last month
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆125Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• lexa-lang / lexa
  ☆30Updated 5 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last month
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆47Updated 3 weeks ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated last year
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆123Updated 9 months ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆35Updated 4 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆90Updated last month
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 4 months ago
• boyland / sasylf
  Educational Proof Assistant for Type Theory
  ☆74Updated 7 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆50Updated 3 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated last month
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated this week
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago