Alternatives and similar repositories for superf

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

• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• 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
  ☆14Updated last year
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 8 months ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆32Updated 2 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 8 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 weeks ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆33Updated last week
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated last week
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆23Updated 8 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 9 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• andrejbauer / faux-type-theory
  ☆46Updated 3 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago