- Haskell-Cafe - Haskell.org

Bay Area talk tomorrow, on concurrent/parallel Haskell
by Bryan O'Sullivan 28 Feb '08

28 Feb '08

Satnam Singh of Microsoft Research will be speaking about concurrent and parallel programming at Stanford tomorrow. Details here: http://www.realworldhaskell.org/blog/2008/02/28/stanford-haskell-talk-2008-… <b

2 1

Rendering TTF fonts in Haskell and OpenGL
by Jefferson Heard 28 Feb '08

28 Feb '08

In C and in Java, I can use truetype fonts in Haskell using select libraries, and I'd like to be able to do the same in Haskell. Are there any portable libraries out there for loading fonts into OpenGL geometry for Haskell? I can use the vector fonts from GLUT is absolutely neccessary, but I'd like something that looks a little more professional. Are there any suggestions? -- Jeff -- I try to take things like a crow; war and chaos don't always ruin a picnic, they just mean you have to be careful what you swallow. -- Jessica Edwards

7 8

ANNOUNCE: type-level 0.1: Haskell type-level programming library
by Alfonso Acosta 28 Feb '08

28 Feb '08

The goal of the "Type-level" library is to standardize and extend the features offered by the multiple (and heterogeneous) type-level programming implementations already around. To date, type-level Booleans and arbitrary sized Naturals are supported. I implemented a few things I didn't see in any other type-level programming libraries: * Numerals use decimal representation to make error reports friendlier. * Type-level numerals can be intuitively typed in different bases (although everything is internally represented in base 10) by using aliases: D16 represents the type-level decimal 16 B1010 represents the type-level binary 1010 076 represents the type-level octal 76 HFF represents the type-level hexadecimal FF * All basic arithmetic operations are supported (including logarithm and exponentiation in any base) * The library provides reification of Naturals and Booleans (from value-level to type-level) . To get the code: HackageDB page (including haddock documentation): http://hackage.haskell.org/cgi-bin/hackage-scripts/package/type-level-0.1 Darcs repository: http://code.haskell.org/type-level/ Big Thanks to Oleg and Wolfgang for their suggestions and contributions. Actually, most of the implementation of Naturals is based on Oleg's "Binary Type Arithmetic" http://okmij.org/ftp/Haskell/types.html#binary-arithm

1 0

Haskell Jobs
by Tom Hawkins 28 Feb '08

28 Feb '08

