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
• Simspace / avaleryar
  A logical authorization system
  ☆50Updated 3 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated last month
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 2 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated last week
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆29Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated 11 months ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆28Updated 2 weeks ago
• Lysxia / bluefin-algae
  Algebraic effects in the Bluefin effect system
  ☆16Updated 11 months ago
• maybetonyfu / chameleon
  A tool to make solving type errors in Haskell simple and fun.
  ☆36Updated 2 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• transient-haskell / transient-stack
  All the Transient libraries
  ☆40Updated last week
• ollef / rock
  Build system
  ☆123Updated last year
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• Lysxia / advent-of-coq-2021
  ☆43Updated 3 years ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆28Updated 2 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆59Updated 3 years ago
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆30Updated 2 months ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated last year