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
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆58Updated 2 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 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.
  ☆32Updated this week
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 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.
  ☆22Updated 8 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 2 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 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
• vikraman / 2DTypes
  Collaborative work on reversible computing
  ☆18Updated 3 years ago
• pa-ba / reg-machine
  Coq & Haskell code for Calculating Correct Compilers II
  ☆12Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 8 months ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆69Updated 6 years ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 7 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 4 months ago