siraben / fp-notes

Related projects ⓘ

Alternatives and complementary repositories for fp-notes

• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 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
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆53Updated 6 months ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆66Updated last month
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆51Updated last year
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆30Updated 2 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• Innf107 / vega
  A dependently typed programming language with direct style effects and linearity
  ☆19Updated 3 months ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 2 years ago
• con-kitty / categorifier
  Interpret Haskell programs into any cartesian closed category.
  ☆57Updated last week
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆64Updated 3 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆32Updated last month
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆28Updated 11 months ago
• frizensami / haskell-optimization
  A beginner's guide to Haskell optimization
  ☆64Updated 6 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆27Updated 3 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆40Updated 3 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆15Updated 4 months ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆29Updated 11 months ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 4 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆57Updated 7 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆36Updated 3 years ago