- Beginners - Haskell.org

special polymorphic default of typeclass depending on other typeclasses?
by Silent Leaf 29 Jun '17

29 Jun '17

hi, say i have the following typeclass: class Foo a where bar :: a -> String looks a lot like the Read typeclass, right? (at least i think it should?) well say it's a different meaning (in other terms i can't or do not want to use Read, but i'd like to implement a default version of bar for those instances that also implement Read. is there a way to do so?

2 4

Re: [Haskell-beginners] special polymorphic default of typeclass depending on other typeclasses?
by Jean Lopes 29 Jun '17

29 Jun '17

It appear more like Show, you can add a constraint to the generic instance instance Show a => Foo a where bar x = show x Em 29 de jun de 2017 2:16 PM, "Silent Leaf" <silent.leaf0(a)gmail.com> escreveu: hi, say i have the following typeclass: class Foo a where bar :: a -> String looks a lot like the Read typeclass, right? (at least i think it should?) well say it's a different meaning (in other terms i can't or do not want to use Read, but i'd like to implement a default version of bar for those instances that also implement Read. is there a way to do so? _______________________________________________ Beginners mailing list Beginners(a)haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners

2 1

How do I map a String and a IO String?
by Jona Ekenberg 29 Jun '17

29 Jun '17

I want to replace lines with the content of a file if the line is a filename > {-# LANGUAGE LambdaCase #-} > test = do > putStrLn $ concatMap (\l -> l ++ "\n") > $ map (\case l > | (isPrefixOf "./" l) -> readFile l > | otherwise -> l) But since l is a String and readFile gives an IO String this doesn't work. How should I get around this? Kind regards, Jona

2 3

order of things in a file.hs?
by Silent Leaf 29 Jun '17

29 Jun '17

hi, what is your personal practice of ordering data/functions/main/hidden functions, etc in a haskell file? like all trivial things they are very hard to decide upon, given that either order of helpers then main function / value, or the other way round, has tempting pros and cons. thanks in advance for your opinion!

3 2

where do non-beginners haskellers go to expose code to the community?
by Silent Leaf 29 Jun '17

29 Jun '17

hi, let's say i'm a real-deal but typically open-source/not-employed haskeller, i have a really well-done library/program. i want to publish it so it's available, but i also want to just broadcast to at least a part of the haskell community basically saying "hiya, made that cool code, go check it out". both to get returns and ideas, but not so much for code-review, since it's about reviewing a finished product, or at least an alpha/beta version. where would i go to do that? (again, it's hypothetical, i'm not real-deal yet) i mean what's the point of coding if nobody knows what you do, right? (of course the question is not serious, but still, it must count for a bit right? if you don't get paid or you don't sell your code and it's not only for your own usage?) but maybe there are ways by which most haskellers go check the latest published packages? or maybe the community is not that tight-knit? or maybe it does not depend on the language, and there are places where to make your code known to potential users? i admit i don't actually know how someone with an opensource program would go to advertize it. even creating a website for it does not tell anybody that it exists. was just wondering. it'd be somewhat good if there were a centralized place where to review any package published on official repositories, both wrt the code and the functionalities. a kind of message board automatically plugged to the flux of published packages.

2 2

tail recursion optimizations and monads
by Silent Leaf 28 Jun '17

28 Jun '17

Hi, If i do this: f :: (Monad m) => a -> m a f a = ma >>= f or maybe this: f :: (Monad m) => Foo -> m a f foo = mb >>= \foo' -> mc >> f foo' can i be sure it's tail recursive (as in, with optimization)? is it in fact ever the case? does it depend on the monad? esp obviously i'm very interested in the IO monad in those cases. esp, even if it's tail recursive on the level of haskell, does it entail an execution of the underlying IO action in any way tail-recursively optimized? or does it not even matter because at the level of the execution of the IO value, there's no recursion to speak of anymore? just wondering. thanks in advance!

1 0

which typefor this FFI call
by PICCA Frederic-Emmanuel 28 Jun '17

28 Jun '17

