Marco Perone
Marco Perone
It would be extremely to be able to infer the strictest machine topology from its definition. Maybe this is doable using some kind of reflection technique, maybe it is just...
Currently the `StateMachine` type has a predefined set of constructors which provide some basic combinators to build more complex machines. I'm definitely not sure that this set is complete in...
Currently we have both the `Compose` and `Kleisli` constructors. They are fairly similar, but both needed. It would be nice to be able to unify them. This could depend on...
Currently a `BaseMachine` has type `BaseMachine (topology :: Topology vertex) input output`. In practice we are allowed to specify a specific state space for every vertex of the topology, while...
Introducing effectful machines had the effect to invalidate the `Cosieve` and `Corepresentable` instances. - Find out if effectful machines `StateMachineT m a b` are isomorphic to `NonEmpty a -> m...
the values for the boolean state machine are completely made up. Try to come up with more meaningful ones see https://github.com/tweag/crem/pull/26#discussion_r1087631024
Add a combinator that allows to perform a validation depending on an assertion on the value
From the documentation of Orient Db I see that it supports Prepared queries. In PhpOrient I can't see any reference to prepared queries. Is it possible to use them or...
introduce first a concrete implementation only then have section on how to generalize with polymorphism