- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] A "real" Haskell Cookbook
by P. R. Stanley 23 Feb '07

23 Feb '07

Andrew and co, I have a big fat apology to make. It was actually the wikipedia page on Lambda Calculus where there are many occurrences of special symbols. The Wikibook, as far as I've explored, is fully accessible. Nonetheless, I'd still be more than happy to make my contributions in any way I can. I am a beginner to functional programming and so I could play a useful role in ensuring the text takes nothing for granted with regard to the fundamental principles and beyond. As a tip for anyone involved in writing and publishing scientific materials on the web, unless the maths is either written without any funny symbols or, better still, typeset in latex, it is not accessible to a screen-reader. One small point about the Haskell source code is that the column indentations do not always appear in the screen reader browse buffer. Of course, there are ways of getting around the issue and if the author of the Wikibook is interested we could discuss the details off list. Cheers, Paul At 16:22 22/02/2007, you wrote: >Can you guys point out an example of this in the wiki book? I've never >heard of this accessibility issue. I may even be willing to go back >through and modify the wikibook to make it more accessible of you can >explain what you're referring to. Accessibility is important to me. > >On 2/21/07, P. R. Stanley <prstanley(a)ntlworld.com> wrote: >>and can I please ask anyone thinking of using special symbols to >>resist the temptation. >>Symbols such as the &160 used liberally in the Haskell wikibook are >>totally invisible to screen readers. >>I would be happy to proof read any document before it goes to the >>wikibook to ensure it's fully accessible to screen readers. >> >>Regards, >>Paul >> >>At 03:17 22/02/2007, you wrote: >> >I made a preliminary page, and fleshed out some of the >> >headers/sub-headers on the wiki page for a good Haskell Cookbook >> >(aka NOT a PLEAC clone). Please contribute and/or fix the examples >> >and explanations so we can make a really nice Cookbook for newbies. :) >> > >> > http://haskell.org/haskellwiki/Cookbook >> > >> >_______________________________________________ >> >Haskell-Cafe mailing list >> >Haskell-Cafe(a)haskell.org >> >http://www.haskell.org/mailman/listinfo/haskell-cafe >> >>_______________________________________________ >>Haskell-Cafe mailing list >>Haskell-Cafe(a)haskell.org >>http://www.haskell.org/mailman/listinfo/haskell-cafe

4 3

process
by h. 23 Feb '07

23 Feb '07

Hello, I need to interact with some other program, and wrote the following code: module Main where import System.Process import System.IO main :: IO () main = do putStrLn "Running proc9..." (inp,out,err,pid) <- runInteractiveProcess "prog1" [] Nothing Nothing hSetBuffering inp LineBuffering hSetBuffering out LineBuffering hSetBuffering err LineBuffering hPutStrLn inp "1" a <- hGetLine out hPutStrLn inp a a <- hGetLine out waitForProcess pid putStrLn a But it does not work as I expected. As long as there is no need to put some input after having received some output it is no problem, but real interaction seems not possible. Is there a solution to work with the Handles as with stdin,... ? using ghc 6.6 on Windows Thanks in advance for your help.

8 13

exists . a psuedo-standard non-empty list module
by oleg＠pobox.com 23 Feb '07

23 Feb '07

Nicolas Frisby wrote: > Some of the code from the previous wiki link, type-level decimal > numbers I would rather advice against type-level decimal numbers, if we are looking at a lightweight solution. The [complete] code at http://www.haskell.org/haskellwiki/Non-empty_list is Haskell98! It also provides for a head and tail functions -- which are total and so raise no errors. Incidentally, inserting NList into the existing Safe.List does not seem like a good match as NList critically relies on being in a separate module with a limited export. NList constitutes a security kernel, whose invariants are to be described explicitly (and hopefully, automatically proven at some point). For that reason, it is beneficial to keep module NList separate and compact. It could of course be placed within Safe.* hierarchy, etc -- as a separate module. Neil Mitchell wrote: > Fortunately the problem of pattern match errors is being tackled by at > least two projects: > > * Catch: http://www-users.cs.york.ac.uk/~ndm/projects/catch.php > * ESC-Haskell: http://www.cl.cam.ac.uk/~nx200/research/escH-hw.ps I would submit the approach of the lightweight static capabilities (cf above Wiki link) to be counted as the third project in that area. The latter has an advantage that it is available in Haskell right now and requires no extra tools.

3 2

exists . a psuedo-standard non-empty list module
by Nicolas Frisby 23 Feb '07

23 Feb '07

