- Haskell-Cafe - Haskell.org

Help finding one-sided ordered list implementation
by David Feuer 27 Jan '15

27 Jan '15

In "Numerical Representations as Higher-Order Nested Datatypes", Ralf Hinze describes an implementation of one-sided ordered lists as 2-3 search trees under the left spine view. I'm wondering if anyone's actually coded those up somewhere I could download them, or if I'll have to dig into all the details in the paper and write them myself. Thanks, David

1 0

Wrapping a C++ library
by Richard Lewis 27 Jan '15

27 Jan '15

Hi there, There is a C++ library for which I'm working on an FFI wrapper. I've written a translation unit which defines several functions with an extern "C" API. Each of the functions does a little bit of C++ to operate the third party library, but the point is that I now have a C API that I can wrap with the FFI. The next thing I did was to try and get Cabal to compile this translation unit for me. I eventually hacked together a Setup.hs that I barely understand that calls gcc to compile the .cpp file and then calls `ar` to, um, well do whatever it is that ar does with .o files, make some sort of archive, or something. Next, I need to get my hsc file (in which I define some imported functions and some data types with Storable instances for shovelling data through the FFI) to compile. This file uses the hsc2hs #include macro to include the .h file of my translation unit. In turn, that .h includes some of the C++ header files from the third party, and eventually an STL header: vector. At this point, the compiler, gcc, complains that it can't find vector. The gcc command that hsc2hs (I think?) is creating does not include -lstdc++, and nethier does it use g++, either of which would, I think, result in a successful compilation of the hsc2hs .c file. In my cabal file I have: extra-libraries: stdc++ ghc-options: -pgml g++ -Wall But these don't seem to fix anything. Perhaps they don't have any effect on how hsc2hs operates? There's a specific question here which goes something like: how do I get hsc2hs to compile code that uses STL headers? But there's also a more general question as to whether my whole approach of creating an extern "C" wrapper is actually going to work? Any answers would be very appreciated. Richard

5 8

Drastic Prelude changes imminent
by Augustsson, Lennart 27 Jan '15

27 Jan '15

If you didn't know that, e.g., the type of foldr is changing, check out the thread https://www.haskell.org/pipermail/libraries/2015-January/024777.html. This email and any attachments are confidential and may also be privileged. If you are not the intended recipient, please delete all copies and notify the sender immediately. You may wish to refer to the incorporation details of Standard Chartered PLC, Standard Chartered Bank and their subsidiaries at http://www.standardchartered.com/en/incorporation-details.html Insofar as this communication contains any market commentary, the market commentary has been prepared by a sales and/or trading desk of Standard Chartered Bank or its affiliate. It is not and does not constitute research material, independent research, recommendation or financial advice. Any market commentary is for information purpose only and shall not be relied for any other purpose, and is subject to the relevant disclaimers available at http://wholesalebanking.standardchartered.com/en/utility/Pages/d-mkt.aspx. Please visit http://wholesalebanking.standardchartered.com/en/capabilities/financialmark… for important information with respect to derivative products.

3 3

Multi-pattern LambdaCase?
by Tom Ellis 27 Jan '15

27 Jan '15

Is there a particular reason that LambdaCase does not support muliple patterns? Specifically I am suggesting that \case { pA1 pA2 pA3 -> eA, ... } be sugar for \freshName1 freshName2 freshName3 -> case freshName1 freshName2 freshName3 of { pA1 pA2 pA3 -> eA, ... } Is there some technical reason that prevents it? Tom

2 3

Could cabal-install shows dependencies as dot or some format?
by Magicloud Magiclouds 26 Jan '15

26 Jan '15

Hi, I know ghc-pkg could do that. But that is for packages already installed. I'd like cabal-install to do that when it is trying to resolve dependencies. The reason is that, now I got a "Could not resolve dependencies" error. But I could not simply figure out why based on the output of cabal-install. -- 竹密岂妨流水过山高哪阻野云飞 And for G+, please use magiclouds#gmail.com.

2 1

Skolems!
by Tom Murphy 26 Jan '15

26 Jan '15

