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 last week
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• Lysxia / advent-of-coq-2021
  ☆40Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last week
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 3 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆82Updated 9 months ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 2 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• thery / hanoi
  Hanoi tower in Coq
  ☆24Updated 2 months ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆29Updated last year
• con-kitty / categorifier
  Interpret Haskell programs into any cartesian closed category.
  ☆58Updated last month
• mstksg / mutable
  Automatic piecewise-mutable references for your types
  ☆42Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆44Updated 3 months ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 4 months ago
• e-wrks / edh
  Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++
  ☆28Updated 8 months ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated last week
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆66Updated this week
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆36Updated 4 years ago