Using dependent types to write proofs in Haskell

This page summarizes the projects mentioned and recommended in the original post on /r/haskell

InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
  • really-small-backpack-example

    A really small example of the Backpack module system for Haskell

  • Anyway, an alternative to RULES that I've explored is to put the proofs behind a module signature and compile to versions of the program, one with "real" proofs and another with unsafeCoerced ones. This avoids the danger of the RULEs silently ceasing to apply because of name changes (don't know how common is that danger in practice though).

  • InfluxDB

    Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

    InfluxDB logo
NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts

  • Haskell is the greatest programming language of all time

    7 projects | /r/haskell | 2 Nov 2022
  • Implied bounds and perfect derive

    3 projects | /r/rust | 12 Apr 2022
  • Polymorphic unpacking through backpack?

    2 projects | /r/haskell | 22 Oct 2021
  • Video Tutorial: "Using proofs to make functions faster over length-indexed vectors" (Richard Eisenberg)

    1 project | /r/haskell | 13 May 2021
  • Proposal for parametric modules like Coq's?

    2 projects | /r/haskell | 12 Feb 2021