May 2015 - Haskell-Cafe

status of deb.haskell.org?
by Jeremy 08 May '15

08 May '15

The haskell status page says that deb.haskell.org has been down since mid-February. Are there any plans to bring it back up? -- View this message in context: http://haskell.1045720.n5.nabble.com/status-of-deb-haskell-org-tp5768430.ht… Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

3 3

Re: [Haskell-cafe] RFC: "Native -XCPP" Proposal
by Howard B. Golden 08 May '15

08 May '15

At the risk of antagonizing some (most? all?) of you, how about... -XCPP stands for the native CPP -XGNUCPP stands for GNU's GCC CPP -XClangCPP stands for Clang's CPP -XCPPHS stands for CPPHS ... with the hope that TH is the future? Howard

4 3

Efficient memory use for tens of thousands of connections
by Ben Bangert 07 May '15

07 May '15

I'm currently evaluating memory overhead for a variety of simple Websocket based echo server to get a gauge of minimal memory penalty per connection along with SSL overhead per connection. I've created two websocket servers in Haskell: https://github.com/bbangert/ssl-ram-testing/tree/master/Haskell One using Yesod + jaspers Websockets lib, the other with Yesod + Mishael Snoyman's native websocket lib. I was curious what options I might be missing that would ensure a more efficient use of memory, at the moment the non-SSL seems to use about 48kb per connection, while using Haskell's TLS via warp-tls introduces a huge amount of overhead (along with odd handshake issues). Here's what my results look like: No SSL Program started. Tester started. Tester finished connecting. Waiting: 360 Last Memory Increase: 2 WARNING: Program hasn't stopped increasing. Started with: 2633728 Ended with: 50896896 kB per connection: 47.13 SSL Program started. Tester started. yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) yesod-customws-tls: HandshakeFailed (Error_Protocol ("bad record mac",True,BadRecordMac)) WARNING: Failed to connect all clients Tester finished connecting. Waiting: 360 Last Memory Increase: 4 WARNING: Program hasn't stopped increasing. Started with: 3170304 Ended with: 454221824 kB per connection: 444.03 SSL Overhead per Conn: 396.90 I wait up to 6 minutes for memory to level out, it never does with or without SSL. Is this expected behavior? If not, what options am I missing? The ssl-ram-testing repo includes full directions on how to reproduce this and run this test. Cheers, Ben

1 1

ANN: Important lambabot update (5.0.2.1 release)
by Bertram Felgenhauer 07 May '15

07 May '15

Hi, I've just released lambdabot-5.0.2.1 which plugs an embarrassing security hole in the @check command; if you are running lambdabot as an IRC bot, you should upgrade! Generally, lambdabot relies on SafeHaskell and not running user-supplied IO actions for safety. This is unlikely to be bullet-proof, so it's advisable to sandbox mueval. However, the @check command violated this basic principle, and allowed running arbitrary IO actions. This is now fixed by using the (new) QuickCheck-safe package that only uses unsafePerformIO for the specific purposes of catching exceptions and generating the initial seed for random number generation. Thanks to benzfr on Freenode for finding this! There are a few minor changes. Notably, we now ship compiler-specific versions of Pristine.hs so that lambdabot runs out of the box on both ghc-7.6.3 and ghc-7.8.3 (ghc-7.10.1 still needs some work.) and the dict plugin no longer supports looking up several words at once. Cheers, Bertram P.S. As I just realized, I forgot to update the Changelog that comes with lambdabot... will try to remember next time.

1 2

Cannot run GHC-7.10.1 tests
by Jeremy Henty 07 May '15

07 May '15

