- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] Proposal: Shorter Import Syntax
by malcolm.wallace 06 Jun '15

06 Jun '15

Here are some more numbers. In our private code base of ~12,400 modules totalling >2,300,000 LoC, there are ~143,800 import lines, of which ~65,000 use the "as" syntax. Of those, ~8,000 have no "qualified", and the remaining ~57,000 use "qualified". So I make that about 5.6% of our imports. I think this is quite a lot higher than the Stackage figure, because this code is mostly applications rather than libraries, so it tends to use a larger range of imported functionality from lots of different semi-independent domains. The chance of naming-overlap for separate concepts is therefore much greater, leading to our common idiom for optional qualification of names with short module synonyms (often single letters). Regards, Malcolm On 03 Jun, 2015,at 08:08 PM, Anthony Cowley <acowley(a)seas.upenn.edu> wrote: I grepped through the source of all the packages in the Stackage Nightly package set and found that less 0.3% of imports use that syntax. It's a small number, but it's not zero, so the breakage would be unacceptable.

2 1

Rounding
by ok＠cs.otago.ac.nz 05 Jun '15

05 Jun '15

The Haskell 2010 report defines, in chapter 9, round :: (Real a, Fractional a, Integral b) => a -> b round x = let (n, r) = properFraction x -- n = truncate x, r = x-n (same sign as x) m = if r < 0 then n - 1 else n + 1 in case signum (abs r - 0.5) of -1 -> n -- round in if |r| < 0.5 1 -> m -- round out if |r| > 0.5 0 -> if even n then n else m (commented and slightly rearranged). The traditional definition of rounding to integer, so traditional that it is actually given in the OED, is basically round x = truncate (x + signum x * 0.5) There was a discussion of rounding recently in another mailing list and I put together this table: * Round x.5 OUT Ada, Algol W, C, COBOL, Fortran, Matlab, Pascal, PL/I, Python, Quintus Prolog, Smalltalk. The pre-computing tradition. * Round x.5 to EVEN Common Lisp, R, Haskell, SML, F#, Wolfram Language. * Round x.5 UP to positive infinity Java, JavaScript, ISO Prolog, Algol 60 * Rounding of x.5 UNSPECIFIED Algol 68, IMP 77 What I was wondering was whether anyone on this list knew why Haskell has the break-ties-to-even definition instead of the traditional break-ties-out one. (And please don't say that it is to get statistical unbiasedness, because given the kinds of data distribution I see, it _isn't_ unbiased.)

3 2

The evil GADTs extension in ghci 7.8.4 (maybe in other versions too?)
by Ki Yung Ahn 05 Jun '15

05 Jun '15

