- Haskell-Cafe - Haskell.org

job writing security software in Haskell
by Andrew Pimlott 25 Sep '06

25 Sep '06

Planning Systems, Inc. has a job opportunity for Haskell programmers. My synopsis is below, and the official description is at http://www.plansys.com/careers/job_details.cfm?JobID=28 Write Haskell code for a US government contractor. Projects include a high-assurance authorization system build around Soutei: http://okmij.org/ftp/Prolog/#Soutei Job is located in Monterey, CA, Slidell, LA, or Portsmouth, VA; working remotely is probably not an option. US citizenship required. Desirable experience: - Haskell - Logic programming - Formal methods - Network security - Web services I welcome you to ask me for more information, and please pass this along to Haskellers looking for a job who can meet the citizenship and (re-)location requirements. Andrew

1 0

Haskell DLL crashes Excel
by Andreas Marth 25 Sep '06

25 Sep '06

Hi everybody! As you might now already know I try to let VBA call Haskell via a DLL. The function returns a String. Everything works fine now if I call the function only once. If I call it more often Excel crashes soon. Does any body have any idea what is going wrong or how I can find out. (I am a medium skilled Haskell user but no VBA programmer.) My code for Haskell (Calculate.hs): module Calculate where import Foreign.C.String (CString, peekCString, newCString) import Data.Word (Word8, Word16, Word32) import Data.Bits (shiftR, (.&.)) import Foreign.Marshal.Array (newArray) import Foreign.Ptr (Ptr, plusPtr) type BSTR8 = Ptr Word8 createBSTR8 :: String -> IO BSTR8 createBSTR8 s = do let len :: Word32 = fromIntegral (length s) low_l :: Word8 = fromIntegral (len .&. 0xFFFF) low_h :: Word8 = fromIntegral (shiftR len 8 .&. 0xFFFF) high_l :: Word8 = fromIntegral (shiftR len 16 .&. 0xFFFF) high_h :: Word8 = fromIntegral (shiftR len 24 .&. 0xFFFF) arr <- newArray ([low_l,low_h,high_l,high_h] ++ map (fromIntegral . fromEnum) s ++ [0]) return $! plusPtr arr 4 testL :: Int -> CString -> IO BSTR8 testL n cs = do s <- peekCString cs createBSTR8 $ concat $ take n $ repeat s foreign export stdcall testL :: Int -> CString -> IO BSTR8 --------------------------------------------------------------- My VBA code (in Excel 2000): Option Explicit Dim h1 As String Dim a As Long Dim b As Long Private Declare Function testL Lib "P:\Daten\Code\Calculate.dll" (ByVal n As Long, ByVal str As String) As String Sub Test() a = 0 b = 10 h1 = "" Do While a <= 15 h1 = testL(b, "What is going on here?") a = a + 1 Debug.Print a Debug.Print h1 Loop End Sub ----------------------------------------------------------- And my DllMain.c: #include <windows.h> #include <Rts.h> extern void __stginit_Calculate(void); static char* args[] = { "ghcDll", NULL }; /* N.B. argv arrays must end with NULL */ BOOL STDCALL DllMain ( HANDLE hModule , DWORD reason , void* reserved ) { if (reason == DLL_PROCESS_ATTACH) { /* By now, the RTS DLL should have been hoisted in, but we need to start it up. */ startupHaskell(1, args, __stginit_Calculate); return TRUE; } if (reason == DLL_PROCESS_DETACH) { shutdownHaskell(); return TRUE; } return TRUE; } ---------------------------------------------------------------- And I compile the DLL with: ghc -c --make -fglasgow-exts -static Calculate.hs ghc -c -fglasgow-exts -static *.c ghc --mk-dll -o Calculate.dll *.o -static -optdll--def -optdllCalculate.def ------------------------------------------------------------------ Nearly forgot Calculte.def: LIBRARY Calculate EXPORTS testL = testL@8 ----------------------------------------------------------------- The DLL is stable regarding the length of the input string and thelength of the return string (determined with b). But crashes for larger(?) a's. At my computer it crashes with a >9. There seems to be a connection between b and a. If b is 10 then a>9 crashes a<10 is fine. If b=1000 then a<5 is okay a>4 crashes. If b =100 then a<5 is okay, a>5 crashes and a=5 crashes with an error "Statement in 0x778cb032 points to 0x00000000 the function 'written' could not be done ..." And a second one "Statement in 0x778cc441 points to 0x00000000 the function 'written' could not be done ..." (My translation of the german errors.) If anybody knows what is going wrong or can give me a hint how to find out what is going wrong it would be very helpful. Thanks Andreas

4 6

Re: [Haskell] BitSyntax for Haskell
by Einar Karttunen 25 Sep '06

