- Haskell-Cafe - Haskell.org

New Functional Programming Job Opportunities
by Functional Jobs 24 Jun '13

24 Jun '13

Here are some functional programming job opportunities that were posted recently: Senior software developer/Functional programmer at Vector Fabrics http://functionaljobs.com/jobs/154-senior-software-developer-functional-pro… Cheers, Sean Murphy FunctionalJobs.com

1 0

Fwd: How to make this data type work?
by Miguel Mitrofanov 24 Jun '13

24 Jun '13

Forgot to reply all, as usual. -------- Пересылаемое сообщение -------- 21.06.2013, 12:52, "Miguel Mitrofanov" <miguelimo38(a)yandex.ru>: Actually, this is not the real error you should care about. Try removing FromJSON instance completely, and you'll get a lot more. And these are fundamental: you have to decide what "j" to use when serializing. Haskell won't automagically substitute some suitable type for you. So, that's a classic mismatch: for serializing (ToJSON) you need your "j" type to be known to the AD value (meaning: it should be quantified existentially), but for deserializing you need it to be any type (quantified universally). All in all, AD seems to be the wrong type. 21.06.2013, 12:18, "Magicloud Magiclouds" <magicloud.magiclouds(a)gmail.com>: > data ActionData = AD { oldData :: (FromJSON j, ToJSON j) => j > , newData :: (FromJSON j, ToJSON j) => j} > instance ToJSON ActionData where > toJSON (AD o n) = object [ "oldData" .= o > , "newData" .= n ] > instance FromJSON ActionData where > parseJSON (Object v) = AD > <$> v .: "oldData" > <*> v .: "newData" > parseJSON _ = mzero > > I got when compile: > No instance for (FromJSON (forall j. (FromJSON j, ToJSON j) => j)) > arising from a use of `.:' > Possible fix: > add an instance declaration for > (FromJSON (forall j. (FromJSON j, ToJSON j) => j)) > In the second argument of `(<$>)', namely `v .: "oldData"' > In the first argument of `(<*>)', namely `AD <$> v .: "oldData"' > In the expression: AD <$> v .: "oldData" <*> v .: "newData" > > -- > 竹密岂妨流水过 > 山高哪阻野云飞 > > And for G+, please use magiclouds#gmail.com. > , > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe -------- Завершение пересылаемого сообщения --------

3 2

putting the result of a function in `infix` declaration
by TP 24 Jun '13

24 Jun '13

Hi everyone, Consider the following code: -------------- import Prelude hiding ((+)) data Expr = Plus Expr Expr | Minus Expr Expr | Expr String deriving Show f :: Expr -> Int f (Plus _ _) = 1 f (Minus _ _) = 2 -- infix (f (Plus undefined undefined)) + -- (*) infix 6 + (+) :: Expr -> Expr -> Expr e1 + e2 = Plus e1 e2 main = do let a = Expr "a" let b = Expr "b" print $ a + b -------------- I would like to declare the infix precedence of (+) with a function (commented line (*)) instead of directly as above. Is there any means to do that? Do we need some kind of preprocessing machinery? How to do that in Haskell? In a more general way, let us suppose I have a Haskell library able to perform some calculations: how to use it in a pre-processing step, before compilation of the executable? It could be a function to compute symbolically roots of a polynomial of second degree to be used at runtime. We would put some placeholders in the code where the result of the pre- processing calculation would enter. Thanks in advance, TP

3 2

Help me understand general recursion from cata- and anamorphism
by Takayuki Muranushi 23 Jun '13

23 Jun '13

In an attempt to understand why cata- and anamorphisms are considered so important, I found multiple implications that you can write any recursive functions in terms of nonrecursive functions and ana, cata (am I right here?) so I'm trying to practice the rewrite by a few functions. I'm following a recipe found here: http://lambda-the-ultimate.org/node/4290 ~~~ Given a function that recurses on itself, do a partial CPS transform so that it only ever recurses on itself with tail calls. Then, convert the recursive calls to codata returns, so that the function either returns TheAnswer or StillWorking with enough parameters to describe the recursive call / continuation state. This codata can be built with an unfold and can be collapsed back down to the final answer with a fold. ~~~ https://github.com/nushio3/practice/blob/master/lens/banana/CollatzTest.hs https://github.com/nushio3/practice/blob/master/lens/banana/FibTest.hs I find it difficult to understand the terminology, and the above attempts are only halfway done. I guess ( TheAnswer or StillWorking ) structure is the one found in iteratee/enumeratee. But I don't know how to "build a codata with unfold." I'd appreciate any advice. Best, -- Takayuki MURANUSHI The Hakubi Center for Advanced Research, Kyoto University http://www.hakubi.kyoto-u.ac.jp/02_mem/h22/muranushi.html

1 1

data constructor names
by Brian Lewis 23 Jun '13

23 Jun '13

Say you write data Callback = Error ... | ... because one of the kinds of callbacks you need to model is an error callback. Then, later, you write data Error = ... to model some error that can happen. They're both good names, but there's a conflict. So I started thinking I should prefix my constructor names like data Callback = CallbackError ... | ... It will work, but it's not the nicest looking. I discovered I can write data Callback = Callback'Error ... | ... Where can I find the syntax reference to see what's allowed? Will people kill me if I start doing this? I could import qualified, but in my case, there would be too many modules. Thanks for any advice.

4 3

<<loop>> error message
by Omari Norman 23 Jun '13

23 Jun '13

I compiled some code with GHC 7.6.3 that produces a simple error at runtime myProgramName: <<loop>> At which point the program exits with code 1. Is there documentation for this error anywhere? Does it mean I have some infinite loop in my code somewhere? If so, does GHC catch all infinite loops? I have never gotten this error before. Thanks.

3 2

The promising world of Monadic formlets
by Alberto G. Corona 23 Jun '13

23 Jun '13

Hi, This is just to let you know the promising results of some experimentation: Formlets are about applicative instances, but what about monadic instances? What a Monad instance of formlets means? I recently experimented with this and the results are very interesting and powerful- It mixes the best of web forms, with the flexibility of console applications. ???!!!!!! Althoug this example is for the formlets of the MFlow <https://github.com/agocorona/MFlow>framework , it can be ported to other formlet implementations. Although the MFLow formlets include web formatting that is not supported in other formlets implementations. Static HTML templating don´t work well with monadic formlets, so it is important to include the formatting as a part of the computation: import MFlow.Wai.Blaze.Html.All dynamicForm= wform $ do (n,s) <- (,) <- p << "Who are you?" ++> getString Nothing <! hint "name" <++ br <*> getString Nothing <! hint "surname" <++ br <** submitButton "ok" <++ br flag <- b << "do you " ++> getRadio[radiob "work?",radiob "study?"] <++ br r<-case flag of "work" -> pageFlow "l" $ Left <- b << "do you enjoy your work? " ++> getBool True "yes" "no" <** submitButton "ok" <++ br "study"-> pageFlow "r" $ Right <- b << "do you study in " ++> getRadio[radiob "University" ,radiob "High School"] p << ("You are "++n++" "++s) ++> case r of Left fl -> p << ("You work and it is " ++ show fl ++ " that you enjoy your work") ++> noWidget Right stu -> p << ("You study at the " ++ stu) ++> noWidget hint s= [("placeholder",s)] onClickSubmit= [("onclick","this.form.submit()")] radiob s n= text s ++> setRadio s n <! onClickSubmit Here wform, getBool, getString , getRadio etc are formlet elements The first sentence is an applicative composition that generate a 2 tuple, to show that applicative and monadic can be mixed. the operations ++> add html to the formlet. the operatior <! add attributes to the formlet element.. noWidget is a dumb formlet that does not validate. The second monadic statement is an election between two options. The beauty of the monadic instance is that the rest of the form can vary depending on the previous answers. Since the formlets validate the input, unless the election is made, the radio will not validate, so the monadic execution will be aborted beyond any unanswered question, so nothing will appear after the question. The rest of the form will appear when the user choose one of the two options. once one or the other option is chosen, then another binary question is presented. (either he likes his work or where he study). When the questions are finised, the results are presented. I hope that you get the idea. The benefit is not only the familiar coding and presentation of a sequential console application: Since the form encloses all the fields, At any time the user can change previous inputs and the form will reflect these changes. For example if the user change from work to study (second statements) the "where do you study will appear and the work related questions and answers will disappear. That is wonderfully useful for heavily interactive applications. There is a problem however and it is the issue of the formlet identifiers. Unlike in an applicative presentation, now the number and type of the formlets will vary, so the response to a previous form create a new kind of form, and the post response can be misinterpreted. To avoid that , the pageFlow call creates fixed field labels for each branch of execution. I will release a version of MFlow that support this kind of monadic composition of fomlets, but In essence it is nothing but to add Monad instance to formlets. A single server procedure, that executes the formlet code can support all the interaction so any framework can do it. The usability of that is huge:It is possible to interact in a web page in a console style with questions and answers with the versatitly of a dynamic foms: Any modification in the form change the subsequent flow of interaction. Another application of this monadic style is to ease multistep processes such are registration, check-out and payment ad so on. Even a entire interactive dynamic application can be coded in a single page. And no javascript is needed!. To run this formlet in MFlow: main=do addMessageFlows [("" , transient $ runFlow $ ask dynamicForm )] wait $ run port waiMessageFlow This video show how the presentation of this example vary with the user input: http://youtu.be/DryBQc9agFg I hope that you find the idea interesting. If you want to experiment with this in MFlow, I have to say that the implementation of this feature is in an early stage. The code is in the head branch https://github.com/agocorona/MFlow/tree/head Alberto.

3 5

how to debug stack overflow?
by Johannes Waldmann 22 Jun '13

22 Jun '13

What is the recommended method to find the exact reason for a stack overflow (when running a Haskell program compiled with ghc)? When I compile with -prof -auto-all, and run with +RTS -xc, I see a very short call stack, which can't be right. But that's probably because I am calling some library method that was compiled without -auto-all so it's invisible in the trace? I can avoid the overflow by +RTS -K1G or something but I want to investigate because it might indicate some inefficiency in the code (evaluations happening at the wrong time). - J.W.

2 2

writing a function to make a correspondance between type-level integers and value-level integers
by oleg＠okmij.org 22 Jun '13

22 Jun '13

I'm late to this discussion and must have missed the motivation for it. Specifically, how is your goal, vector/tensor operations that are statically assured well-dimensioned differs from general well-dimensioned linear algebra, for which several solutions have been already offered. For example, the Vectro library has been described back in 2006: http://ofb.net/~frederik/vectro/draft-r2.pdf http://ofb.net/~frederik/vectro/ The paper also talks about reifying type-level integers to value-level integers, and reflecting them back. Recent GHC extensions (like DataKinds) make the code much prettier but don't fundamentally change the game.

2 1

Nightly builds of GHC HEAD for OS X 10.8
by John Wiegley 22 Jun '13

22 Jun '13

Since mid-January, I’ve been running nightly builds of GHC on my Mac Pro for 10.8.x, 64-bit. I’ve decided to make these results publically downloadable here: http://ghc.newartisans.com. The installer tarballs are in dist, while the fulltest and nofib logs are in logs. According to Jenkins this build takes 8h15m minutes, so I figured this might save others some CPU heat. -- John Wiegley FP Complete Haskell tools, training and consulting http://fpcomplete.com johnw on #haskell/irc.freenode.net

1 1