Like any good mystery, let's start with the body: repro.hs:22:5: Couldn't match type `y0' with `y' because type variable `y' would escape its scope This (rigid, skolem) type variable is bound by a type expected by the context: Foo x y -> Bool The following variables have types that mention y0 b :: Foo x0 y0 -> Bool (bound at repro.hs:18:9) Expected type: Foo x y -> Bool Actual type: Foo x0 y0 -> Bool In the first argument of `h', namely `b' In a stmt of a 'do' block: h b In the expression: do { xs <- return ["test"] :: IO [String]; let a = ... b = ...; h b } Failed, modules loaded: none. So it's the "(rigid, skolem)" error you sometimes happen across. The code that's causing it, though, is pretty unsuspicious: {-# LANGUAGE RankNTypes #-} -- remove this pragma and it typechecks (1): {-# LANGUAGE GADTs #-} data Foo x y = Foo x y main :: IO () main = do xs <- return ["test"] :: IO [String] let -- typechecks (2): -- a = Just "test" :: Maybe String -- typechecks (3): -- a = f ["test"] a = f xs :: Maybe String b = g (a :: Maybe String) :: forall x y. Foo x y -> Bool -- typechecks if it's inlined (4): -- h (g (a :: Maybe String) :: forall x y. Foo x y -> Bool) h b f :: [a] -> Maybe a f _ = Nothing -- doesnt affect typechecking: -- g :: Maybe String -> (Foo x y -> Bool) g :: Maybe String -> (forall x y. Foo x y -> Bool) g (Just _) _ = False g Nothing _ = True -- typechecks (5): -- h :: (Foo x y -> Bool) -> IO () h :: (forall x y. Foo x y -> Bool) -> IO () h = undefined This has been reproduced in ghc 7.6.3, 7.8.3, 7.8.4, and 7.10.1 RC1 Any idea what's going on? Thanks! Tom

3 2

NumberSieves status/maintenance
by David Feuer 26 Jan '15

26 Jan '15

This package was last updated in 2012, and the linked darcs repository is inaccessible. Do you intend to continue to maintain this package? If not, I would be happy to take over. Thanks, David Feuer

1 0

ANN: deepseq-bounded 0.5 -> 0.6
by Andrew Seniuk 25 Jan '15

25 Jan '15

This may affect depending code. Please consult the distro changelog for specific information about how your code might be affected, or better yet, refer to http://www.fremissant.net/deepseq-bounded/transition-5-6-7.html and http://www.fremissant.net/deepseq-bounded/grammar.html This is a transitional version of deepseq-bounded, with stability of the grammar expected in early March for version 0.7. This also causes major version bumps to the seqaid and leaky packages. To update everything, issue cabal update cabal install --reinstall --force-reinstalls seqaid which reinstalls the latest deepseq-bounded in passing. And also if you were to run "seqaid demo" it will use the updated version of leaky, so everything's up to date. The homepage for these projects starts at http://www.fremissant.net/deepseq-bounded-seqaid-leaky.html Kind Regards, Andrew

1 0

Monad layering and DSL
by Gautier DI FOLCO 25 Jan '15

25 Jan '15

Hello all, I'm trying to make an IMAP DSL and I'm face to an annoying issue (all the examples after are selected pieces of this: https://github.com/blackheaven/smoothmail) Here we are, IMAP provide a way to statefully interact with a server. For example: select "A" -- Select folder 'A' searchAll -- Get the list of UID (message identifiers) [1, 2, 3] But select "B" searchAll -- Get [4, 5] I decided to use the Free Monad because it seems well suite for what I'm doing and I end-up with something like that: data ImapF next = Select DirectoryName (Maybe DirectoryDescription -> next) | Noop (DirectoryDescription -> next) | Search MailSearch (Maybe [UID] -> next) -- Functor instance type Imap = Free ImapF searchAll :: Imap (Maybe [UID]) searchAll = liftF $ Search undefined id select :: DirectoryName -> Imap (Maybe DirectoryDescription) select directory = liftF $ Select directory id My main problem is the following: if I do a select of an unknown directory, I should stop the computation. My first thought was Monad Transformers. So here are the types: newtype FreeT f m a = FreeT { runFreeT :: m (FreeF f a (FreeT f m a)) } Such that f is a functor and m a monad. If I do a type Imap = FreeT ImapF Maybe I'll end up with some Maybe (ImapF a) which not expresses that the evaluation can fails but that the expression construction can fails. Then I thought harder and ends up with that: type Imap = FreeT Maybe (Free ImapF) Ok, that seems better, but all the available operations can't fail. I also have had a look at extensible effects and I think I'm stuck with the same issue of my first attempt. My goal is to provide flexibility for those who want to continue the evaluation, but to provide an API with less boilerplate in the default case. If you have any ideas/hints/comments, I'll be happy to read them. If you have any questions, I'll do my best to answer them and to make disappear all doubt and ambiguity. Thanks in advance for your help. Regards.

2 5

Haskell wiki
by Ronald Legere 25 Jan '15

25 Jan '15

Greetings, Does anyone know how to get an account to help contribute to the haskell wiki? Registration has been closed for the last 3 years and there is link to email anyone that I could find, hence this "Broadcast" message. There are dead links and such that I would love to help clean up. Cheers! -- Ron Legere (rjljr2(a)gmail.com) legere et discere

4 3