Alternatives and similar repositories for sfpl:

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

• forked-from-1kasper / anders
  Anders: Cubical Type Checker
  ☆22Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• TOTBWF / teenytt
  A Teeny Type Theory
  ☆26Updated 2 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆34Updated last year
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆21Updated 5 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• frex-project / idris-frex
  ☆47Updated 2 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆49Updated 2 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 2 months ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated last week
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 3 years ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆18Updated 5 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 5 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 4 months ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆18Updated last year
• karroffel / Idris2-Ocaml
  OCaml backend for Idris2
  ☆19Updated 4 years ago
• Z-snails / Idris2-Grin
  GRIN backend for Idris2
  ☆33Updated 2 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago