singletons
Fake dependent types in Haskell using singletons (by goldfirere)
open-typerep
Open type representations and dynamic types (by emilaxelsson)
Our great sponsors
singletons | open-typerep | |
---|---|---|
2 | 1 | |
282 | 4 | |
- | - | |
6.3 | 0.0 | |
3 months ago | almost 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.
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.
singletons
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.
- Is it possible to create singleton types for datatype wrapping String/Text?
-
Hey Rustaceans! Got an easy question? Ask here (12/2021)!
In Haskell, you can do this with various trickery involving GADTs/constraints/singletons.
open-typerep
Posts with mentions or reviews of open-typerep.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-28.
What are some alternatives?
When comparing singletons and open-typerep you can also consider the following projects:
containers - Assorted concrete container types
Agda - Agda is a dependently typed programming language / interactive theorem prover.
helf - Haskell implementation of the Edinburgh Logical Framework
permutation - git import of patrick perry permutations lib from darcs
cubical - Implementation of Univalence in Cubical Sets
eliminators - Dependently typed elimination functions using singletons
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
agda-snippets - Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.
Sit - Prototypical type checker for Type Theory with Sized Natural Numbers