- Haskell - Haskell.org

ANNOUNCE IDynamic-0.1
by Alberto G. Corona 16 Oct '09

16 Oct '09

IDynamic is variant of Data.Dynamic that can be indexed, serialized., stored, transmitted trough communications etc. So it can be used in abstract data containers, persistence, communications etc. http://hackage.haskell.org/package/IDynamic I Just uploaded it, so the documentation has not been created by Hackage. However I uincluded an example in the pachage. {-# OPTIONS -XTypeSynonymInstances #-} module Main where import Data.IResource import Data.IDynamic import Data.Typeable instance IResource Int where keyResource x= "I" serialize = show deserialize = read defPath _= "saved/" instance IResource String where keyResource x= take 5 x serialize = show deserialize = read defPath _= "saved/" main= do putStrLn "see the code to know the meaning of he results" registerType :: IO Int -- register both datatypes (Int, and String) registerType :: IO String let x= 1 :: Int let list= [IDynamic x, IDynamic "hello, how are you"] --typical Dynamic usage let assoc= zip (map keyResource list) list print $ lookup (keyResource (5 ::Int)) assoc -- lookup a IDynamic object from a container and show it mapM writeResource list mds ← readResource $ IDynamic "hello" -- save both objects case mds of Nothing → error "must have been Just!" --why? Just ds → do putStrLn $ serialize ds -- serialize the dynamic object and print it let str= fromIDyn ds :: String -- casting putStrLn str -- print the string read let y= fromIDyn ds :: Int -- casting error print y

1 0

ANN: Haskell Hackathon in Zurich, Switzerland
by Johan Tibell 16 Oct '09

16 Oct '09

Hi all! We are in the early stages of planning a Haskell hackathon/get together, ZuriHac, to be held this March at the Google office, in Zurich, Switzerland. Right now we're looking at four possible dates (Friday-Sunday): March 5-7, March 12-14, March 19-21, or March 26-28. If you might be interested in attending, please add your name on the wiki page: http://haskell.org/haskellwiki/ZuriHac#Possible_Attendees If you don't have an account on the wiki feel free to just respond to this email. If there are any dates that absolutely don't work for you then please note them on the wiki. I'll come back with a finalized date and more details soon. Hope to see you in Zurich! Johan Tibell (tibbe)

1 0

ANN: WFLP 2010 Call for papers
by Pablo Nogueira 16 Oct '09

16 Oct '09

[Apologies for multiple receptions of this message] ******************************************************************** Preliminary Call For Papers 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Abstract Submission: November 9, 2009 Full Paper Submission: November 15, 2009 Acceptance Notification: December 15, 2009 Preliminary Proceedings: January 5, 2010 Workshop: January 17, 2010 SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. The previous WFLP editions are: WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). LOCATION WFLP 2010 will be held on January 17, 2010 in Madrid, Spain, colocated with the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010). WFLP 2010 solicits papers in all areas of functional and (constraint) logic programming, including but not limited to: * Foundations: formal semantics, logic variables, binding and abstract syntax, rewriting and narrowing, unification, constraint solving, dynamics, type theory, meta-theory, effects, etc. * Language Design: security, services, modules, type systems, multi-paradigm languages, concurrency and distribution, objects, libraries, generic programming, interoperability, etc. * Implementation: abstract machines, parallelism, compile-time and run-time optimizations, foreign-language interfaces, memory management, multi-threading, exploiting parallel hardware, etc. * Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, program calculation, program proof, meta-programming, generative programming, etc. * Software Development: algorithms, data structures, design patterns, components and composition, specification, proof assistants, verification and validation, model checking, debugging, testing, profiling, tracing, etc. * Paradigm Integration: integration of declarative programming with other paradigms or features such as imperative, object-oriented, aspect-oriented, concurrent, real-time programming, event-driven architectures, etc. * Applications: education, industry, commercial uses, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, XML processing, artificial intelligence, knowledge representation and machine learning, deductive databases, advanced programming environments and tools, etc. SUBMISSIONS and PROCEEDINGS Authors are invited to submit papers presenting original unpublished work. Papers must be at most 15 pages long. Exceptionally, authors may surpass the page limit by providing well-marked appendices intended as reviewing aids. Appendices will not appear in the final publication. Submission categories include regular research papers, system descriptions, and short papers describing on-going work (at most 8 pages). Submissions must be formatted in Lecture Notes in Computer Science (LNCS) style. This requirement needs not apply to appendices. Papers should be submitted in pdf or postscript format electronically via the web-based submission site http://www.easychair.org/conferences/?conf=wflp2010 Preliminary proceedings will be available at the workshop. Selected authors will be invited to submit a full version of their papers after the workshop. Contributions accepted for the post-workshop proceedings have usually appeared in journals -- those of the 2009 edition have been published in LNCS, previous editions in ENTCS, etc. PROGRAMME CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAMME COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (University of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada)

