Alternatives and similar repositories for f-omega-mu

Users that are interested in f-omega-mu are comparing it to the libraries listed below

• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆47Updated 5 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 5 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 10 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆59Updated 3 weeks ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆94Updated 8 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 5 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 10 months ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆31Updated this week
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated last month