September 2017 - Beginners

Re: [Haskell-beginners] Beginners Digest, Vol 111, Issue 4
by Jack Brandt 04 Sep '17

04 Sep '17

Would a specialization of return work, as in f = return :: Maybe a -> IO (Maybe a)? On Mon, Sep 4, 2017 at 7:00 AM, <beginners-request(a)haskell.org> wrote: > Send Beginners mailing list submissions to > beginners(a)haskell.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners > or, via email, send a message with subject or body 'help' to > beginners-request(a)haskell.org > > You can reach the person managing the list at > beginners-owner(a)haskell.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Beginners digest..." > > > Today's Topics: > > 1. I have a -> f a. How to get m a -> f m a ? (Baa) > 2. Re: I have a -> f a. How to get m a -> f m a ? (Imants Cekusins) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Mon, 4 Sep 2017 15:06:34 +0300 > From: Baa <aquagnu(a)gmail.com> > To: beginners(a)haskell.org > Subject: [Haskell-beginners] I have a -> f a. How to get m a -> f m a > ? > Message-ID: <20170904150634.230dd5ff@Pavel> > Content-Type: text/plain; charset=US-ASCII > > Hello List! > > I have function a -> IO a. How to get function: > > Maybe a -> IO (Maybe a) ? > > I found in Haskell mails archive such thing: > > class IFunctor f where > imap :: Idiom i => (s -> i t) -> f s -> i (f t) > > which looks similar, but I didn't find any helpfull instances of > `IFunctor` class in its package (and unfortunately I don't know what are > the indexed types: IMonad, IFunctor, etc). Sure, there is the primitive > solution like: > > myfunc :: a -> IO a > ... > f x = case x of Nothing -> return Nothing > Just x' -> Just <$> myfunc x' > > but more interesting is to know more standard and Haskelish solution > (like lift's, etc). May be I miss something very obvious.. > > === > Best regards, Paul > > > ------------------------------ > > Message: 2 > Date: Mon, 4 Sep 2017 15:14:42 +0300 > From: Imants Cekusins <imantc(a)gmail.com> > To: The Haskell-Beginners Mailing List - Discussion of primarily > beginner-level topics related to Haskell <beginners(a)haskell.org> > Subject: Re: [Haskell-beginners] I have a -> f a. How to get m a -> f > m a ? > Message-ID: > <CAP1qinaEhE6HqvS0O9-CfV9Vc2x8ZvfQ_SRFXQgVH- > yhapZZtg(a)mail.gmail.com> > Content-Type: text/plain; charset="utf-8" > > > I have function a -> IO a. How to get function: > > Maybe a -> IO (Maybe a) ? > > Will mapM work: > > http://hackage.haskell.org/package/base-4.10.0.0/docs/ > Data-Traversable.html#v:mapM > > ? > > > > On 4 September 2017 at 15:06, Baa <aquagnu(a)gmail.com> wrote: > > > Hello List! > > > > I have function a -> IO a. How to get function: > > > > Maybe a -> IO (Maybe a) ? > > > > I found in Haskell mails archive such thing: > > > > class IFunctor f where > > imap :: Idiom i => (s -> i t) -> f s -> i (f t) > > > > which looks similar, but I didn't find any helpfull instances of > > `IFunctor` class in its package (and unfortunately I don't know what are > > the indexed types: IMonad, IFunctor, etc). Sure, there is the primitive > > solution like: > > > > myfunc :: a -> IO a > > ... > > f x = case x of Nothing -> return Nothing > > Just x' -> Just <$> myfunc x' > > > > but more interesting is to know more standard and Haskelish solution > > (like lift's, etc). May be I miss something very obvious.. > > > > === > > Best regards, Paul > > _______________________________________________ > > Beginners mailing list > > Beginners(a)haskell.org > > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners > > >

1 0

get rid of IO in [IO XXX]
by info＠maximka.de 04 Sep '17

04 Sep '17

What is the way to transform a list of [IO XXX] type to [XXX]? Thanks, Alexei

3 2

I have a -> f a. How to get m a -> f m a ?
by Baa 04 Sep '17

04 Sep '17

