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
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆14Updated last year
• dunhamsteve / newt
  A toy dependent typed language.
  ☆35Updated last week
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆69Updated 6 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆59Updated last year
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last week
• exaexa / minihm
  toy implementation of Hindley-Milner type system that prints out inference steps
  ☆17Updated 2 months ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 2 months ago
• vikraman / 2DTypes
  Collaborative work on reversible computing
  ☆18Updated 3 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• 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 9 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 3 weeks ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• andrejbauer / faux-type-theory
  ☆46Updated 3 months ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 5 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year