TypeCompose VS tie-knot

Compare TypeCompose vs tie-knot and see what are their differences.

TypeCompose

Type composition classes & instances & misc (by conal)

tie-knot

"Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values. (by ppetr)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
TypeCompose tie-knot
1 -
9 4
- -
0.0 0.0
about 2 years ago over 11 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License LicenseRef-LGPL
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.

TypeCompose

Posts with mentions or reviews of TypeCompose. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-30.
  • Building not-gloss package
    6 projects | /r/haskell | 30 Dec 2022
    For reference, this conversation with Conal Elliott is relevant in that it explains why we're dropping TypeCompose.

tie-knot

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

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

What are some alternatives?

When comparing TypeCompose and tie-knot you can also consider the following projects:

Aoide - A simple music library with the capability of generating .ly and .mid files.

multiset - multiset haskell package

invertible - Haskell bidirectional arrows, bijective functions, and invariant functors

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

composition-tree - Composition trees for arbitrary monoids.

bookkeeper

composition-extra - Combinators for unorthodox structure composition in Haskell

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

composition - Combinators for unorthodox function composition in Haskell

fgl - A Functional Graph Library for Haskell

naperian - Efficient representable functors

data-r-tree - Haskell implementatio of R-Trees