machines vs selective

machines

Networks of composable stream transducers (by ekmett)

Control

Source Code

Suggest alternative

Edit details

selective

Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically (by snowleopard)

Control Haskell

Source Code

Suggest alternative

Edit details

Our great sponsors

InfluxDB - Power Real-Time Data Analytics at Scale

WorkOS - The modern identity platform for B2B SaaS

SaaSHub - Software Alternatives and Reviews

Our great sponsors

machines		selective
	Project
-	Mentions	1
338	Stars	200
-	Growth	-
3.6	Activity	4.4
7 months ago	Latest Commit	12 days ago
Haskell	Language	TeX
BSD 3-clause "New" or "Revised" License	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.

machines

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

We haven't tracked posts mentioning machines yet.
Tracking mentions began in Dec 2020.

selective

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

Is it possible to write a definitional interpreter in Applicative style?
1 project | /r/haskell | 28 Sep 2022

I don't that that it goes fully all the way to monads. But, it does seem to require something "stronger" than applicatives, and I think stronger than selective functors -- though maybe there is a selection domain that is sufficient.

What are some alternatives?

When comparing machines and selective you can also consider the following projects:

pipes - Compositional pipelines

transient - A full stack, reactive architecture for general purpose programming. Algebraic and monadically composable primitives for concurrency, parallelism, event handling, transactions, multithreading, Web, and distributed computing with complete de-inversion of control (No callbacks, no blocking, pure state)

recursion-schemes - Generalized bananas, lenses and barbed wire

apecs - a fast, extensible, type driven Haskell ECS framework for games

daemons - Daemons in Haskell made fun and easy

funflow - Functional workflows

static-closure

atl - Arrow Transformer Library

capability - Extensional capabilities and deriving combinators

distributed-closure - Serializable closures for distributed programming.

fused-effects - A fast, flexible, fused effect system for Haskell

machinecell - Arrow based stream transducer