Alternatives and similar repositories for minihm

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

• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 9 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 3 months ago
• balint99 / sfpl
  A simple functional programming language.
  ☆21Updated 4 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆35Updated 6 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆46Updated 4 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated last week
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 4 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 4 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• lpw25 / shifted-names
  Coq library for handling names
  ☆19Updated 2 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 4 months ago
• ajrouvoet / ternary.agda
  An Agda library for programming with ternary relations
  ☆17Updated 2 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆50Updated 6 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago