October 2008 - Haskell

Abusing quickcheck to check existential properties
by nr＠cs.tufts.edu 23 Oct '08

23 Oct '08

I recently used QuickCheck to check on some calculations for image compression. (I love exact rational arithmetic!) But I thought only to check for inverse properties, and I realized afterward I had failed to check for ranges. For example I should have checked that boundedB block = -1 <= b && b <= 1 where Cos a b c d = cos_of_block block which turns out to be correct. But actually my calculations were wrong, and the real bounds on b are not +/- 1 but rather +/- 0.5, so I might equally well have passed a more stringent test. It's quite embarrassing as I have only 5 bits of precision to represent b, and throwing away a bit on values that don't exist is not the best idea I have had recently. What I would really like to do is write some combinators for interval checking that say * It is a *universal* property that for *every* input, the output lies within the stated interval. * It is an *existential* property of *some* input that the output lies close to the ends of the stated interval. But how do I use QuickCheck to check an existential? I realize I could run boundsNotAchieved block = -0.9 <= b && b <= 0.9 where Cos a b c d = cos_of_block block and then if the test of boundsNotAcheived fails, my test passes (by exists x : P(x) iff not forall(x) : not P(x)). But if I set up a test suite in which some tests are supposed to fail and others are supposed to succeed, I will never keep track of which is which. I would like to build an existential test. Is it sufficient for me to write boundsAchieved block = expectFailure (-0.9 <= b && b <= 0.9) where Cos a b c d = cos_of_block block and then run 'quickCheck boundsAchieved'? In the long run I'd love something like fillsIntervalWithin :: (Num a, Ord a, Arbitrary a) => (a, a) -> a -> a -> Property with the idea that I want to test the partial application fillsIntervalWithin (lo, hi) epsilon and have the test succeed if every input x satisfies lo <= x <= hi and if some input x satisfies not (lo + epsilon <= x <= hi - epsilon). I'm betting someone on this list has already thought about similar problems and can advise me. (Because I have yet to write the specialized instance declaration for Arbitrary that guarantees the numerical invariants of the inputs, I have yet to test any of the examples in this email.) Norman

7 8

REMINDER: Haskell Communities and Activities Report
by Janis Voigtlaender 21 Oct '08

21 Oct '08

Dear Haskellers, The deadline for the November 2008 edition of the Haskell Communities and Activities Report is only ten days away. If you haven't already, please write an entry for your new project, or update your old entry. Please mail your entries to hcar(a)haskell.org in plain text or LaTeX format. More information can be found in the original Call for Contributions at: http://www.haskell.org/pipermail/haskell/2008-October/020651.html I look forward to receiving your contributions. Thanks a lot, Janis (current editor) -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de

1 0

Re: [Haskell] Probably a trivial thing for people knowing Haskell
by Friedrich 21 Oct '08

21 Oct '08

Marshall Beddoe <unmarshal(a)gmail.com> writes: > Also, read some chapters from here: > http://book.realworldhaskell.org/read/ > > Indispensable examples for writing higher performance log processing > code. I hope this book will soon be send out. I ordered my copy of course ;-) Howerver even if Strings are bad I can not see why they are hanging around so long. I open a file a read it line by line and I close the file so all read string are "garbage" and getting rid of them should not be that hard or should it? Regards Friedrich

7 12

Probably a trivial thing for people knowing Haskell
by Friedrich 21 Oct '08

21 Oct '08

