unfix-binders VS refined

Compare unfix-binders vs refined and see what are their differences.

unfix-binders

Experimental proof assistant (and architecture) for dependent linear logic (by aspiwack)
Data
Source Code
Suggest alternative
Edit details

refined

Refinement types with static checking (by nikita-volkov)
Data
Source Code
hackage.haskell.org
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
unfix-binders refined
- 1
43 180
- -
0.0 1.5
almost 2 years ago about 1 month ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT 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.

unfix-binders

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

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

refined

Posts with mentions or reviews of refined. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-08-28.
  • Can types replace validation?
    2 projects | /r/programming | 28 Aug 2022
    In one respect, nothing. You’re right. Even given refinement types as in Haskell or Scala, there is indeed a necessarily-partial function (refineV in Scala) to refine a value to its refinement type.

What are some alternatives?

When comparing unfix-binders and refined you can also consider the following projects:

chaselev-deque - A collection of different packages for CAS based data structures.

elf - Parser for ELF object format.

hashtables - Mutable hash tables for Haskell, in the ST monad

semantic-source - Parsing, analyzing, and comparing source code across many languages

diskhash - Diskbased (persistent) hashtable

fmlist - FoldMap lists

compendium-client - Mu (μ) is a purely functional framework for building micro services.

hnix - A Haskell re-implementation of the Nix expression language

code-builder - Packages for defining APIs, running them, generating client code and documentation.

llrbtree - Left-leaning red-black trees

dependent-sum - Dependent sums and supporting typeclasses for comparing and displaying them

ruby-marshal - Haskell library to parse a subset of Ruby objects serialised with Marshal.dump

unfix-binders vs chaselev-deque refined vs elf unfix-binders vs hashtables refined vs semantic-source unfix-binders vs diskhash refined vs fmlist unfix-binders vs compendium-client refined vs hnix unfix-binders vs code-builder refined vs llrbtree unfix-binders vs dependent-sum refined vs ruby-marshal