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
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆14Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• 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
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• vikraman / 2DTypes
  Collaborative work on reversible computing
  ☆18Updated 3 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• andrejbauer / faux-type-theory
  ☆41Updated last month
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 2 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 6 months ago
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆70Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 2 weeks ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆48Updated 4 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆31Updated last year