25 Sep '06

On 23.09 15:00, Adam Langley wrote: > Erlang's bit syntax[1] is a great for building and breaking up binary > structures. I've knocked up something similar (although a little > clumsy) for Haskell: > > http://www.imperialviolet.org/binary/bitsyntax/ > http://www.imperialviolet.org/binary/bitsyntax/BitSyntax.hs > > I'm sure that this isn't the best possible way to do this, but it > suffices at this stage for many problems. This looks very nice. Here are some feature wishes: BitBlock: add a way to encode length prefixed ByteStrings. For the decoding part: * Provide a monadic interface * Add a test part to ReadType: Test :: ReadType a -> (a -> Bool) -> ReadType Test (or a -> m ()) in the monadic case. * Add a way to limit the size of a LengthPrefixed: e.g. [Unsigned 4, LengthPrefixed] is very unsafe, the app should have a way to control the maximum length. - Einar Karttunen

1 0

System threads?
by Lyle Kopnicky 25 Sep '06

25 Sep '06

Hi folks, I'm working on a project for which the solution is highly parallelizable. I've been writing it so far for GHC as a single-threaded app. I'd like to be able to split the job into multiple pieces, and spawn different system threads for each piece, so they will run on separate CPUs. Either each thread needs to write to the same IO handle, or else the results need to be collected when the threads are merged, so the results can all be printed. I'm working on Linux. What's the easiest way to accomplish this? Glasgow Parallel Haskell? Is there a Posix.Threads library? I understand that Haskell threads (Control.Concurrent) all run in one system thread, so would not take advantage of SMP. I suppose in the worst case I can write a shell program that divides up the problem, runs several worker processes to output intermediate results to files, then combines the results to the desired filehandle. Thanks, Lyle

4 3

Unable to profile program using Data.ByteString.Lazy
by Lyle Kopnicky 25 Sep '06

25 Sep '06

