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 this week
• ehatti / LHL
  Linearizability Hoare Logic
  ☆13Updated last month
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• FStarLang / pulse
  The Pulse separation logic DSL for F*
  ☆16Updated last week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 3 weeks ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 2 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆46Updated 5 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 4 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 7 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
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated last year
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆13Updated 8 months ago
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆23Updated last week
• 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
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆29Updated 8 months ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated 6 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆35Updated this week
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆43Updated 2 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago