Alternatives and similar repositories for fp-notes:

Users that are interested in fp-notes are comparing it to the libraries listed below

• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• Lysxia / advent-of-coq-2021
  ☆40Updated 3 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated last month
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• Simspace / avaleryar
  A logical authorization system
  ☆50Updated 3 years ago
• Innf107 / vega
  A dependently typed programming language with direct style effects and linearity
  ☆19Updated 8 months ago
• cedille / ial
  The Iowa Agda Library
  ☆47Updated 3 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last month
• vmchale / dickinson
  Text generation language
  ☆33Updated last month
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 11 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last month
• lexi-lambda / monad-validate
  A Haskell monad transformer library for data validation
  ☆36Updated last year
• stefan-hoeck / idris2-dom
  Javascript DOM bindings for Idris2
  ☆51Updated 9 months ago
• argumentcomputer / Megaparsec.lean
  Lean 4 port of Megaparsec
  ☆25Updated last year
• ekmett / placeholder
  todo and unimplemented, robustly implemented
  ☆33Updated 6 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆29Updated last year
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 9 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 5 months ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆28Updated 2 years ago