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
• 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
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 4 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• gelisam / typechecker-combinators
  ☆17Updated 11 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• AndrasKovacs / misc-stuff
  Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.
  ☆19Updated 2 years ago
• mvr / tiny
  A type theory for tiny objects
  ☆10Updated last year
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆13Updated 7 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 6 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 3 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆30Updated 3 weeks ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• nomeata / lean-wf-induct
  ☆17Updated last year
• JacquesCarette / Notes
  ☆13Updated 4 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• plclub / cbpv-effects-coeffects
  Formalization of CBPV extended with effect and coeffect tracking
  ☆12Updated 6 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 2 years ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆21Updated 2 years ago