I've written just a few programs in Haskell one in a comparison for a task I had "nearly daily". The code analyzes Apache logs and picks some certain stuff from it and after that calculates a bit around with it. Here's the code module Main where import System import System.IO import System.Directory import System.IO.Error import Text.Regex import Control.Monad regexp = mkRegex ("([0-9]+) Windows ex") main = do files <- show_dir "[0-9].*" (sum,count) <- run_on_all_files (0,0) files let dd = (fromIntegral (sum::Integer))/ (fromIntegral (count::Int)) in putStr("Download = " ++ show sum ++ " in " ++ show count ++ " days are " ++ show dd ++ " downloads/day\n") run_on_all_files (a,b) [] = return (a,b) run_on_all_files (a,b) (x:xs) = do (s,c) <- run_on(a,b) x run_on_all_files (s,c) xs run_on (a,b) file_name = do handle <- openFile file_name ReadMode (sum,count) <- for_each_line (a,b) handle hClose handle return ((sum,count)) for_each_line (sum,count) handle = do l <- try (hGetLine handle) case l of Left err | isEOFError err -> return(sum,count) | otherwise -> ioError err Right line -> do let (nsum, ncount) = check_line line sum count for_each_line (nsum,ncount) handle check_line line sum count = let match = matchRegex regexp line in case match of Just strs -> (sum + read (head strs) :: Integer, count + 1) Nothing -> (sum, count) show_dir regmatch = do files <- getDirectoryContents "." let reg = mkRegex regmatch in return(filter (\file_name -> let fm = matchRegex reg file_name in case fm of Just strs -> True Nothing -> False) files) The point is this code works if there are just say a few files files to check. But it trashes my machine with around 1751 files. It sucks memory as wild and so it does not run as I think it should. I think I've overseen something which is bad written. Would you mind to tell me where I did "extraordinarily" bad. With best regards Friedrich

7 11

Re: [Haskell] Probably a trivial thing for people knowing Haskell
by Friedrich 21 Oct '08

21 Oct '08

Taral <taralx(a)gmail.com> writes: > On Sat, Oct 18, 2008 at 1:50 AM, Friedrich > <frido(a)q-software-solutions.de> wrote: >> I've written just a few programs in Haskell one in a comparison for a >> task I had "nearly daily". >> >> The code analyzes Apache logs and picks some certain stuff from it and >> after that calculates a bit around with it. >> >> Here's the code > > Wow, talk about doing everything by hand. :) There are a lot of > utility functions that make your life easier. Try this: > > import Control.Monad > import Data.Char > import Data.List > import System.Directory > import System.IO > import Text.Regex > > main = do > allFiles <- getDirectoryContents "." > let files = filter (isDigit . head) allFiles > contents <- mapM readFile files > let (sum, count) = foldl' countDownloads (0,0) $ lines $ concat contents > putStr ("Download = " ++ show sum ++ " in " ++ show count ++ " days are " ++ > show (fromIntegral sum / fromIntegral count) ++ " downloads/day\n") > > match = matchRegex $ mkRegex "([0-9]+) Windows ex" > > countDownloads (s, c) l = > case match l of > Just [n] -> (s + read n, c + 1) > Nothing -> (s, c) > > Unfortunately, it doesn't solve your space leak. (I checked this via > core, but you can check it by testing it.) There's only one possible > lazy point left: > > countDownloads (s, c) l = Ok, I used that code and now I got: ./haskell_2 haskell_2: 8500: openFile: resource exhausted (Too many open files) Sorry, so I can not writ it down like that. So the above part with allFiles has to be modified to not exhaust the file descriptors. Regards Friedrich -- Q-Software Solutions GmbH; Sitz: Bruchsal; Registergericht: Mannheim Registriernummer: HRB232138; Geschaeftsfuehrer: Friedrich Dominicus

2 2

Functional programming job opening
by Simon Peyton-Jones 20 Oct '08

20 Oct '08

Folks Looking for a job in functional programming. Here's one (at Microsoft): http://members.microsoft.com/careers/search/details.aspx?JobID=E29D3886-A15… "We are seeking an experienced software development engineer who has mastered C/C++ and/or C# development and is now learning or is already an expert using F# (or Haskell). Our platform's logic engine is written in F# and we expect F#'s use to extend into many other areas of the platform. ... A strong interest in functional programming is necessary and as is comfort with theory-based software system designs." Simon

1 0

Re: Probably a trivial thing for people knowing
by John Lato 20 Oct '08

20 Oct '08