Hello List! I have function a -> IO a. How to get function: Maybe a -> IO (Maybe a) ? I found in Haskell mails archive such thing: class IFunctor f where imap :: Idiom i => (s -> i t) -> f s -> i (f t) which looks similar, but I didn't find any helpfull instances of `IFunctor` class in its package (and unfortunately I don't know what are the indexed types: IMonad, IFunctor, etc). Sure, there is the primitive solution like: myfunc :: a -> IO a ... f x = case x of Nothing -> return Nothing Just x' -> Just <$> myfunc x' but more interesting is to know more standard and Haskelish solution (like lift's, etc). May be I miss something very obvious.. === Best regards, Paul

2 2

Re: [Haskell-beginners] Restrict type in phantom data-type
by Baa 01 Sep '17

01 Sep '17

I pereputal emails. --- David, hello! 1. Is it the same/different as: data family Day a data Sunny data Rainy data instance Day Sunny = SunnyDay deriving Show data instance Day Rainy = RainyDay deriving Show ..and here you can not create `Day Int` object because no `Day Int` constructor (but you can create such constructor) ? Or in case with type families there is possibility to extend it to `Day Int` and in case with DayaKinds it's totally impossible? 2. I read somewhere (on forums) that restrictions on data types... I don't remember exactly, but something like they are not real restrictions or are related to old extension which is/will be deprecated. I'm not sure. Also, I'm not sure is it - in your example - restriction (constraint) or something else. Am I wrong? > This is maybe edging toward haskell-cafe territory, but you can > definitely do this in haskell. > > {-# LANGUAGE DataKinds, KindSignatures #-} > > data DayType = Sunny | Rainy > > data Day (a :: DayType) = Day > > > sunnyDay :: Day Sunny > sunnyDay = Day > > rainyDay :: Day Rainy > rainyDay = Day > > -- impossibleDay :: Day () > -- impossibleDay = Day > > On Fri, Sep 1, 2017 at 10:18 AM, Baa <aquagnu(a)gmail.com> wrote: > > Hello, List! > > > > For example, I have specialized (right nameis phantom?) type: > > > > data Day a = Day { ... no `a` here } > > data Sunny > > data Rainy > > > > joyToday :: Day Sunny -> IO () > > joyToday day = ... > > > > melancholyToday :: Day Rainy -> IO () > > melancholyToday day = ... > > > > And I can create (in spite of that it's phantom) some day: > > > > let day1 = Day {...} :: Day Sunny > > joyToday day1 > > > > but no problem to create `Day Int`, `Day Char`, etc which is > > pointless actually (sure "creator"-function can be exported from the > > module only, but I'm talking about type-level solution). > > > > I know that constraints (`... =>`) on data types are > > redundant/removed from the language. And I'm not sure how it's > > possible to restrict that parameter `a` (I know that it's possible > > to Java/C++/Perl6 (not sure), some other languages but how to add > > such restriction in Haskell? IMHO type families can help but I'm > > not sure how it will look (Sunny, Rainy are "nullary" type, so...). > > > > Is it possible for Haskell too? > > > > === > > Best regards, Paul > > _______________________________________________ > > Beginners mailing list > > Beginners(a)haskell.org > > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners > _______________________________________________ > Beginners mailing list > Beginners(a)haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners

3 2

Restrict type in phantom data-type
by Baa 01 Sep '17

01 Sep '17

Hello, List! For example, I have specialized (right nameis phantom?) type: data Day a = Day { ... no `a` here } data Sunny data Rainy joyToday :: Day Sunny -> IO () joyToday day = ... melancholyToday :: Day Rainy -> IO () melancholyToday day = ... And I can create (in spite of that it's phantom) some day: let day1 = Day {...} :: Day Sunny joyToday day1 but no problem to create `Day Int`, `Day Char`, etc which is pointless actually (sure "creator"-function can be exported from the module only, but I'm talking about type-level solution). I know that constraints (`... =>`) on data types are redundant/removed from the language. And I'm not sure how it's possible to restrict that parameter `a` (I know that it's possible to Java/C++/Perl6 (not sure), some other languages but how to add such restriction in Haskell? IMHO type families can help but I'm not sure how it will look (Sunny, Rainy are "nullary" type, so...). Is it possible for Haskell too? === Best regards, Paul

3 4