singletons VS representable-functors

Compare singletons vs representable-functors and see what are their differences.


Fake dependent types in Haskell using singletons (by goldfirere)


representable functors (by ekmett)
Our great sponsors
  • Scout APM - Less time debugging, more time building
  • SonarLint - Deliver Cleaner and Safer Code - Right in Your IDE of Choice!
  • SaaSHub - Software Alternatives and Reviews
singletons representable-functors
1 0
260 9
- -
5.8 0.0
4 days ago over 8 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.


Posts with mentions or reviews of singletons. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-03-22.


Posts with mentions or reviews of representable-functors. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning representable-functors yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing singletons and representable-functors you can also consider the following projects:

containers - Assorted concrete container types

Sit - Prototypical type checker for Type Theory with Sized Natural Numbers

permutation - git import of patrick perry permutations lib from darcs

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

miso - :ramen: A tasty Haskell front-end framework

open-typerep - Open type representations and dynamic types

hoq - A language based on homotopy type theory with an interval

helf - Haskell implementation of the Edinburgh Logical Framework

graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface

Agda - Agda is a dependently typed programming language / interactive theorem prover.

cubical - Implementation of Univalence in Cubical Sets

fgl - A Functional Graph Library for Haskell