Alternatives and similar repositories for fp-notes:

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

• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆48Updated 3 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated 2 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆59Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• Lysxia / advent-of-coq-2021
  ☆43Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated last month
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• luc-tielen / llvm-codegen
  LLVM code generation in Haskell
  ☆54Updated 6 months ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• frex-project / idris-frex
  ☆47Updated 5 months ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• Simspace / avaleryar
  A logical authorization system
  ☆50Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆29Updated last year
• cronokirby / haskell-in-haskell
  Trying to write an understandable implementation of Haskell, in Haskell
  ☆125Updated 4 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated last month
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆30Updated 3 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆28Updated this week
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆56Updated last year
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• vmchale / dickinson
  Text generation language
  ☆33Updated last week
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆29Updated 4 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago