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
  ☆77Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆55Updated 8 months ago
• Innf107 / vega
  A dependently typed programming language with direct style effects and linearity
  ☆19Updated 5 months ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆38Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last year
• Lysxia / advent-of-coq-2021
  ☆40Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆36Updated 4 years ago
• favonia / hdtt2020-notes
  ☆35Updated 3 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• eayus / sirdi
  Package manager for Idris
  ☆35Updated 2 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• stefan-hoeck / idris2-dom
  Javascript DOM bindings for Idris2
  ☆51Updated 7 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆32Updated this week
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆81Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆64Updated last month
• cronokirby / haskell-in-haskell
  Trying to write an understandable implementation of Haskell, in Haskell
  ☆120Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 3 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆28Updated last year
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆57Updated last year
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆49Updated last year
• vmchale / dickinson
  Text generation language
  ☆33Updated 2 weeks ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆45Updated 3 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆56Updated 7 months ago