Alternatives and similar repositories for fp-notes

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

• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 4 months ago
• Simspace / avaleryar
  A logical authorization system
  ☆51Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated 2 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• lexi-lambda / monad-validate
  A Haskell monad transformer library for data validation
  ☆36Updated last year
• sfultong / stand-in-language
  a simple total pure functional language, eventually to have powerful static checking and optimization
  ☆33Updated 3 weeks ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated last month
• mstksg / mutable
  Automatic piecewise-mutable references for your types
  ☆42Updated 4 years ago
• cedille / ial
  The Iowa Agda Library
  ☆48Updated this week
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• Innf107 / vega-prototype
  Prototype for https://github.com/Innf107/vega
  ☆19Updated 11 months ago
• frizensami / haskell-optimization
  A beginner's guide to Haskell optimization
  ☆64Updated 7 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated 4 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• gelisam / hyzzy
  A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.
  ☆32Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• stefan-hoeck / idris2-dom
  Javascript DOM bindings for Idris2
  ☆52Updated last year
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆31Updated last year
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆30Updated 4 months ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆30Updated 2 years ago
• ziman / idris-data-frame
  Data frames for Idris 2
  ☆22Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 2 months ago