1 0

ANN: Reverse Dependencies in Hackage (demo)
by Roel van Dijk 15 Oct '09

15 Oct '09

Hello, I have implemented reverse dependencies in Hackage. You can play with the demo here: http://bifunctor.homelinux.net/~roel/hackage I already send a message to Haskell-Cafe, but I made a few changes and would like some feedback. You can sort the tables of reverse dependencies by clicking on the column headers. Large tables (base or the total overview) might take some time. Sorting is done client-side with a bit of JavaScript. I added a link to an overview of the reverse dependencies of every package in hackage. It is sorted by the total number of rev. deps by default, so the most dependent-on packages (within hackage) are at the top. In the future such a list might be expanded with other information, like the download count. Things I would like feedback on: - Rev. deps overview for all packages; is it useful? - If you look at the reverse dependencies for a package like digest you'll see a list of packages that depend on digest. Next to the names of the packages that depend on digest are their respective reverse dependencies. The idea is that you can see which are the most "important" (for some value of important) packages that depend on digest. Is that useful? - Is this the best way to present the information? Currently I am working on a patch for the new hackage-server. Regards, Roel

2 2

Call for Contributions - Haskell Communities and Activities Report, November 2009 edition
by voigt＠tcs.inf.tu-dresden.de 14 Oct '09

14 Oct '09

Dear all, so much has happened in the "Haskell world" in the past months. Therefore, I would like to collect contributions for the 17th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/communities/ Submission deadline: 1 November 2009 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * 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! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the May 2009 edition -- you will find interesting topics described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/11-2009/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2009/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have receive your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. This corresponds to approximately one page, or 40 lines of text, with the above style and template. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or ``historic'' overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep entries up. There is no minimum length of an entry! The report aims at being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. You can use it to write ``wishlist'' items for libraries and language features you would like to see implemented. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them.

1 0

Call for Participation: VSTTE 2009
by Jean-Christophe Filliâtre 13 Oct '09

13 Oct '09

********************************************************* * * * VSTTE 2009 * * * * Workshop on Verified Software * * Theory Tools and Experiments * * (affiliated with Formal Methods Week) * * * * *** Call For Participation *** * * * * November 2, 2009 * * Eindhoven, the Netherlands * * http://vstte09.lri.fr/ * * * ********************************************************* The workshop on Verified Software: Theories, Tools, and Experiments (VSTTE 2009) will take place on November the 2nd. The focus of this workshop will be on tools, as previous VSTTE conferences in Zurich and Toronto emphasised theories and experiments. Consisting of contributed papers and invited talks, the workshop will focus on the tools behind the development of systematic methods for specifying, building, and verifying high-quality software. Program ======= 09:00-10:00 - Rajeev Joshi, NASA JPL US TBA 10:30-11:30 - Discovering Specifications for Unknown Procedures with Separation Logic Chenguang Luo, Florin Craciun, Shengchao Qin, Guanhua He and Wei-Ngan Chin. On Essential Program Annotations and Completeness of Verifying Compilers Bernhard Beckert, Thorsten Bormer and Vladimir Klebanov. 11:30-12:30 - Jim Woodcock, University of York UK TBA 13:30-14:30 - Pascal Cuoq, CEA France TBA 14:30-15:30 - SMT Solvers: New Oracles for the HOL Theorem Prover Tjark Weber. An Interval-based SAT Modulo ODE Solver for Model Checking Nonlinear Hybrid Systems Daisuke Ishii, Kazunori Ueda and Hiroshi Hosobe. 16:00-17:00 - John McDermott, Naval Research Lab US TBA Kalou Cabrera Castillos, INRIA Nancy France TBA Registration ============ Participants can register for any combination of FM2009 activities, inclusing VSTTE 2009, at http://www.win.tue.nl/fmweek/Registration.html Deadline for (normal) registration is October 19.

1 0

The Monad.Reader (14) - Call for copy
by Brent Yorgey 11 Oct '09

11 Oct '09