I don't particularly like using fromJust or head, and there's been plenty of discussion on those issues. For the cases where it makes good sense to do so, I'm about to write a module for non-empty lists that looks to strike a balance between usability and static checks. But before I re-invent the wheel, I was wondering if there's already a popular module along those lines. I would also appreciate references to your favorite discussion about uses of head and other unsafe functions or various Oleg posts showing how they're all unnecessary. I'll find these on my own, but I would also like to know which ones strike a chord with the community. Thanks for your time. -Nick

4 5

Map list of functions over a single argument
by Paul Moore 23 Feb '07

23 Feb '07

I'm after a function, sort of equivalent to map, but rather than mapping a function over a list of arguments, I want to map a list of functions over the same argument. The signature would be [a -> b] -> a -> [b], but hoogle didn't come up with anything. It seems like an obvious analogue of map, so I'm pretty sure I'm missing something (otherwise, I'd just write it myself, and not bother :-)) Can anyone point me in the right direction? Thanks, Paul.

11 13

Re: [Haskell-cafe] TFP 2007: Registration and Program
by TFP 2007 23 Feb '07

23 Feb '07

>> >> Dear Colleagues, >> >> You may now resgister for TFP 2007! TFP 2007 will be held April 2-4, >> 2007 in New York City, USA. > April 2 is the first night of Passover. This is not one of those Your point is well taken. It is very unfortunate that the overlap you have pointed out exists. The organizing committee had to consider _many_ variables including, among others, the availability of a venue and of hotels for participants in NYC. Sometimes the logistics of a situation force your hand. ************************************************************************************ Dr. Marco T. Morazan TFP 2007 Program Committee Chair http://cs.shu.edu/tfp2007/

1 0

Prime finding
by Ruben Zilibowitz 23 Feb '07

23 Feb '07

I see that there has been some discussion on the list about prime finding algorithms recently. I just wanted to contribute my own humble algorithm: primes :: [Integer] primes = primesFilter 1 [2..] primesFilter :: Integer -> [Integer] -> [Integer] primesFilter primorial (n:ns) | (gcd primorial n == 1) = n : (primesFilter (primorial*n) ns) | otherwise = primesFilter primorial ns Comparing it to some of the algorithms in: http://www.haskell.org/pipermail/haskell-cafe/2007-February/022765.html It seems to perform reasonably well. It also has the advantage of being quite short. Ruben

3 5

HList, hOccurs and MonadReader
by Marc Weber 22 Feb '07

22 Feb '07

Having the module given below I can't see why using printAndRerun l1 printAndRerun2 l2 but not printAndRerun l1 printAndRerun l2 ? They only differ in their name. Can you point me in the right direction? ------------------------------------------------ {-# OPTIONS -fglasgow-exts #-} {-# OPTIONS -fallow-undecidable-instances #-} {-# OPTIONS -fallow-incoherent-instances #-} {-# OPTIONS -fallow-overlapping-instances #-} module HListTest.MonadReader where import HList hiding (liftIO) import Monad import Control.Monad.Reader printAndRerun = do v <- liftM hOccursFst ask liftIO $ print (v :: Int ) v2 <- liftM hOccursFst ask return (v2 :: String) printAndRerun2 = do v <- liftM hOccursFst ask liftIO $ print (v :: Int ) v2 <- liftM hOccursFst ask return (v2 :: String) a = (2 :: Int) b = "str" l a b = HCons a (HCons b HNil) --- l1 :: ( HCons Int (HCons String HNil)) l1 = l a b l2 = l b a printBoth f l = runReaderT f l >>= print printBoth2 l = do print (hOccurs l :: Int) print (hOccurs l :: String) hlistMonadReaderTest = do print "hlistMonadReaderTest" printBoth printAndRerun l1 -- printBoth printAndRerun l2 -- < this doesn't work but the next line ? Where is the difference between printAndRerun printAndRerun2 ? printBoth printAndRerun2 l2 -- ^ printBoth2 l1 -- here is no trouble.. printBoth2 l2 main = hlistMonadReaderTest ------------------------------------------------ when not commenting the line above I'm getting this error: HListTest/MonadReader.hs|35| 26: Couldn't match expected type `Int' against inferred type `[Char]' Expected type: HCons Int (HCons [Char] HNil) Inferred type: HCons [Char] (HCons Int HNil) In the second argument of `printBoth', namely `l2' In the expression: printBoth printAndRerun l2 Thanks Marc

2 2

functional database queries
by Henning Thielemann 22 Feb '07

22 Feb '07

At http://www.haskell.org/hawiki/HaskellDbTutorial it is described, how database queries can be modelled with a monad. However, I wonder if this is also possible without monads. Say, writing "DB.map col1 $ DB.filter (\row -> col2 row == 10+2) myTable" for "SELECT col1 FROM MyTable where col2 = 10+2"

4 8

TFP 2007: Registration and Program
by TFP 2007 22 Feb '07

22 Feb '07

Dear Colleagues, You may now resgister for TFP 2007! TFP 2007 will be held April 2-4, 2007 in New York City, USA. Our invited speaker is John McCarthy, Stanford University. Further details can be found at our homepage: http://cs.shu.edu/tfp2007/ . You may register at: http://cs.shu.edu/tfp2007/registration.html . The registration deadline is March 2, 2007 (11:59 p.m. EST). Accomodations information may be found at: http://cs.shu.edu/tfp2007/accomodations.html . We kindly remind you that the deadline to make a hotel reservation at the guaranteed rates offered to TFP 2007 participants is also quickly approaching. We are proud to announce our program of accepted talks: Unifying Hybrid Types and Contracts Jessica Gronski and Cormac Flanagan A Dual Semantics for the Data Description Calculus Yitzhak Mandelbaum, Kathleen Fisher, and David Walker A Metalanguage for Structural Operational Semantics Matthew Lakin and Andrew Pitts An Arrow Based Semantics for Interactive Applications Peter Achten, Marko van Eekelen, Maarten de Mol, and Rinus Plasmeijer Dependent Types: Easy as Pie Dimitrios Vytiniotis and Stephanie Weirich Constructing Correct Circuits -- Hardware Modelling with Dependent Types Edwin Brady, James McKinna, and Kevin Hammond Why Would Extensible Dependent Types Matter Pablo Nogueira and Bruno Oliveira Bytecode Verification for Haskell Robert Dockins and Samuel Z. Guyer UnreadTVar: Extending Haskell Software Transactional Memory for Performance Nehir Sonmez, Cristian Perfumo, Srdjan Stipic, Adrian Cristal, Osman S. Unsal, and Mateo Valero A New Functional Implementation of Grover's Fast Search Algorithm Justin Stallard and Murray Gross An Inference Algorithm for Guaranteeing Safe Destruction Manuel Montenegro, Ricardo Peña, and Clara Segura Hierarchical Master/Worker Skeletons Jost Berthold, Mischa Dieterle, Rita Loogen, and Steffen Priebe Property Directed Generation of First-Order Test Data Fredrik Lindblad Refactoring for Comprehension Gustavo Villavicencio Towards a Box Calculus for Hume Gudmund Grov and Greg Michaelson Scaled Regression: A Refinement of Primitive Recursion Daniel Leivant Equality-Based Uniqueness Typing Edsko de Vries, Rinus Plasmeijer, and David Abrahamson Lightweight Static Resources: Sexy Types for Embedded and Systems Programming Oleg Kiselyov and Chung-chieh Shan Space-Efficient Gradual Typing David Herman, Aaron Tomb, and Cormac Flanagan Use-Based Reference of Polymorphism Dave King and John Hannan Designing a Generic Graph Library Using ML Functors Sylvain Conchon, Jean-Christophe Filliatre, and Julien Signoles The SCIence Joint Research Activity Kevin Hammond, Dana Petcu, Phil Trinder, Abdallah Al Zain, Steve Linton, and Greg Michaelson Generic and Index Programming Jeremy Gibbons, Meng Wang, and Bruno C d. S. Oliveira The AHA Project Marko van Eekelen, Olha Shkaravska, Ron van Kesteren, Bart Jacobs, Sjaak Smetsers, and Erik Poll Studying Helium Program Bahaviour with the Neon Library Jurriaan Hage and Peter van Keeken Design and Implementation of JFP Hao Xu Hop Client-Side Compilation Florian Loitsch Adaptive High-Level Scheduling in a Generic Parallel Runtime Environment Jost Berthold, Abyd Al-Zain, and Hans-Wolfgang Loidl Bundles Pack Tighter than Lists Francisco Lopez-Fraguas, Juan Rodriguez-Hortala, and Jaime Sanchez-Hernandez Model-Based Testing of Thin-Client Web Applications and Navigation Input Pieter Koopman, Peter Achten, and Rinus Plasmeijer We look forward to seeing you at TFP 2007! Cheers, Marco ************************************************************************************ Dr. Marco T. Morazan TFP 2007 Program Committee Chair http://cs.shu.edu/tfp2007/

3 4