Alternatives and similar repositories for dickinson

Users that are interested in dickinson are comparing it to the libraries listed below

• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• frex-project / idris-frex
  ☆47Updated 3 weeks ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• mstksg / mutable
  Automatic piecewise-mutable references for your types
  ☆42Updated 4 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆31Updated last year
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆29Updated 5 years ago
• tweag / kernmantle
  Braiding extensible effects together in a pipeline/workflow of tasks
  ☆60Updated last year
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• conal / talk-2020-calculating-compilers-categorically
  A talk
  ☆28Updated 4 years ago
• travitch / haggle
  An efficient graph library for Haskell
  ☆39Updated 3 weeks ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• ziman / idris-data-frame
  Data frames for Idris 2
  ☆22Updated 2 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆24Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated last month
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• bolt12 / laop
  Linear Algebra of Programming - Algebraic Matrices in Haskell
  ☆84Updated last month
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆66Updated 4 months ago
• umazalakain / agda-bcam
  Tutorial series introducing Agda to the people at BCAM
  ☆26Updated 3 years ago
• obsidiansystems / dependent-sum
  Dependent sums and supporting typeclasses for comparing and displaying them
  ☆56Updated last year
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆35Updated 3 years ago
• cedille / ial
  The Iowa Agda Library
  ☆48Updated this week
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 9 months ago
• xgrommx / agda-ecosystem
  ☆30Updated 7 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆32Updated 3 months ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated 2 years ago