Hi, We have an opening for a software engineer, with the potential for a lot of Haskell development. Our group at Eaton (http://www.eaton.com/) develops real-time control software for vehicle and machinery applications. This position is specifically for the design and verification of hydraulic hybrid vehicle systems. Think Toyota Prius, but with a accumulator and hydraulic pump instead of a battery and an electric motor. That, and these vehicles can weight over 30,000 pounds. The primary tasks would include vehicle software design, system verification with simulation and possibly formal analysis, telemetry development for remote diagnostics, and tool development to further automate our design flows. Currently we use Haskell for our in-house data analysis tools, and some vehicles run code partially generated by a Haskell DSL. We hope to expand our use of Haskell, especially for simulation regression suites -- maybe QuickCheck in combination with a system modeling and verification DSL. If interested, send a resume. Thanks! -Tom

1 0

ANNOUNCE: hsparklines 0.1.0 - A sparklines implementation in Haskell
by Hitesh Jasani 27 Feb '08

27 Feb '08

Sparklines are small, word sized graphs that can be interspersed with text to provide context and enhance communication. There are implementations in many languages and even some web services that will generate them on the fly. I was looking for a Haskell solution and finding none, wrote my own. * http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsparklines-0.1.0 * http://www.jasani.org/2008/02/initial-release-of-hsparklines-010.html On a side note, while writing my blog entry I decided to generate a sparkline for the number of uploads to hackage. If it's any indication, the Haskell community is growing by leaps and bounds. - Hitesh

3 3

where is module System.Posix.Types?
by Galchin Vasili 27 Feb '08

27 Feb '08

Hello, I don't see the types modules in with the other modules in the Posix pacakage, ?? Thanks, Vasya

2 1

Just a quick question
by Imam Tashdid ul Alam 27 Feb '08

27 Feb '08

A few days back, I *think* I stumbled upon the statement "the interaction between GADTs and functional dependencies is not yet well understood". Then I glossed over it. Now that I have (finally) started understanding what GADTs are meant to do, I am somewhat terrified. Did I read that one correctly? Or was it "... between GADTs and *typeclasses*..."? Was it? Gah. That would be disastrous. ____________________________________________________________________________________ Never miss a thing. Make Yahoo your home page. http://www.yahoo.com/r/hs

2 1

Re: [Haskell-cafe] fast integer base-2 log function?
by Jens Blanck 27 Feb '08

27 Feb '08

> {-# LANGUAGE MagicHash #-} > import GHC.Exts > import Data.Bits > > -- experiment with using a LUT here (hint: FFI + static arrays in C) > ilog2i0, ilog2i1, ilog2i2, ilog2i3, ilog2i4 :: Int -> Int -> Int > ilog2i0 k x | x .&. 0xFFFF0000 /= 0 = ilog2i1 (k + 16) (x `shiftR` 16) > | otherwise = ilog2i1 k x > ilog2i1 k x | x .&. 0xFF00 /= 0 = ilog2i2 (k + 8) (x `shiftR` 8) > | otherwise = ilog2i2 k x > ilog2i2 k x | x .&. 0xF0 /= 0 = ilog2i3 (k + 4) (x `shiftR` 4) > | otherwise = ilog2i3 k x > ilog2i3 k x | x .&. 0xC /= 0 = ilog2i4 (k + 2) (x `shiftR` 2) > | otherwise = ilog2i4 k x > ilog2i4 k x | x .&. 0x2 /= 0 = k + 1 + (x `shiftR` 1) > | otherwise = k + x > > log2i :: Integer -> Int -- actually returns bit length, and returns > garbage on negatives, but do you care? > log2i (J# len adr) = ilog2i0 0 (I# (indexIntArray# adr (len -# 1#))) + I# > (32# *# (len -# 1#)) > log2i (S# sml) = ilog2i0 0 (I# sml) > > I tried the above but I got wrong results on 2^31..2^32-1 because in the additions in ilog2i4, the number x was -1 because of sign extension performed by the shifts all the way (thanks for the ghci debugger). (So, yes, I do care somewhat about garbage on negatives :) I modified to the following hoping also to use both on 32 and 64 bit machines. Have I shot myself in the foot anyway? For example, is there a guarantee that the most significant limb is non-zero? Is there any possibility of this or some related function being added to Data.Bits? {-# LANGUAGE MagicHash #-} import GHC.Exts import Data.Bits limbSize = bitSize (0 :: Int) ilog2 k x = case limbSize of 64 -> ilog2i0 k (fromIntegral x) 32 -> ilog2i1 k (fromIntegral x) _ -> undefined -- experiment with using a LUT here (hint: FFI + static arrays in C) ilog2i0, ilog2i1, ilog2i2, ilog2i3, ilog2i4, ilog2i5 :: Int -> Word -> Int ilog2i0 k x | x .&. 0xFFFFFFFF00000000 /= 0 = ilog2i1 (k + 32) (x `shiftR` 32) | otherwise = ilog2i1 k x ilog2i1 k x | x .&. 0xFFFF0000 /= 0 = ilog2i2 (k + 16) (x `shiftR` 16) | otherwise = ilog2i2 k x ilog2i2 k x | x .&. 0xFF00 /= 0 = ilog2i3 (k + 8) (x `shiftR` 8) | otherwise = ilog2i3 k x ilog2i3 k x | x .&. 0xF0 /= 0 = ilog2i4 (k + 4) (x `shiftR` 4) | otherwise = ilog2i4 k x ilog2i4 k x | x .&. 0xC /= 0 = ilog2i5 (k + 2) (x `shiftR` 2) | otherwise = ilog2i5 k x ilog2i5 k x | x .&. 0x2 /= 0 = k + 1 + fromIntegral (x `shiftR` 1) | otherwise = k + fromIntegral x log2i :: Integer -> Int -- actually returns bit length log2i (J# len adr) = ilog2 0 (I# (indexIntArray# adr (len -# 1#))) + I# (32# *# (len -# 1#)) log2i (S# sml) = ilog2 0 (I# sml)

4 3

Trouble finding exception source
by Denis Bueno 27 Feb '08

27 Feb '08

Hi all, I've got some code crashing with "Prelude.foldr1: empty list". In GHCi, the code uses too much memory (I kill it after it consumes 1GB) to be able to use :trace and :history, but I just found out about the -xc RTS option. I tried that, and I get the following: <GHC.List.CAF>dsat: Prelude.foldr1: empty list Now, manually going through GHC.List (http://haskell.org/ghc/docs/latest/html/libraries/base/src/GHC-List.html) I only found one CAF, namely prel_list_str, at the bottom of the file. However, it is late and I quite possibly missed something. This CAF, of course, doesn't seem a likely culprit. I also stumbled on some discussion of the explicit call stack (http://hackage.haskell.org/trac/ghc/wiki/ExplicitCallStack/StackTraceExperi…) which exemplifies the behavior I've found, but doesn't seem to suggest a way to fix it. I'm developing on GHC 6.8.2. I've attached my code, the output of a cabal sdist, which requires parse-dimacs [0] and bitset [1] (both cabalised) to build. If you build the executable (with profiling), you should see my behavior by running: ./dist/build/dsat/dsat -verify +RTS -xc I know that the problem is somewhere in the "Backtracking" section, in the backJump function. But I don't know where. Any help is appreciated. -- Denis [0] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parse-dimacs-1.0… [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bitset-0.5

3 4

Stack overflow
by Grzegorz Chrupala 27 Feb '08

27 Feb '08

Hi all, I have a very simple program which reads a Data.Map from a file using Data.Binary and Data.ByteString.Lazy, which gives stack overflow with files over a certain size. Any ideas of what might be causing it? You can try it with the small file (11M) at: http://computing.dcu.ie/~gchrupala/map.bin import System import Data.Map import qualified Data.ByteString.Lazy as BS import Data.Binary main = do [path] <- getArgs m <- fmap decode (BS.readFile path)::IO (Map (Int,Maybe String) Int) putStrLn . show . findMax $ m -- Grzegorz -- View this message in context: http://www.nabble.com/Stack-overflow-tp15479718p15479718.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

5 13