Hi folks, I wrote a program that uses some of the Data.ByteString libraries. I'm using GHC 6.4.1 and FPS 0.7. The program compiles and works just fine. But when I try to profile it, by compiling with -prof, I get: Failed to load interface for `Data.ByteString.Lazy': Could not find module `Data.ByteString.Lazy': locations searched: Data/ByteString/Lazy.hi Data/ByteString/Lazy.hi-boot /f/g/lib/fps-0.7/Data/ByteString/Lazy.p_hi Why can it find the module when it's compiling without -prof, but not when it's compiling with it? I would really like to get profiling to work. Thanks, Lyle

2 3

FFI and LD_PRELOAD -> segfault
by Stephan Walter 24 Sep '06

24 Sep '06

Hi, I'm trying to use a shared lib written in Haskell to overload C functions via LD_PRELOAD. You might think this is a bit silly, but hey, why not? I want to overload connect() from sys/socket.h. I'll document what I've written so far; unfortunately there doesn't seem to be a lot of documentation about this topic. This is my haskell code (in testffi.hs): > module Socks where > > import Foreign.C.Types > import Foreign.Ptr > > newtype S_sockaddr = S_sockaddr () > > foreign export ccall "connect" connect :: > CInt -> Ptr (S_sockaddr) -> CUInt -> IO CInt > > connect :: CInt -> Ptr (S_sockaddr) -> CUInt -> IO CInt > connect _ _ _ = return (-1::CInt) Here's how I compile it: ghc -Wall -c -fffi testffi.hs ghc -Wall -optl "-shared" -optl "-Wl,-soname,libtestffi.so" \ -o libtestffi.so testffi.o testffi_stub.o I'm not at all sure about these compiler and linker options, but this is the best I could come up with (i.e., no errors or warnings) Then I run a test program which calls connect(). I won't include the C source of that program, but it basically connects to the IP address given as the first argument (at port given by third argument) and sends a string. Basic error checking is done, i.e. the program does test the return value of connect(): LD_PRELOAD=./libtestffi.so ./conntest 127.0.0.1 "HELO" 1234 This aborts with a segfault in scheduleWaitThread() from ./libtestffi.so The test program doesn't use threads, so I'm wondering what I did wrong? Any help is appreciated. Greetings, Stephan Walter

2 4

haskell.org down
by Pasqualino 'Titto' Assini 24 Sep '06

24 Sep '06

Haskell.org has been down for over 7 hours (see attached log). The Web master might use host-tracker.com (or a similar free tracking service) to keep an eye on it. Regards, titto _____ From: HostTracker Notifier [mailto:noreply@host-tracker.com] Sent: 24 September 2006 10:41 To: tittoassini(a)gmail.com Subject: Operation Restored Alert Hello, http://haskell.org is now back to normal. Operation restored at 2006-09-24 10:36:55. Url was down as a resultat of: Http error:Http_client.No_reply Error was detected at 2006-09-24 03:36:16 Downtime total 7 hour(s) 39 sec(s). Check failures total: 14. Your login:titto -- Best regards, http://host-tracker.com/ support team uid:957058 tid:188350 eid:188350-61-0-0-669df3829d00102989dd000c7651f68b ffeid:188350-47-0-0-a2bced5e9cc5102989dd000c7651f68b

1 0

[newbie] How to test this function?
by Bruno Martínez 23 Sep '06

23 Sep '06

I've written a function that looks similar to this one getList = find 5 where find 0 = return [] find n = do ch <- getChar if ch `elem` ['a'..'e'] then do tl <- find (n-1) return (ch : tl) else find n First, how do I fix the identation of the if then else? Second, I want to test this function, without hitting the filesystem. In C++ I would use a istringstream. I couldn't find a function that returns a Handle from a String. The closer thing that may work that I could find was making a pipe and convertind the file descriptor. Can I simplify that function to take it out of the IO monad? How? I thought about getContents, but that eats all input. Thanks in advance, Bruno

9 17

Haskell Program
by Tim Newsham 23 Sep '06

23 Sep '06

The company I work for was gracious enough to allow me to release a haskell program I wrote for them: http://www.isecpartners.com/file_fuzzers.html There's a python version and a rewrite in haskell. I used some looping constructs discussed earlier on this list to keep the haskell code similar to its original python code. Don Stewart was kind enough to help me optimize some of the code using ByteString and a faster PRNG (the System.Random class seems to be a bit on the slow side!). Prior to using ByteString and optimizing the code it was a bit slower than the python version, but with optimizations it is quite a bit faster. (In practice, the external program being invoked is usually the performance bottleneck). Tim Newsham http://www.thenewsh.com/~newsham/

3 2

Polymorphism/monomorphism (and the restriction)
by Aaron McDaid 22 Sep '06

22 Sep '06

Hi, I think the following might help a little in understanding the monomorphic restriction (which I don't fully understand myself). I'm a bit of a newbie so apologies in advance if I've made a mistake or if my description isn't as useful to others as it seems to me. I've been following a thread on haskell(a)haskell.org and I think the below might help. I used GHCi, version 6.2.2 (it fails in hugs but that seems to be because of hugs non-compliance with the standard in this case). First off, I'm guessing that I'm getting Haskell98 behaviour here and not some GHCi extension. Please tell me if this is not the case. Run the code listing at the bottom of this email and you should get the output which I've also listed below. This code experiments with "Int", "Float" and "(Num a) => a", and I tried to print x*2 and x/2 for each. (4::Int)/2 isn't allowed because / isn't defined for Ints. You can see that kN :: (Num a) => a took two different types depending on what method ( / or * ) was applied to it. kN / 2 = 2.0 kN * 2 = 8 kN/2 is a Float (it can't use Int as / isn't defined for Int, so it uses Float, for which / is defined). kN*2 is an Int. The above outputs demonstrates polymorphism, doesn't it? i.e. Not only has the compiler got a variety of types to choose from, but a variety of types can be used at runtime? The output for kI and kF is obvious. The interesting thing is that k behaves as a Float in both cases. This is monomorphism isn't it? i.e. the compiler may have a variety of types to choose from, but it picks one and sticks to it for every usage. In summary, k didn't give the same outputs as kN. And the monomorphism restriction is a rule which means that sometimes things are forced to a monomorphic type (like k as Float here) when it could have given it a polymorphic type like "kN :: (Num a) => a" I'm fairly new to these lists, so apologies if I'm covering old ground again. My first aim is to understand exactly what polymorphism and monomorphism is and demonstrate corresponding results, before thinking about the restriction. Thanks, Aaron -- The code kI :: Int kI = 4 kF :: Float kF = 4 kN :: (Num a) => a kN = 4 k = 4 main = do p "kI * 2" $ kI * 2 p "kF / 2" $ kF / 2 p "kF * 2" $ kF * 2 p "kN / 2" $ kN / 2 p "kN * 2" $ kN * 2 p "k / 2" $ k / 2 p "k * 2" $ k * 2 p :: (Show a) => String -> a -> IO () p s = putStrLn.(s++).(" = "++).show -- the output - remember kI / 2 is not possible. kI * 2 = 8 kF / 2 = 2.0 kF * 2 = 8.0 kN / 2 = 2.0 kN * 2 = 8 k / 2 = 2.0 k * 2 = 8.0 -- PS: If you delete the k / 2 line from the program, then k * 2 becomes simply 8 (not 8.0). It uses Int if possible, and Float if that's not available.

2 1