Friedrich wrote: > "Brandon S. Allbery KF8NH" <allbery(a)ece.cmu.edu> writes: > >> On 2008 Oct 19, at 2:26, Friedrich wrote: >>> Paul Johnson <paul(a)cogito.org.uk> writes: >>>>> (By the way, putting in the top level type declarations helps a lot >>>> when you make a mistake.) >>> Well I have my problems with that. Probably it comes from using >>> Languages like Ruby and my special dislike of "typing things" comes >>> especially from Java, C++ (well C is not "innocent" in that regard >>> also. >> >> Learn to love types: one of the neat things about Haskell is that if >> you can write down the type of a function then you have usually done >> 90% of the work of writing the code for it. > Well I disagree. But that's another story. > >> Another is that in >> general, if you can't express the type of a function, it means you >> haven't thought through what you're trying to do. > > No that's not true. The use implies that. However I'm not advice > resistant and will see if I use types. But IMHO that's should be job > of the environment to figure out correctly and most of the time > Haskell does "guess" right. And I surely can ask for the types. > It's true for people who use Haskell a lot. The reason is that Haskell types are fundamentally different from types in C (and related). I think it has to do with how you reason about a program's behavior. A well-designed Haskell program has types that are extremely well-suited to the problem domain, and as such the type often encapsulates everything you need to know about the function. John Lato

1 0

Haskell Weekly News: Issue 89 - October 18, 2008
by Brent Yorgey 18 Oct '08

18 Oct '08

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20081018 Issue 89 - October 18, 2008 --------------------------------------------------------------------------- Welcome to issue 89 of HWN, a newsletter covering developments in the [1]Haskell community. Announcements New Haskell tutorial. Miran Lipovaca (BONUS) has written a new and most excellent Haskell tutorial, [2]"Learn You a Haskell For Great Good!". Glob 0.1, globbing library. Matti Niemenmaa [3]announced the release of [4]Glob 0.1, a [5]small library for glob-matching purposes based on a subset of zsh's syntax. hledger 0.1, command-line accounting tool. Simon Michael [6]announced the [7]first release of [8]hledger, a command-line accounting tool similar to John Wiegley's c++ ledger. hledger generates simple ledger-compatible transaction and account balance reports from a plain text ledger file. [ANN] Haskell Cheatsheet v1.0. Justin Bailey [9]announced a [10]"cheat sheet" for Haskell, a PDF that tries to summarize Haskell 98's syntax, keywords and other language elements. Salsa: A .NET Bridge for Haskell. Andrew Appleyard [11]announced the [12]first release of [13]Salsa, an experimental Haskell library that allows Haskell programs to access .NET libraries. Salsa operates by loading the .NET runtime into your Haskell process and using the FFI (and run-time code generation) to marshall calls between the .NET and Haskell runtimes. It includes a code generator and a type-level library (which uses type families) to provide type-safe access to .NET libraries in Haskell with C#-style method overload resolution and implicit conversions. maccatcher-1.0.0. Jason Dusek [14]announced the [15]maccatcher package, which obtains a MAC address on *NIX and Windows. Call for Contributions - Haskell Communities and Activities Report, November 2008 edition. Janis Voigtlaender sent out [16]call for contributions to the 15th edition of the [17]Haskell Communities & Activities Report. The submission deadline is 31 October 2008. If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough -- please reconsider and submit an entry anyway! Data.IVar 0.1. Luke Palmer [18]announced the release of the [19]Data.IVar module, which provides write-once variables that can be blocked on in parallel. Unlike other implementations, Data.IVar does not use thread racing, since empirical tests have shown that the GHC scheduler is not quite good enough to handle thread-racing efficiently. A wiki page for managing the 6.10 handover. Don Stewart [20]announced a [21]wiki page to help with the transition to GHC 6.10. It collects the 7 or so known issues that break code with GHC 6.10. Please feel free to clean up, and especially add techniques for handling each change. GHC 6.10.1 RC 1. Ian Lynagh [22]announced [23]GHC 6.10.0.20081007, the first release candidate for GHC 6.10.1. There is also a [24]status page for GHC 6.10.1. Graphalyze-0.4 and SourceGraph-0.2. Ivan Lazar Miljenovic [25]announced the release of version 0.4 of the [26]Graphalyze library and version 0.2 of the [27]SourceGraph programme. SourceGraph is a programme designed to help you analyse the static complexity of your Haskell code when represented as a graph. These releases fix the bugs reported by Gwern Branwen, Magnus Therning, and Christopher Hinson. ListZipper-1.1.0.0. Ryan Ingram [28]announced the release of a simple list zipper library to Hackage, [29]ListZipper-1.1.0.0. darcs 2.1.0. Eric Kow [30]announced the release of [31]darcs 2.1.0. This version provides over 20 bug fixes and 7 new features since darcs 2.0.2. Most notably, the darcs-2 repository format is now the default, there is better HTTP support, and a longstanding 'pending patch' regression has been fixed. Yi 0.5.0.1. Jean-Phillipe Bernardy [32]announced the [33]0.5 release of Yi, a text editor written and extensible in Haskell. The long-term goal of the Yi project is to provide the editor of choice for Haskell programmers. Discussion OT: Haskell desktop wallpaper?. Magnus Therning [34]asked for Haskell-themed desktop wallpapers, and the community responded with quite a few nice images. Abusing quickcheck to check existential properties. Norman Ramsey [35]asked about using QuickCheck to check existential properties; suggestions involved SmallCheck and skolemization. Repair to floating point enumerations?. Malcolm Wallace began a [36]discussion on the merits of changing the (admittedly wonky) H98 [37]semantics for the Enum instances of Float and Double in Haskell Prime. A general question about the use of classes in defining interfaces. S. Doaitse Swierstra [38]asked about the feasibility of including top-level functions implemented using Applicative combinators as class methods with default implementations, to allow for the possibility of giving them more efficient implementations in specific instances. Proposal #2659: Add sortOn and friends to Data.List. Twan van Laarhoven [39]proposed adding sortOn (:: Ord b => (a -> b) -> [40]-> [a) and related functions to Data.List. Blog noise [41]Haskell news from the [42]blogosphere. * Andy Gill: [43]Pretty Printing Code with Markup. writes about a [44]new version of the HughesPJ pretty printing library which allows for pretty-printing with markup. * "FP Lunch": [45]Is purity inefficient?. Are idiomatic pure functional programs less efficient than idiomatic impure ones? * Eric Kow (kowey): [46]darcs weekly news #8. * Conal Elliott: [47]Composing memo tries. * Conal Elliott: [48]Elegant memoization with functional memo tries. * >>> Paolo Capriotti: [49]Monads for Markov chains. * Real-World Haskell: [50]Production status update: we're in QC1. * Joachim Breitner: [51]Infinite loops in Haskell. * Luke Palmer: [52]FRP Rant. * Luke Palmer: [53]data-memocombinators. * Bryan O'Sullivan: [54]Using Bloom filters for large scale gene sequence analysis in Haskell. Bryan and Ketil Malde's paper was accepted to PADL 09! * Arnar Birgisson: [55]Generating legal subsets of a dependency graph. * Creighton Hogg: [56]A silly example and a brief history. * >>> Robert Ottaway: [57]Sorting using Haskell. * Dan Piponi (sigfpe): [58]Untangling with Continued Fractions: part 5. * Holumbus: [59]Source Links Are Back!. * London Haskell Users Group: [60]Getting things going again. * >>> Justin Bailey: [61]The Haskell Cheatsheet. * >>> Nathan Sanders: [62]Type-directed programming. * >>> Micah Cowan: [63]Adventures in Haskell, Part 2: Kewlness. * Manuel M T Chakravarty: [64]GpuGen: Bringing the Power of GPUs to Haskell.. * >>> Binu Raghavan: [65]Haskell.... Binu is trying to learn Haskell. * Bjoern Edstroem: [66]Let's build an MP3-decoder!. Quotes of the Week * mckinna: you don't need to produce elements of an *arbitrary* whatever-it-is when you can produce elements of the *initial* whatever-it-is * tristes_tigres: thinks that programming languages can be divided into two broad classes: functional and dysfunctional * luqui: Down with the IO bourgeoisie! Long live the purely functional proletariat * ystael: it seems like every time i switch channels over to #haskell someone is talking about launching missiles. one might be inclined to draw freudian conclusions. About the Haskell Weekly News New editions are posted to [67]the Haskell mailing list as well as to [68]the Haskell Sequence and [69]Planet Haskell. [70]RSS is also available, and headlines appear on [71]haskell.org. To help create new editions of this newsletter, please see the information on [72]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [73]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://learnyouahaskell.com/ 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/46583 4. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Glob 5. http://iki.fi/matti.niemenmaa/glob/index.html 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/46461 7. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hledger 8. http://joyful.com/Ledger#hledger 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/46122 10. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/CheatSheet 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/46076 12. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Salsa 13. http://haskell.org/haskellwiki/Salsa 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/46072 15. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/maccatcher 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45967 17. http://www.haskell.org/communities/ 18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45953 19. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/data-ivar 20. http://article.gmane.org/gmane.comp.lang.haskell.glasgow.user/15442 21. http://haskell.org/haskellwiki/Upgrading_packages#Typical_breakages_with_GH… 22. http://article.gmane.org/gmane.comp.lang.haskell.glasgow.user/15376 23. http://www.haskell.org/ghc/dist/stable/dist/6.10.1-rc-1/rc.html 24. http://hackage.haskell.org/trac/ghc/wiki/GHC-6.10.1 25. http://article.gmane.org/gmane.comp.lang.haskell.general/16473 26. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Graphalyze 27. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/SourceGraph 28. http://article.gmane.org/gmane.comp.lang.haskell.general/16468 29. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ListZipper 30. http://article.gmane.org/gmane.comp.lang.haskell.general/16465 31. http://darcs.net/darcs-2.1.0.tar.gz 32. http://www.haskell.org//pipermail/haskell/2008-October/020648.html 33. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/yi 34. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/45961 35. http://thread.gmane.org/gmane.comp.lang.haskell.general/16477 36. http://thread.gmane.org/gmane.comp.lang.haskell.prime/2678 37. http://haskell.org/onlinereport/basic.html#sect6.3.4 38. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/10206 39. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/10184 40. file://localhost/home/brent/haskell/hwn/a] 41. http://planet.haskell.org/ 42. http://haskell.org/haskellwiki/Blog_articles 43. http://blog.unsafeperformio.com/?p=31 44. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/marked%2Dpretty 45. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=113 46. http://koweycode.blogspot.com/2008/10/darcs-weekly-news-8.html 47. http://feeds.feedburner.com/~r/conal/~3/422189172/ 48. http://feeds.feedburner.com/~r/conal/~3/422171822/ 49. http://pcapriotti.wordpress.com/2008/10/16/monads-for-markov-chains/ 50. http://www.realworldhaskell.org/blog/2008/10/15/production-status-update-we… 51. https://www.joachim-breitner.de/blog/archives/308-Infinite-loops-in-Haskell… 52. http://luqui.org/blog/archives/2008/10/15/frp-rant/ 53. http://luqui.org/blog/archives/2008/10/14/data-memocombinators/ 54. http://www.serpentine.com/blog/2008/09/28/using-bloom-filters-for-large-sca… 55. http://www.hvergi.net/2008/10/generating-legal-subsets-of-a-dependency-grap… 56. http://abstractabsurd.blogspot.com/2008/10/silly-example-and-brief-history.… 57. http://tech-nickel.blogspot.com/2008/10/sorting-using-haskell.html 58. http://sigfpe.blogspot.com/2008/10/untangling-with-continued-fractions.html 59. http://holumbus.fh-wedel.de/blog/?p=15 60. http://www.londonhug.net/2008/10/11/getting-things-going-again/ 61. http://blog.codeslower.com/2008/10/The-Haskell-Cheatsheet 62. http://sandersn.com/blog/index.php?title=type_directed_programming 63. http://micah.cowan.name/2008/10/10/computers/software-development/adventure… 64. http://justtesting.org/post/53418059 65. http://variably-volatile.blogspot.com/2008/10/haskell.html 66. http://blog.bjrn.se/2008/10/lets-build-mp3-decoder.html 67. http://www.haskell.org/mailman/listinfo/haskell 68. http://sequence.complete.org/ 69. http://planet.haskell.org/ 70. http://sequence.complete.org/node/feed 71. http://haskell.org/ 72. http://haskell.org/haskellwiki/HWN 73. http://code.haskell.org/~byorgey/code/hwn/

1 0

Call for Participation: WI-IAT'08, Sydney, Australia
by WI-IAT'08 17 Oct '08

17 Oct '08

[Apologies if you receive this more than once] ====================== CALL FOR PARTICIPATION ====================== IEEE/WIC/ACM International Conference on Web Intelligence (WI'08) IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'08) December 9-12, 2008 Building 5, Haymarket Campus, University of Technology, Sydney, Australia http://www.lido.com.au/online/default.aspx?id=657fj3g91907# (see the map) Official: http://datamining.it.uts.edu.au/conferences/wi08/ http://datamining.it.uts.edu.au/conferences/iat08/ Sponsored and Organized by IEEE Computer Society Web Intelligence Consortium (WIC) Association for Computing Machinery (ACM) University of Technology, Sydney ================= HIGHLIGHTS ========================= 6 WI'08/IAT'08 Invited Speeches by Professor Edmund H. Durfee Professor Toru Ishida Professor Tsau Young Lin Professor Nigel Shadbolt Professor Yanchun Zhang Dr. Michael Witbrock 1 WIC Feature Talk by Professor Jiming Liu 4 Tutorials 16 WI-IAT Workshops Including the first WI-IAT Doctoral Workshop Presentations of Accepted Research Track Papers. The research track papers were selected from 651 submissions received from over 52 countries and regions. All main conference and workshop proceedings will be published in the conference proceedings by the IEEE Computer Society Press, indexed by EI. REGISTRATRION +++++++++++++ ********************************************** !!! Early-bird Registration by Nov 8, 2008 !!! ********************************************** On-line registration (and more information) at http://datamining.it.uts.edu.au/conferences/iat08/?page_id=45 Regular registration covers all the events of WI-IAT'08 during the four conference days including keynotes, tutorials, accepted paper presentations, and workshops, as well as includes proceedings for one of the conferences or its associated workshops. As usual, WI'08 and IAT'08 will be co-located, providing synergism among Web Intelligence and Intelligent Agent Technology. The two conferences will have a joint opening, invited talks, reception, and banquet. Attendees only need to register for one conference and can attend workshops, sessions, invited talks, panels and tutorials across the two conferences. INVITED TALKS +++++++++++++ WI'08/IAT'08 Joint Invited Talks include: Planning for Coordination and Coordination for Planning Professor Edmund H. Durfee EECS Department, University of Michigan, USA The Language Grid: Service-Oriented Collective Intelligence for Intercultural Collaboration Professor Toru Ishida Department of Social Informatics, Kyoto University, Japan The Emergence of Web Science Professor Nigel Shadbolt School of Electronics and Computer Science, University of Southampton, UK Knowledge Based Search Engine: Granular Computing on the Web Professor Tsau Young Lin Department of Computer Science, San Jose State University, USA Using Web Clustering for Web Community Mining and Analysis Professor Yanchun Zhang Centre for Applied Informatics Research, Victoria University, Australia Thinking Big - AI at Web Scale Dr. Michael Witbrock Vice President for Research at Cycorp, Inc., CEO of Cycorp Europe WIC FEATURE TALK ++++++++++++++++ Professor Jiming Liu Professor and Head of Computer Science Department, Hong Kong Baptist University TUTORIALS +++++++++ T1: Web Content Mining Vaclav Snasel Technical University of Ostrava, Czech Republic T2: Matching Words and Pictures: Problems, and Applications in the Web Latifur Khan University of Texas at Dallas, USA T3: Utilizing Federated Knowledge in Semantic Web Applications Jans Aasman Franz Inc. USA T4: Modeling Agent Organizations Virginia Dignum and Frank Dignum Utrecht University, The Netherlands WORKSHOPS +++++++++ W1: The 2nd Workshop on Collective Intelligence in Semantic Web and Social Networks (CISWSN 2008) W2: International Workshop on Web Information Retrieval Support Systems (WIRSS 2008) W3: International Workshop on Web Personalization, Reputation and Recommender Systems (WPRRS 2008) W4: International Workshop on Intelligent Web Interaction (IWI 2008) W5: Workshop on Intelligent e-Government (IEG 2008) W6: International Workshop on Fuzzy Logic On the Web (FLOW 2008) W7: Workshop on Natural Language Processing and Ontology Engineering (NLPOE 2008) W8: Workshop on Web Intelligence & Intelligent Agent Technology in eLearning (TUMAS-A 2008) W9: International Workshop on Computational Social Networks (IWCSN 2008) W10: Workshop on Optimization-based Data Mining and Web Intelligence (ODM 2008) W11: The Second International Workshop on Human Aspects in Ambient Intelligence: Agent Technology, Human-Oriented Knowledge and Applications (HAAI 2008) W12: International Workshop on E-Commerce, Business, and Services (ECBS 2008) W13: Workshop on P2P Computing and Autonomous Agents (P2P 2008) W14: International Workshop on Agents and Data Mining Interaction (ADMI 2008) W15: Workshop on Logics for Intelligent Agents and Multi-Agent Systems (WLIAMAS 2008) W16: 2008 WI-IAT Doctoral Workshop SOCIAL PROGRAM +++++++++++++++ The WI'08 and IAT'08 joint conference offers an exciting social programs, including the conference welcome reception on Dec. 10 and the conference banquet on Dec. 11. You can also enjoy the city of Sydney, including Darling Harbour and Opera House. You can get more information about the conference hotel and local information from the conference homepage: http://datamining.it.uts.edu.au/conferences/wi08/ CONTACT INFORMATION +++++++++++++++++++ A/Prof Longbing Cao Data Sciences & Knowledge Discovery Lab (the Smart Lab) Research Centre for Quantum Computation and Intelligent Systems University of Technology Sydney, Australia Office: +61-2-9514 4477 Fax: +61-2-9514 4517 E-mail: lbcao(a)it.uts.edu.au Homepage: www-staff.it.uts.edu.au/~lbcao The Smart Lab: datamining.it.uts.edu.au

1 0

ICFP09: Call for Workshop Proposals
by Matthew Fluet (ICFP Publicity Chair) 15 Oct '08

15 Oct '08

CALL FOR WORKSHOP PROPOSALS ICFP 2009 14th ACM SIGPLAN International Conference on Functional Programming 31st August - 2nd September, 2009 Edinburgh, Scotland http://www.icfpconference.org/icfp2009 The 14th ACM SIGPLAN International Conference on Functional Programming will be held in Edinburgh, Scotland from 31st August to 2nd September 2009. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops to be affiliated with ICFP 2009 and sponsored by SIGPLAN. These workshops should be more informal and focused than ICFP itself, include sessions that enable interaction among the workshop attendees, and be fairly low cost. The preference is for one-day workshops, but other schedules can also be considered. The workshops themselves will be held between August 30th and September 5th, as capacity allows. ---------------------------------------------------------------------- Submission details Deadline for submission: 19th November 2008 Notification of acceptance: 17th December 2008 Prospective workshop organisers are invited to submit a completed workshop proposal form in plain text format to the ICFP 2009 workshop co-chairs (Chris Stone and Mike Sperber), via email to icfp09-workshops at cs.hmc.edu by 19th November 2008. Please note that this is a firm deadline. Organisers will be notified if their proposal is accepted by 17th December 2008, and if successful are required to produce a final report after the workshop has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2009/workshops/icfp09-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The workshop proposals will be evaluated by a committee comprising the following members of the ICFP 2009 organising committee, together with the members of the SIGPLAN executive committee. Chris Stone Harvey Mudd College Workshops co-chair Mike Sperber DeinProgramm Workshops co-chair Graham Hutton University of Nottingham General Chair Andrew Tolmach Portland State University Program Chair ---------------------------------------------------------------------- Further information Any queries regarding ICFP 2009 workshop proposals should be addressed to the workshops co-chairs (Chris Stone and Mike Sperber), via email to icfp09-workshops at cs.hmc.edu

1 0