conal / typecompose Goto Github PK
View Code? Open in Web Editor NEWType composition classes & instances & misc
License: Other
Type composition classes & instances & misc
License: Other
#7 fixs the build for GHC 8.4, but this fix is not yet pushed to hackage which disable any easy usage of TypeCompose
on this compiler version.
A new version on hackage will fix cabal
, stack
and nix
at once.
MVar
s with an initial value could be an instance of Data.RefMonad
. However, the current functional dependency would not make this possible without "newtyping" the IO monad.
Would having this instance make sense?
Add semigroup instances.
See also: https://ghc.haskell.org/trac/ghc/wiki/Migration/8.4#SemigroupMonoidsuperclasses
Building library for TypeCompose-0.9.12..
[ 3 of 10] Compiling Control.Compose ( src/Control/Compose.hs, dist/build/Control/Compose.o )
src/Control/Compose.hs:596:10: error:
• Could not deduce (Semigroup (Flip j o a))
arising from the superclasses of an instance declaration
from the context: (Applicative (j a), Monoid o)
bound by the instance declaration
at src/Control/Compose.hs:596:10-61
• In the instance declaration for ‘Monoid (Flip j o a)’
|
596 | instance (Applicative (j a), Monoid o) => Monoid (Flip j o a) where
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Control/Compose.hs:645:10: error:
• Could not deduce (Semigroup (App f m))
arising from the superclasses of an instance declaration
from the context: (Applicative f, Monoid m)
bound by the instance declaration
at src/Control/Compose.hs:645:10-54
• In the instance declaration for ‘Monoid (App f m)’
|
645 | instance (Applicative f, Monoid m) => Monoid (App f m) where
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Control/Compose.hs:851:1: error:
• Could not deduce (Semigroup (Arrw j f g a))
arising from the superclasses of an instance declaration
from the context: Monoid (j (f a) (g a))
bound by the instance declaration
at src/Control/Compose.hs:851:1-63
• In the instance declaration for ‘Monoid (Arrw j f g a)’
|
851 | deriving instance Monoid (f a `j` g a) => Monoid (Arrw j f g a)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Building library for TypeCompose-0.9.14..
[ 1 of 10] Compiling Control.Instances ( src/Control/Instances.hs, dist/build/Control/Instances.o, dist/build/Control/Instances.dyn_o )
[ 2 of 10] Compiling Data.Bijection ( src/Data/Bijection.hs, dist/build/Data/Bijection.o, dist/build/Data/Bijection.dyn_o )
[ 3 of 10] Compiling Control.Compose ( src/Control/Compose.hs, dist/build/Control/Compose.o, dist/build/Control/Compose.dyn_o )
src/Control/Compose.hs:221:22: warning: [-Wstar-is-type]
Using ‘*’ (or its Unicode variant) to mean ‘Data.Kind.Type’
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: use ‘Type’ from ‘Data.Kind’ instead.
|
221 | newtype ((g :: k2 -> *) :. (f :: k1 -> k2)) (a :: k1)
| ^
src/Control/Compose.hs:748:10: warning: [-Wsimplifiable-class-constraints]
• The constraint ‘Show (f a, g a)’ matches
instance (Show a, Show b) => Show (a, b) -- Defined in ‘GHC.Show’
This makes type inference for inner bindings fragile;
either use MonoLocalBinds, or simplify it using the instance
• In the instance declaration for ‘Show ((f :*: g) a)’
|
748 | instance (Show (f a, g a)) => Show ((f :*: g) a) where
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Control/Compose.hs:751:10: warning: [-Wsimplifiable-class-constraints]
• The constraint ‘Eq (f a, g a)’ matches
instance (Eq a, Eq b) => Eq (a, b)
-- Defined in ‘ghc-prim:GHC.Classes’
This makes type inference for inner bindings fragile;
either use MonoLocalBinds, or simplify it using the instance
• In the instance declaration for ‘Eq ((f :*: g) a)’
|
751 | instance (Eq (f a, g a)) => Eq ((f :*: g) a) where
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Control/Compose.hs:754:10: warning: [-Wsimplifiable-class-constraints]
• The constraint ‘Ord (f a, g a)’ matches
instance (Ord a, Ord b) => Ord (a, b)
-- Defined in ‘ghc-prim:GHC.Classes’
This makes type inference for inner bindings fragile;
either use MonoLocalBinds, or simplify it using the instance
• In the instance declaration for ‘Ord ((f :*: g) a)’
|
754 | instance (Ord (f a, g a)) => Ord ((f :*: g) a) where
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[ 4 of 10] Compiling Data.Lambda ( src/Data/Lambda.hs, dist/build/Data/Lambda.o, dist/build/Data/Lambda.dyn_o )
[ 5 of 10] Compiling Data.Pair ( src/Data/Pair.hs, dist/build/Data/Pair.o, dist/build/Data/Pair.dyn_o )
src/Data/Pair.hs:98:10: error:
• Non type-variable argument in the constraint: Monoid_f (Flip j o)
(Use FlexibleContexts to permit this)
• In the instance declaration for ‘Pair (Flip j o)’
|
98 | instance (Arrow j, Monoid_f (Flip j o)) =>
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
Error: cabal: Failed to build TypeCompose-0.9.14
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.