Alternatives and similar repositories for superf

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

• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated 3 weeks ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 2 weeks ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• gelisam / typechecker-combinators
  ☆17Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 7 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 3 years ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆45Updated 3 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆26Updated 2 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 2 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 3 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆20Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• bobatkey / agda-metric-reals
  ☆29Updated 2 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 4 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆29Updated 8 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆32Updated 2 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated last month
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated last year
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆24Updated last month
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• ajrouvoet / ternary.agda
  An Agda library for programming with ternary relations
  ☆17Updated last month