\y -> let x = (\z -> y) in x x is a perfectly fine there whose type is a -> a. (1) With no options, ghci infers its type correctly. (2) However, with -XGADTs, type check fails and raises occurs check. (3) We can remedy this by supplying some additional options (4) Howver, if you put -XGADTs option at the end, it fails again :( kyagrd@kyahp:~$ ghci GHCi, version 7.8.4: http://www.haskell.org/ghc/ :? for help Loading package ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> :t \y -> let x = (\z -> y) in x x \y -> let x = (\z -> y) in x x :: t -> t Prelude> :q Leaving GHCi. kyagrd@kyahp:~$ ghci -XGADTs GHCi, version 7.8.4: http://www.haskell.org/ghc/ :? for help Loading package ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> :t \y -> let x = (\z -> y) in x x <interactive>:1:30: Occurs check: cannot construct the infinite type: t0 ~ t0 -> t Relevant bindings include x :: t0 -> t (bound at <interactive>:1:11) y :: t (bound at <interactive>:1:2) In the first argument of ‘x’, namely ‘x’ In the expression: x x Prelude> :q Leaving GHCi. ~$ ghci -XGADTs -XNoMonoLocalBinds -XNoMonomorphismRestriction GHCi, version 7.8.4: http://www.haskell.org/ghc/ :? for help Loading package ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> :t \y -> let x = (\z -> y) in x x \y -> let x = (\z -> y) in x x :: t -> t Prelude> :q Leaving GHCi. ~$ ghci -XNoMonoLocalBinds -XNoMonomorphismRestriction -XGADTs GHCi, version 7.8.4: http://www.haskell.org/ghc/ :? for help Loading package ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Prelude> :t \y -> let x = (\z -> y) in x x <interactive>:1:30: Occurs check: cannot construct the infinite type: t0 ~ t0 -> t Relevant bindings include x :: t0 -> t (bound at <interactive>:1:11) y :: t (bound at <interactive>:1:2) In the first argument of ‘x’, namely ‘x’

2 1

Consecutive FFI calls
by David Turner 04 Jun '15

04 Jun '15

Hi, If I make a sequence of FFI calls (on a single Haskell thread) but which end up being called from different OS threads, is there any kind of ordering guarantee given? More specifically, is there a full memory barrier at the point where a Haskell thread migrates to a new OS thread? Many thanks, David

4 6

Pixel by pixel image processing
by Geraldus 03 Jun '15

03 Jun '15

Hi cafe! I want to do some trivial masking manipulation on PNG images: take a picture, crop it to square shape and then make a circular mask, i.e. take all pixels that lies outside circle with radius equal to half of image width and placed at image center and replace that pixels with zero opacity once (hope this description is clear enough). I've found two packages for image processing so far: `friday` [1] and `unm-hip` [2], but can't figure out which of them suits my needs, maybe there are some other packages I miss? [1] https://hackage.haskell.org/package/friday [2] https://hackage.haskell.org/package/unm-hip

4 4

Haskell dev role in Strats at Standard Chartered (Singapore)
by Don Stewart 03 Jun '15

03 Jun '15

I have an open position for a Haskell developer to join Standard Chartered's Strats team in Singapore. More details at: https://donsbot.wordpress.com/2015/06/03/haskell-dev-role-in-strats-at-stan… -- Don

1 0

Blog platform written in Haskell
by Nicola Gigante 03 Jun '15

03 Jun '15

Hi all, Is there a blog platform written in Haskell? I mean something dynamic (as opposed to a static site generator like hakyll) like WordPress but written in Haskell. Does something like that exist? Greetings, Nicola

9 13

Four Designs for a Monad
by Zemyla 03 Jun '15

03 Jun '15

I'm working on writing a Haskell wrapper for the GNU Lightning code generation library (http://www.gnu.org/software/lightning/) which in C consists of a series of macros that write to a certain global state in a pointer _jit, such as jit_add or jit_call. Now, I figure that can be wrapped fairly simply in a monad, which we'll call the Lightning monad: -- syntax given here is just a sample. incr = lightningEmit $ do prolog in <- arg getArg R0, in addi R0, R0, 1 retr R0 However, I've come up with four possible designs for the Lightning monad. All but one would be reader monad transformers holding the pointer to the JIT state. 1) Lightning m a, where m is a MonadIO. Pros: Users have the power of the monads they are using within. Cons: Complexity, especially with having to handle monads with multiple returns like ListT. 2) Lightning a, which just wraps IO, and is a MonadIO. Pros: Allows the use of other IO functions in the monad. Cons: Allows the use of other IO functions in the monad. 3) Lightning a, which just wraps IO, and is not a MonadIO. Pros: Simplicity; possibly permitting the code generation to be unwrapped with unsafePerformIO. Cons: Referential integrity could still be violated. 4) Lightning a, which would be a free monad over the Lightning operations allowed. Pros: Evaluation (in the IO monad) would be certain to be pure, which would permit or accommodate it being a monad transformer, or converted to a pure function on architectures where the Lightning library is not available. Cons: Assembling, then disassembling to reassemble, a long list of instructions produces significant overhead, rendering it less suitable for JIT purposes. Interacting with the generated code is more difficult. Are there any other options I am missing? Are there any possibly game-changing pros or cons I have failed to notice? Thanks, Paul Drees

1 0

I think someone had a complicated program to use brackets for array indexing - is it possible to use a DSL for this?
by KC 02 Jun '15

02 Jun '15

I think someone had a complicated program to use brackets for array indexing - is it possible to use a DSL for this? That is, to use myArray [5] and have a DSL convert it to standard Haskell syntax -- -- Sent from an expensive device which will be obsolete in a few months! :D Casey

6 10

ANN: Bayhac 2015 June 12, 13, 14 in Mountain View, CA
by Byron Hale 02 Jun '15

02 Jun '15

Bayhac 2015 will be held June 12, 13, 14 at Hackers Dojo in Mountain View, CA. See http://bayhac.org/ to register. Light rail service is available from Caltrain to near Hackers Dojo. In addition, there can be shuttle service from Caltrain first thing in the morning and in the evening. Some known speakers are: Conal Elliott, Phil Freeman, Greg Weber, and Dan Burton You! If you would like to give a talk, send an email to bayhac2015-admin(a)googlegroups.com with the title and a brief explanation of what the talk will be on. It can be on anything Haskell related! We are also looking out for people who might be interested in conducting a more hands-on workshop. Twitter: https://twitter.com/bayhac2015 Byron Hale byron.hale(a)einfo.com @Hale_ByronL

1 0