I successfully built GHC-7.10.1 but I cannot run the tests (at least not when I follow the instructions at https://ghc.haskell.org/trac/ghc/wiki/Building/RunningTests) "make fast" fails like this: ===--- building phase 0 make -r --no-print-directory -f ghc.mk phase=0 phase_0_builds make[1]: Nothing to be done for `phase_0_builds'. ===--- building phase 1 make -r --no-print-directory -f ghc.mk phase=1 phase_1_builds make[1]: Nothing to be done for `phase_1_builds'. ===--- building final phase make -r --no-print-directory -f ghc.mk phase=final fast make[1]: *** No rule to make target `fast'. Stop. make: *** [fast] Error 2 "make testfast" fails in exactly the same way, except that the broken make target is "testfast" instead of fast. "make test" and "make fulltest" fail like this: make -C testsuite/tests CLEANUP=1 OUTPUT_SUMMARY=../../testsuite_summary.txt fast make[1]: Entering directory `/data/build.d/6.8/ghc-7.10.1/testsuite/tests' ../mk/boilerplate.mk:168: ../mk/ghcconfig_data_build.d_6.8_ghc-7.10.1_inplace_bin_ghc-stage2.mk: No such file or directory ../mk/ghc-config "/data/build.d/6.8/ghc-7.10.1/inplace/bin/ghc-stage2" >"../mk/ghcconfig_data_build.d_6.8_ghc-7.10.1_inplace_bin_ghc-stage2.mk"; if [ $? != 0 ]; then rm -f "../mk/ghcconfig_data_build.d_6.8_ghc-7.10.1_inplace_bin_ghc-stage2.mk"; exit 1; fi /bin/sh: ../mk/ghc-config: cannot execute binary file make[1]: *** [../mk/ghcconfig_data_build.d_6.8_ghc-7.10.1_inplace_bin_ghc-stage2.mk] Error 1 make[1]: Leaving directory `/data/build.d/6.8/ghc-7.10.1/testsuite/tests' make: *** [test] Error 2 Interestingly, for GHC-7.8.4 "make fast" and "make testfast" fail in exactly the same way but "make test" and "make fulltest" both work. So, how do I test GHC-7.10.1 ? Regards, Jeremy Henty

3 5

Re: [Haskell-cafe] release timing
by Harry . 07 May '15

07 May '15

Simon PJ wrote ... > > | It would be nice to see #8224 in as well, but doesn't look like that's > | going to be fixed any time soon! Have GHC HQ ever considered asking > | Intel if they'd be willing to lend a hand? > > What makes you think that Intel would help with #8224? (It's about the IO manager.) The title is about the IO manager :-) The diagnosis ends with performance issues that appear tied to CPU design, something that Intel ought to know something about. > Also, GHC is an open source project. You don't have to wait for GHC HQ to do anything --- please go ahead and ask anyone you think could help! While it's not unheard of for a corporation to assist an open source project, particularly with issues specific to their products, the request would have a lot more credibility if it came from GHC HQ than a random GHC user. I also have no idea who in Intel should be contacted for such things. But in the spirit of your suggestion I'm cross-posting this to haskell-cafe to reach a wider audience. Does anyone out there know of a contact in Intel who might be able/willing to help with CPU performance issues?

1 0

Re: [Haskell-cafe] RFC: "Native -XCPP" Proposal
by Johannes Waldmann 07 May '15

07 May '15

There is maybe another option: do what csharp does. Define a reduced "preprocessor" (for conditional compilation, but without macro expansion) as part of the language. (cf. https://msdn.microsoft.com/en-us/library/ed8yd1ha.aspx ) They must have have had good reasons for doing it this way. - J.W. PS: I was trying to add a proper reference (to the language spec) but this seems hard. It is Section 9.5 of ECMA-334. For viewing the newer specs, it seems you need to have MS-Word or VS installed. See also http://stackoverflow.com/questions/13467103/

7 6

Re: [Haskell-cafe] minor confusion over kinds....
by Nicholls, Mark 06 May '15

06 May '15

lets try it the other way around > instance Foo' SNat1 where > type Bar' SNat1 = Z1 > bar' = SZ1 that works! (my language will be wrong here...but the jist is) So in some something of kind "*->*" is substitutable for a parameter of kind "k -> *" "Nat->*" is substitutable for a parameter of kind "k -> *" "*->*" is substitutable for a parameter of kind "* -> *" "Nat->*" is NOT substitutable for a parameter of kind "* -> *" Hmmmm So why would I ever want to define a type class of kind (* -> *) -> Constraint Instead of (k -> *) -> Constraint ? I think I don't completely understand what's going on. From: Nicholls, Mark Sent: 06 May 2015 1:02 PM To: haskell-cafe(a)haskell.org Subject: minor confusion over kinds.... And what "*" means as opposed to other things e.g. an explicit name "Nat" or a kind variable "k" > {-# LANGUAGE DataKinds #-} > {-# LANGUAGE ExplicitForAll #-} > {-# LANGUAGE FlexibleContexts #-} > {-# LANGUAGE FlexibleInstances #-} > {-# LANGUAGE GADTs #-} > {-# LANGUAGE MultiParamTypeClasses #-} > {-# LANGUAGE PolyKinds #-} > {-# LANGUAGE StandaloneDeriving #-} > {-# LANGUAGE TypeFamilies #-} > {-# LANGUAGE TypeOperators #-} > {-# LANGUAGE UndecidableInstances #-} what I want is a typeclass with instances of type level Naturals here's the class, the parameter is of kind (* -> *) i.e. a is some sort of wrapper that maps from types to values > class Foo (a :: * -> *) where > type Bar a > bar :: a (Bar a) lets ignore DataKinds define Zero and Succ as distinct types uninhabited...but of kind "*" and "k -> *" > data Z1 > data S1 nat SNat1 :: * -> * > data SNat1 a where > SZ1 :: SNat1 Z1 > SS1 :: SNat1 a -> SNat1 (S1 a) off we go... > instance Foo SNat1 where > type Bar SNat1 = Z1 > bar = SZ1 now lets do it the datakind route > data Nat where > Z :: Nat > S :: Nat -> Nat ahhh...SNat is of kind "Nat -> *" > data SNat a where > SZ :: SNat 'Z > SS :: SNat a -> SNat ('S a) so I cant make it an instance of the same type class "The first argument of 'Foo' should have kind '* -> *', but 'SNat' has kind 'Nat -> *' In the instance declaration for 'Foo SNat'" > --instance Foo SNat where > -- type Bar SNat = 'Z > -- bar = SZ unless I redefine my class (which seems a bit silly) > class Foo' (a :: k -> *) where > type Bar' a :: k > bar' :: a (Bar' a) now it works. > instance Foo' SNat where > type Bar' SNat = 'Z > bar' = SZ clearly named kinds (?) are somehow distinct from unnames ones? CONFIDENTIALITY NOTICE This e-mail (and any attached files) is confidential and protected by copyright (and other intellectual property rights). If you are not the intended recipient please e-mail the sender and then delete the email and any attached files immediately. Any further use or dissemination is prohibited. While MTV Networks Europe has taken steps to ensure that this email and any attachments are virus free, it is your responsibility to ensure that this message and any attachments are virus free and do not affect your systems / data. Communicating by email is not 100% secure and carries risks such as delay, data corruption, non-delivery, wrongful interception and unauthorised amendment. If you communicate with us by e-mail, you acknowledge and assume these risks, and you agree to take appropriate measures to minimise these risks when e-mailing us. MTV Networks International, MTV Networks UK & Ireland, Greenhouse, Nickelodeon Viacom Consumer Products, VBSi, Viacom Brand Solutions International, Be Viacom, Viacom International Media Networks and VIMN and Comedy Central are all trading names of MTV Networks Europe. MTV Networks Europe is a partnership between MTV Networks Europe Inc. and Viacom Networks Europe Inc. Address for service in Great Britain is 17-29 Hawley Crescent, London, NW1 8TT.

2 1

Re: [Haskell-cafe] RFC: "Native -XCPP" Proposal
by Brandon Allbery 06 May '15

06 May '15

On Wed, May 6, 2015 at 11:36 AM, Stephen Paul Weber < singpolyma(a)singpolyma.net> wrote: > Yes. This is one of my favourite things in GHC-land -- that an existing, > good-enough, standardised, and widely-deployed solution was chosen over a > NiH reinvention of preprocessing I have to assume my irony detector is broken as well. Or maybe I should just assume that "all the world's Linux with gcc" is assumed to be forever true and forever reliable by "all right-thinking people" so let's just sweep the nonissue under the rug because it can oh so obviously never be a real issue.... Because I had to face this back a couple decades ago, when my employer ported an application written in a 4GL (database language) to SCO Unix. The 4GL assumed cpp was the ever reliable pcc one and broke very badly when SCO used one integrated into its lexer (making it even more tightly wedded to C syntax than clang's). Eventually we replaced its cpp with a wrapper that ran m4 and redid everything else in m4's syntax. Which is why I was always a bit worried about ghc relying on cpp, was unsurprised when clang caused issues, and am rather annoyed that there are people who believe that they can just ignore it because REAL users will always be on Linux with gcc and all them furriners using weird OSes like OS X and FreeBSD can safely be ignored with their not-the-One-True-OS-and-compiler platforms. Additional historical note that I assume True Believers will ignore as meaningless: X11 used to make the same assumption that cpp was always and forever guaranteed to be friendly to non-C and this still shows at times in things like xrdb resource databases. They did accept the inevitable and (mostly) stop abusing it that way, and are now moving away from imake which likewise assumes it's safe to use cpp on Makefiles. (And yes, I encounter the same inability to comprehend or accept change there.) -- brandon s allbery kf8nh sine nomine associates allbery.b(a)gmail.com ballbery(a)sinenomine.net unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net

1 0

How to define a type-level append?
by Bas van Dijk 06 May '15

06 May '15

Hi, At the bottom I have a type-level programming related question, but first some preliminaries: > {-# LANGUAGE GADTs #-} > {-# LANGUAGE TypeOperators #-} > {-# LANGUAGE TypeFamilies #-} > {-# LANGUAGE DataKinds #-} > > import GHC.TypeLits I've implemented a protocol where a client can send a packet of orders to a server. An OrderPacket is either empty (represented by the "NoOrders" constructor) or consists of an Order and possibly more orders (represented by the: "order :> orders" constructor). An Order is defined by a type-level list of numeric addresses and a command. The semantics is that the server should address the command to the list of addresses. When the client sends a packet of orders, the server has to return a reply for each command for each address in order. I lifted this expectation into the type signature so that when the client sends an order the type-checker will complain if it tries to pattern match on the wrong reply. The above is formalized with the following GADT for a packet of orders (I left out some off-topic stuff): > data OrderPacket replies where > NoOrders :: OrderPacket '[] > (:>) :: !(Order addrs cmd) > -> !(OrderPacket replies) > -> OrderPacket > (RepliesFor addrs cmd :++: replies) > > infixr 5 :> > > data Order (addrs :: [Nat]) command where > Order :: (Command command) > => !command -> Order addrs command > > class Command command where > type Response command :: * > -- I left out some encoding/decoding related methods. > > type family RepliesFor (addrs :: [Nat]) > (cmd :: *) :: [*] where > RepliesFor '[] cmd = '[] > RepliesFor (addr ': addrs) cmd = > Reply addr cmd ': RepliesFor addrs cmd > > type family (xs :: [*]) :++: (ys :: [*]) :: [*] where > '[] :++: ys = ys > (x ': xs) :++: ys = x ': (xs :++: ys) > > infixr 5 :++: > > data Reply (addr :: Nat) command = > Response !(Maybe (Response command)) > -- I left out some other stuff that can be in a reply. > Now my problem, I would like to have the ability to append two OrderPackets. I would say the following type properly reflects what I want: > append :: OrderPacket replies1 > -> OrderPacket replies2 > -> OrderPacket (replies1 :++: replies2) How would I implement this? The following naive defintion > append NoOrders ys = ys > append (x :> xs) ys = x :> append xs ys gives the following type error: src/Test.lhs:77:25: Could not deduce ((RepliesFor addrs cmd :++: (replies :++: replies2)) ~ (replies1 :++: replies2)) from the context (replies1 ~ (RepliesFor addrs cmd :++: replies)) bound by a pattern with constructor :> :: forall (addrs :: [Nat]) cmd (replies :: [*]). Order addrs cmd -> OrderPacket replies -> OrderPacket (RepliesFor addrs cmd :++: replies), in an equation for ‘append’ at src/Test.lhs:77:11-17 NB: ‘:++:’ is a type function, and may not be injective Expected type: OrderPacket (replies1 :++: replies2) Actual type: OrderPacket (RepliesFor addrs cmd :++: (replies :++: replies2)) Relevant bindings include ys :: OrderPacket replies2 (bound at src/Test.lhs:77:20) xs :: OrderPacket replies (bound at src/Test.lhs:77:16) x :: Order addrs cmd (bound at src/Test.lhs:77:11) append :: OrderPacket replies1 -> OrderPacket replies2 -> OrderPacket (replies1 :++: replies2) (bound at src/Test.lhs:76:3) In the expression: x :> append xs ys In an equation for ‘append’: append (x :> xs) ys = x :> append xs ys I suspect I need to adapt the type signature of "append" to suite the definition. Cheers, Bas

2 2