Hello I would like to create a binding for this function [1]. herr_t H5Literate( hid_t group_id, H5_index_t index_type, H5_iter_order_t order, hsize_t *idx, H5L_iterate_t op, void *op_data ) My "only" problem is with the op and op_data part. Here the C op signature[2] op -> herr_t (*H5L_iterate_t)( hid_t g_id, const char *name, const H5L_info_t *info, void *op_data) What I would like to do is to create an Haskell function which allows to return what is contained under the op_data. What I understand from this is that I give the H5Literate function an op function which is executed for each group of my hdf5 file. So the op method is called with the releavant parameters. The op_data can be use to accumulate things during the traversal. H5Literate :: Hid -> Index -> Order -> Maybe HSize -> H5Iterate -> _ -> _ type H5Iterate = Hid -> ByteString -> Info -> _ -> _ So it seems to me that I need to use a State inorder to do the accumulation. For exemple,I want to collect each group names and accumulate then in a list. Somy questioniswhat should be the signature of both function. I have also the fealing that the return type MUST have a Storableinstance. Thanks for your help Frederic [1] https://support.hdfgroup.org/HDF5/doc/RM/RM_H5L.html#Link-Iterate [2] https://support.hdfgroup.org/HDF5/doc/RM/RM_H5L.html#Link-Visit

2 6

Re: [Haskell-beginners] Improve my lambda expressions
by PATRICK BROWNE 28 Jun '17

28 Jun '17

Thanks for all your help. I was unaware that there was a relation between let/where and lambdas. Here is my effort to use a single lamda md3 n = (\n -> (dist (Point (4.0 + 0.5 * n) (4.0 - 0.5 * n)) (Point (n * 1.0) ( n * (-1.0))))) n I imagine that this function could be written without lambdas, let, or where. Is it generally true the all/most functions could be written without lambdas, let, or where? Thanks, Pat On 26 June 2017 at 12:04, Frerich Raabe <raabe(a)froglogic.com> wrote: > On 2017-06-26 11:38, PATRICK BROWNE wrote: > >> The code below provides a distance function that works for points and >> moving point. >> I am happy with the result, but I have a problem with the lambda >> expressions. >> > > [..] > > -- Sttic points >> p1, p2 :: Point Float >> p1 = Point 0.0 0.0 >> p2 = Point 4.0 4.0 >> d = dist p1 p2 >> >> -- Moving points >> mp1, mp2 :: Point Float >> mp1x = (\t -> 4.0 + 0.5 * t) >> mp1y = (\t -> 4.0 - 0.5 * t) >> mp1 = Point (mp1x 2) (mp1y 2) >> mp2x = (\t -> 0.0 + 1.0 * t) >> mp2y = (\t -> 0.0 - 1.0 * t) >> mp2 = Point (mp2x 2) (mp2y 2) >> md = dist mp1 mp2 >> > > Maybe you could reduce the number of lambda expressions by extracting > common logic. It seems to me that 'mp1' and 'mp2' are moved versions of the > same point (2,2) except that they apply different functions to the > coordinates. These functions follow a pattern (a factor is applied to the > component and then an 'offset' is added). > > For instance, it might be worthwhile to define > > movePoint :: Float -> Float -> Point -> Point > movePoint offset factor (Point x y) = Point (offset + factor * x) > (offset - factor * y) > > ...such that you could then define > > md = let p = Point 2 2 in dist (movePoint 4 0.5 p) (movePoint 0 1 p) > > -- > Frerich Raabe - raabe(a)froglogic.com > www.froglogic.com - Multi-Platform GUI Testing > -- This email originated from DIT. If you received this email in error, please delete it from your system. Please note that if you are not the named addressee, disclosing, copying, distributing or taking any action based on the contents of this email or attachments is prohibited. www.dit.ie Is ó ITBÁC a tháinig an ríomhphost seo. Má fuair tú an ríomhphost seo trí earráid, scrios de do chóras é le do thoil. Tabhair ar aird, mura tú an seolaí ainmnithe, go bhfuil dianchosc ar aon nochtadh, aon chóipeáil, aon dáileadh nó ar aon ghníomh a dhéanfar bunaithe ar an ábhar atá sa ríomhphost nó sna hiatáin seo. www.dit.ie Tá ITBÁC ag aistriú go Gráinseach Ghormáin – DIT is on the move to Grangegorman <http://www.dit.ie/grangegorman>

2 1

a way to check whether a file is actually being written on
by Silent Leaf 28 Jun '17

28 Jun '17