Call for Copy: The Monad.Reader - Issue 14 ------------------------------------------ Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 14 will be: **Friday, January 8, 2010** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki-page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (byorgey at cis.upenn.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll sort something out.

1 1

ANNOUNCE: OpenGLRaw 1.1.0.1
by Sven Panne 11 Oct '09

11 Oct '09

A new version of the OpenGLRaw package has been uploaded to Hackage. This is a bug-fix-only release, fixing the retrieval of core OpenGL API entries on Windows. This fix should have already been included in the previous 1.1.0.0 version, but it was accidentally left out (thanks to Tobias Bexelius for pointing this out). Cheers, S.

1 0

ANN: Extensions to Vec uploaded (useful for GPipe programs)
by Tobias Bexelius 10 Oct '09

10 Oct '09

Hi, I've added two extensions to the Vec package: Vec-Transform and Vec-Boolean. These two packages are more or less essential when programming GPipe programs, but can also be useful for other applications as well. * Vec-Transform provides some 4x4 transform matrices such as perspective projection and rotation. * Vec-Boolean provides Data.Boolan instances for the Vec data types. Cheers /Tobias _________________________________________________________________ Windows Live: Håll dina vänner uppdaterade om vad du gör online. http://www.microsoft.com/windows/windowslive/see-it-in-action/social-networ…

1 0

Haskell Weekly News: Issue 134 - October 10, 2009
by jfredett＠gmail.com 10 Oct '09

10 Oct '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091010 Issue 134 - October 10, 2009 --------------------------------------------------------------------------- Welcome to issue 134 of HWN, a newsletter covering developments in the [1]Haskell community. What with Don Stewart's [2]call to [3]arms to lead Haskell to conquest over (E)DSL-land, I've once again tried to highlight discussion of EDSL's this week. Fortunately, it was actually more difficult choosing what _not_ to include this week, since there was so much discussion about DSLs and Syntax extensions (a related notion, in my opinion). Also, this week Bryan O'Sullivan put his Criterion Library to good use on the `text` package, leading to [4]code which is more than ten times faster than before! With all this fantastic news, I won't hold you up any longer, Haskellers, the Haskell Weekly News! Announcements CfPart: FMICS 2009, 2-3 November 2009, Final Call. FMICS 2009 workshop chair [5]announced the final call for particpaction for FMICS 2009 ICFP videos now available. Wouter Swierstra [6]announced the availablity of videos from the International Conference on Functional Programming (ICFP) GPipe-1.0.0: A functional graphics API for programmable GPUs. Tobias Bexelius [7]announced the first release of GPie, a functional graphics API for programmable GPUs. text 0.5, a major revision of the Unicode text library. Bryan O'Sullivan [8]announced a new, major version of the text package. New API features, and huge improvments in speed, as Bryan says, 'Get it while it's fresh on Hackage, folks!' vty-ui 0.2. Jonathan Daugherty [9]announced a new version of the vty-ui package, with fewer bugs, more widgets, and cleaner code due to new more powerful abstractions. htzaar-0.0.1. Tom Hawkins [10]announced HTZAAR, a Haskell implementation of TZAAR Graphalyze-0.8.0.0 and SourceGraph-0.5.5.0. Ivan Lazar Miljenovic [11]announced To keep this editor happy, Ivan released two new packaged in one announcement. This time, he's added Legend support to Graphalyze, but also many new changes to SourceGraph, including a legend so you can see what all the symbols mean, Better color support, and much more. TxtSushi 0.4.0. Keith Sheppard [12]announced a new version of TxtSushi, a set of command line utilities for processing CSV and TSV files. Discussion Applicative do? Philippa Cowderoy [13]asked about a `do` like syntax for Applicative functors. How to add use custom preprocessor in cabal. Bernd Brassel [14]asked how to add a custom preprocessor to the build chain of a cabal file. On DSLs - one last time. Gunther Schmidt [15]summarized his impressions on al the recent discussion of DSLs What is a DSL? Oleg [16]offered some insight into different [17]properties that can be part of a single tagless framework. He also pointed to some slides and other materials such as a website [18]here and slides [19]here about DSL implementations and definitions. What is a DSL? Gunther Schmidt [20]posed the question, 'What is a DSL', and with some further questions added by yours truly, a lively discussion about the definition of a DSL ensued. Finally tagless - stuck with implementation of 'lam'. Gunther Schmidt [21]asked another question about Finally Tagless DSLs and resolving an issue with the implementation of 'lam' Blog noise [22]Haskell news from the [23]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Darcs: [24]darcs weekly news #43. * JP Moresmau: [25]What client for an Haskell Multi Player Game?. * Mikael Vejdemo Johansson (Syzygy-): [26][MATH198] Third lecture is up. * Bryan O'Sullivan: [27]Announcing a major revision of the Haskell text library. * Eric Kow (kowey): [28]darcs hashed-storage work merged (woo!). * David Amos: [29]Symmetries of PG(n,Fq). * The GHC Team: [30]Parallelism /= Concurrency. * >>> Nefigah: [31]Fake World Haskell. Nefigah, a recent addition to the community, has been working through RWH, and is providing some excellent examples. Though, This editor prefers the title 'Real Life Haskell' as opposed to his choice. * Tom Schrijvers: [32]Release 0.6 of Monadic Constraint Programming. * Neil Brown: [33]Concurrency Can Be Deterministic (But The Type System Doesn't Know It). * Clint Moore: [34]Curiously Parallel. * Galois, Inc: [35]Tech Talk: Constructing A Universal Domain for Reasoning About Haskell Datatypes. * Neil Brown: [36]Terminal Concurrency: The Printing Process. * Sean Leather: [37]'Upwards and downwards accumulations on trees' translated into Haskell. * Mikael Vejdemo Johansson (Syzygy-): [38][MATH 198] Second lecture. * Chris Smith: [39]View Patterns as Pattern Matching for Records. * Chris Smith: [40]Playing With Records. * FP Lunch: [41]Left Kan extensions of containers. Quotes of the Week * Baughn: Blum Blum Shub, a PRNG derived from poking around R'Lyeh. * ksf: * lambdabot locks up ksf in a Monad <ksf> mmmmh it's warm and fuzzy in here. * monochrom: Don't wrap your head around Haskell. Immerse! Wrap Haskell around your head. * chak: ... In other words, FP is inevitable. * robreim: I'm in your base hacking all your lambdas * gwern: RAM is overrated, swap is where it's at ;) * idnar: [to gwern] swap to a ramdisk! ;P About the Haskell Weekly News New editions are posted to [42]the Haskell mailing list as well as to [43]the Haskell Sequence and [44]Planet Haskell. [45]RSS is also available, and headlines appear on [46]haskell.org. To help create new editions of this newsletter, please see the information on [47]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [48]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://www.haskell.org/pipermail/haskell-cafe/2009-October/067203.html 3. http://www.reddit.com/r/haskell/comments/9qk54/haskell_should_own_the_edsl_… 4. http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-th… 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17555 6. http://article.gmane.org/gmane.comp.lang.haskell.general/17552 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17546 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/64591 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/64529 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/64516 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/64399 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/64301 13. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/64616 14. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/64558 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/64552 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/64533 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/ 18. http://dsl09.blogspot.com/ 19. http://dsl09.blogspot.com/2009/07/panel.html 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/64474 21. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/64343 22. http://planet.haskell.org/ 23. http://haskell.org/haskellwiki/Blog_articles 24. http://blog.darcs.net/2009/10/darcs-weekly-news-43.html 25. http://jpmoresmau.blogspot.com/2009/10/what-client-for-haskell-multi-player… 26. http://blog.mikael.johanssons.org/archive/2009/10/math198-third-lecture-is-… 27. http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-th… 28. http://koweycode.blogspot.com/2009/10/darcs-hashed-storage-work-merged-woo.… 29. http://haskellformaths.blogspot.com/2009/10/symmetries-of-pgnfq.html 30. http://ghcmutterings.wordpress.com/2009/10/06/parallelism-concurrency/ 31. http://my.life-is-virtual.com/2009/10/07/fake-world-haskell-part-1/ 32. http://tomschrijvers.blogspot.com/2009/10/release-06-of-monadic-constraint.… 33. http://chplib.wordpress.com/2009/10/07/concurrency-can-be-deterministic/ 34. http://www.l2mlogistics.com/2009/10/curiously-parallel.html 35. http://www.galois.com/blog/2009/10/06/huffman-universal/ 36. http://chplib.wordpress.com/2009/10/06/the-printing-process/ 37. http://feedproxy.google.com/~r/splonderzoek/~3/4E8TZPDZ-aM/upwards-and-down… 38. http://blog.mikael.johanssons.org/archive/2009/10/math-198-second-lecture/ 39. http://cdsmith.wordpress.com/2009/10/04/view-patterns-as-pattern-matching-f… 40. http://cdsmith.wordpress.com/2009/10/03/playing-with-records/ 41. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=237 42. http://www.haskell.org/mailman/listinfo/haskell 43. http://sequence.complete.org/ 44. http://planet.haskell.org/ 45. http://sequence.complete.org/node/feed 46. http://haskell.org/ 47. http://haskell.org/haskellwiki/HWN 48. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0