Hi, i created a small clone of dd in haskell. I made it so it only copies block by block and only if there's any difference between each pair of blocks from each file. the idea is to use this dd clone as backup system, especially since my partitions are nearly full, so no real loss in copying the whole things. I'm wondering if there's any way to check if my program never ever writes onto the target unless actually needed. obviously by reading the code i'd say it does what i want, but we do make test cases rather than rely on what we think the code does. i can't run it with a target file that would be made read-only in the filesys (and hope for an error for trying to write on it) since obviously i need to open it in read-write right from the beginning, in case of actual need of writing (as apparently i can't have two handles on the same file... although maybe there's a way to change the mode of opening on the run? did not find it in System.IO nor in Hoogle or Hayoo) so if anyone has an idea, in or outside of haskell, that would be great!

2 3

Re: [Haskell-beginners] Beginners Digest, Vol 108, Issue 12
by Ning Yin 28 Jun '17

28 Jun '17

发自我的 iPad > 在 2017年6月24日，20:00，beginners-request@haskell.org 写道： > > 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. Re: help designing types for a gsl fit (David McBride) > 2. What to use when you need random values? (Silent Leaf) > 3. Re: What to use when you need random values? (David McBride) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Fri, 23 Jun 2017 09:58:35 -0400 > From: David McBride <toad3k(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] help designing types for a gsl fit > Message-ID: > <CAN+Tr42LkXcggzKVfzcsmXuK79t39F36_eNa4CWDmP1PX_gqHw(a)mail.gmail.com> > Content-Type: text/plain; charset="UTF-8" > > If you look at the type of labelNew > > GlibString string => Maybe string -> IO Label > > If you look at the instances for GlibString, they could be Text or > [Char]. You have to decide which. The fact that you are using > Nothing does not tell you the entire final type. It could be Maybe > [Char], or Maybe Text. Even though the choice seems arbitrary in this > instance, you have to decide which it is. So try this. > > lprog <- G.labelNew (Nothing :: Maybe [Char]) > > On Fri, Jun 23, 2017 at 3:22 AM, Agustin Larreinegabe > <alarreine(a)gmail.com> wrote: >> Hello, >> I'm trying to install an application Termite - Debug but I get this error in >> line 929:14 >> >> when it try to do this >> >> >> >> lprog <- G.labelNew Nothing >> >> >> The error says: >> >> Could not deduce (glib-0.13.4.1:System.Glib.UTFString.GlibString string0) >> arising from a use of ‘G.labelNew’ from the context (D.Rel c v a s) bound by >> the type signature for sourceWindowCreate :: D.Rel c v a s => RSourceView c >> a u -> IO G.Widget at Debug/SourceView.hs:913:23-73 instance >> glib-0.13.4.1:System.Glib.UTFString.GlibString [Char] -- Defined in >> ‘glib-0.13.4.1:System.Glib.UTFString’ In a stmt of a 'do' block: lprog <- >> G.labelNew Nothing In the expression: do { vbox <- G.vBoxNew False 0; >> G.widgetShow vbox; spec <- getIORef svInputSpec ref; code <- codeWinNew >> spec; .... } In an equation for ‘sourceWindowCreate’: sourceWindowCreate ref >> = do { vbox <- G.vBoxNew False 0; G.widgetShow vbox; spec <- getIORef >> svInputSpec ref; cabal: Error: some packages failed to install: >> >> I really don't know how to proceed, I'm new with Haskell >> >> >> Thanks in advance. >> >> >> ----------------- >> Agustin Larreinegabe >> >> _______________________________________________ >> Beginners mailing list >> Beginners(a)haskell.org >> http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners > > > ------------------------------ > > Message: 2 > Date: Fri, 23 Jun 2017 16:24:07 +0200 > From: Silent Leaf <silent.leaf0(a)gmail.com> > To: The Haskell-Beginners Mailing List - Discussion of primarily > beginner-level topics related to Haskell <beginners(a)haskell.org> > Subject: [Haskell-beginners] What to use when you need random values? > Message-ID: > <CAGFccjP6ai7x_n9+AGQGGgjGAMWtqOU-+YNSUbDHAEN4Sp+wNA(a)mail.gmail.com> > Content-Type: text/plain; charset="utf-8" > > Hi, > I've had trouble finding the best way(s) to use random values in haskell, > as it seems like there are several modules that either do the same thing or > reuse one another i'm not sure. > > There is System.Random > - is it better to use the streams random(R)s or a more imperative randomRIO? > - is it better to use mkStdGen or newStdGen or getStdGen? > There is Test.QuickCheck and its type(class?) Gen > There is a module in Control.Monad (i think) which exports the type Rnd > > What about performances, and all those options? What do you like to use > with random numbers? > > I know that's a lot of questions. feel free to only answer to a few of > them. :) >

1 0