June 2009 - Haskell - Haskell.org

Announcing Djinn, version 2004-12-11, a coding wizard
by Lennart Augustsson 07 Apr '11

07 Apr '11

Howdy, y'all! I've written a small program that takes a (Haskell) type and gives you back a function of that type if one exists. It's kind of fun, so I thought I'd share it. It's probably best explained with a sample session. calvin% djinn Welcome to Djinn version 2005-12-11. Type :h to get help. # Djinn is interactive if not given any arguments. # Let's see if it can find the identity function. Djinn> f ? a->a f :: a -> a f x1 = x1 # Yes, that was easy. Let's try some tuple munging. Djinn> sel ? ((a,b),(c,d)) -> (b,c) sel :: ((a, b), (c, d)) -> (b, c) sel ((_, v5), (v6, _)) = (v5, v6) # We can ask for the impossible, but then we get what we # deserve. Djinn> cast ? a->b -- cast cannot be realized. # OK, let's be bold and try some functions that are tricky to write: # return, bind, and callCC in the continuation monad Djinn> type C a = (a -> r) -> r Djinn> returnC ? a -> C a returnC :: a -> C a returnC x1 x2 = x2 x1 Djinn> bindC ? C a -> (a -> C b) -> C b bindC :: C a -> (a -> C b) -> C b bindC x1 x2 x3 = x1 (\ c15 -> x2 c15 (\ c17 -> x3 c17)) Djinn> callCC ? ((a -> C b) -> C a) -> C a callCC :: ((a -> C b) -> C a) -> C a callCC x1 x2 = x1 (\ c15 _ -> x2 c15) (\ c11 -> x2 c11) # Well, poor Djinn has a sweaty brow after deducing the code # for callCC so we had better quit. Djinn> :q Bye. To play with Djinn do a darcs get http://darcs.augustsson.net/Darcs/Djinn or get http://darcs.augustsson.net/Darcs/Djinn/Djinn.tar.gz Then just type make. (You need a Haskell 98 implementation and some libraries.) And then start djinn. For the curious, Djinn uses a decision procedure for intuitionistic propositional calculus due to Roy Dyckhoff. It's a variation of Gentzen's LJ system. This means that (in theory) Djinn will always find a function if one exists, and if one doesn't exist Djinn will terminate telling you so. This is the very first version, so expect bugs. :) Share and enjoy. -- Lennart

8 13

Call For Papers: APLAS 2009 (Korea, Dec 14-16, 2009)
by Zhenjiang Hu 09 Oct '09

09 Oct '09

=============================================================== FIRST CALL FOR PAPERS The Seventh Asian Symposium on Programming Languages and Systems (APLAS 2009) Seoul, December 14-16, 2009 http://ropas.snu.ac.kr/aplas09/ =============================================================== APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past formal APLAS symposiums were successfully held in Bangalore (2008, India), Singapore (2007), Sydney (2006, Australia), Tsukuba (2005, Japan), Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, 3780, 4279, and 5356. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments INVITED SPEAKERS: TBA IMPORTANT DATES: Abstract Deadline: June 8 (Monday), 2009 Paper Submission Deadline: 24:00 AM (in Samoan Time), June 15 (Monday), 2009 Author Notification: August 17, 2009 Camera Ready: September 14, 2009 Conference: December 14-16, 2009 SUBMISSIONS INFORMATION: Papers should be submitted electronically online via the conference submission web page at URL <http://www.easychair.org/conferences/?conf=aplas2009>. Acceptable formats are PostScript or PDF, viewable by Ghostview or Adobe Reader. Submissions should not exceed 16 pages in LNCS format, including bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. Submitted papers must be unpublished and not submitted for publication elsewhere. The proceedings of the symposium is planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Authors of selected papers will be invited after the symposium to submit a full version for publication in a special issue of New Generation Computing. GENERAL CHAIR Kwangkeun Yi (Seoul National University, Korea) PROGRAM CHAIR Zhenjiang Hu (National Institute of Inforamtics, Japan) PROGRAM COMMITTEE Manuel M. T. Chakravarty (University of New South Wales, Australia) Wei-Ngan Chin (National University of Singapore, Singapore) Nate Foster (University of Pennsylvania, USA) Ralf Hinze (Oxford University, United Kingdom) Zhenjiang Hu (National Institute of Informatics, Japan), Chair Ik-Soon Kim (Electronics and Telecommunications Research Institute, Korea) Julia Lawall (DIKU, Denmark) Sebastian Maneth (NICTA and University of New South Wales, Australia) Sungwoo Park (Pohang University of Science and Technology, Korea) G. Ramalingam (Microsoft Research, India) Peter Thiemann (University of Freiburg, Germany) Kazushige Terui (Kyoto University, Japan) Janis Voigtländer (Technical University of Dresden, Germany) Chung-chieh Shan (Rutgers University, USA) Kazunori Ueda (Waseda University, Japan) Bow-Yaw Wang (Academia Sinica, Taiwan) Jianjun Zhao (Shanghai Jiaotong University, China) POSTER CHAIR Kiminori Matsuzaki (University of Tokyo, Japan)

1 1

Data.Generics.gzip3 anyone?
by David Fox 08 Aug '09

08 Aug '09

Is there a Scrap Your Boilerplate guru out there who could whip up a three argument version of gzip for me?

4 11

ANNOUNCE: ChristmasTree 0.1 (excuses for second attempt)
by S.Doaitse Swierstra 07 Jul '09

07 Jul '09

We are pleased to announce the availability of the package "ChristmasTree", which contains the code associated with our paper at the last Haskell symposium: @inproceedings{1411296, author = {Marcos Viera and S. Doaitse Swierstra and Eelco Lempsink}, title = {Haskell, do you read me?: constructing and composing efficient top-down parsers at runtime}, booktitle = {Haskell '08: Proceedings of the first ACM SIGPLAN symposium on Haskell}, year = {2008}, isbn = {978-1-60558-064-7}, pages = {63--74}, location = {Victoria, BC, Canada}, doi = {http://doi.acm.org/10.1145/1411286.1411296}, publisher = {ACM}, address = {New York, NY, USA}, } The name of the package stands for: "Changing Haskell's Read Implementation Such That by Manipulating Abstract Syntax Trees it Reads Expressions Efficiently" which, given the time of year, seems appropriate. Feel free to download and unpack this "present" at what for the Dutch is called "Sinterklaasavond" (http://en.wikipedia.org/wiki/Sinterklaas) Arthur Baars Marcos Viera Eelco Lempsink Doaitse Swierstra PS: the package uses our library supporting transformation of typed abstract syntax, which we placed in a separate package TTTAS

2 1

ANN: package Boolean: Generalized booleans
by Conal Elliott 30 Jun '09

30 Jun '09

I just uploaded a new package [1] for generalized booleans, which provides type classes with generalizations of boolean values & operations, if-then-else, Eq and Ord. These values & types come up for me with every new deep DSEL, and I think they do for others as well. The design space has some tricky trade-offs, and I'm not positive I've found the optimum yet. Users & comments are very welcome. Please direct discussion to the haskell-cafe list (rather than haskell list). [1]: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Boolean - Conal

1 0

INAP 2009: DEADLINE EXTENSION and Final Call for Papers
by Pedro Salgueiro 29 Jun '09

29 Jun '09

------------------------------------------------------------------- (PLEASE DISTRIBUTE -- **DEADLINE EXTENDED** -- PLEASE DISTRIBUTE) ------------------------------------------------------------------- Final Call for Papers INAP 2009 18th International Conference on Applications of Declarative Programming and Knowledge Management November 5-7, 2009 Evora, Portugal http://www.di.uevora.pt/inap2009/ http://inap.dialogengines.com/ ------------------------------------------------------------ Organized by the Portuguese AI Society (APPIA), the INAP Committee and the Society of Logic Programming (GLP e.V.) == Overview == Declarative Programming is a family of advanced paradigms for the modeling and solving of complex problems. These specification and implementation methods have attracted more and more attention over the past years, e.g. in the domains of databases and natural language processing, for modeling and the processing of combinatorial problems, and for establishing systems for the web. == INAP 2009 == INAP is a communicative and dense forum for intensive discussion of applications of important technologies related to Prolog, Logic and Constraint Programming as well as closely related advanced software. It comprehensively covers the impact of programmable logic solvers in the Internet Society, its underlying technologies, and leading edge applications in industry, commerce, government, and societal services. INAP 2009 continues a tradition of successful workshops cast around the applications of declarative programming, which were held in Kobe (1997), Tokyo (1995, 1996, 1998 - 2001), Potsdam (2004), Fukuoka (2005) and Wuerzburg (2007). We invite the submission of high quality papers on the described topics, especially, but not exclusively, on different aspects of Declarative Programming, Constraint Processing and Knowledge Management as well as their use for Distributed Systems and the Web: - Knowledge Management, e.g. Data Mining, Decision Support, Deductive Databases - Distributed Systems and the Web, e.g. Agents and Concurrent Engineering, Semantic Web - Constraints, e.g. Constraint Systems, Extensions of Constraint (Logic) Programming - Theoretical Foundations, e.g. Deductive Databases, Nonmonotonic Reasoning - Systems and Tools for Academic and Industrial Use - Knowledge-based Web Services - Logic Solvers and Applications == Workshop Format == The technical program of the workshop will include invited presentations (to be announced), regular technical sessions with presentations of the accepted papers, system demonstrations and a panel discussion. == Conference Venue == The conference will be held at the University of Evora, Portugal in November 5-7, 2009. Evora is a nice and quiet historical city located in the south of Portugal that can be reached from Lisbon by train or coach in under 2 hours. It is a small city of 60.000 inhabitants, 120 km inland from Lisbon and classified by Unesco as World Heritage. The University of Evora was established in the 16th Century and is the 2nd oldest Portuguese University. The social program is promising since the region is very rich in historical sites (Stone Age, Roman, Medieval and Renaissance remains) and also offers a very special gastronomy. See http://en.wikipedia.org/wiki/%C3%89vora for more information. == Important Dates == Paper Submission Deadline: July 13, 2009 (EXTENDED!) Notifications to Authors: August 17, 2009 Camera-ready Version Deadline: September 14, 2009 INAP 2009 Workshop: November 5-7, 2009 == Submission Guidelines == Participants should submit a paper (maximum 15 pages, PDF format), describing their work in topics relevant to the workshop. Accepted papers will be presented during the workshop. At least one author of an accepted contribution is expected to register for the workshop, and present the paper. All submissions should include the author's name(s), affiliation, complete mailing address, and email address. Authors are requested to prepare their submissions, following the LNCS/LNAI Springer format. Please see: http://www.springer.de/comp/lncs/authors.html for further details. The submission should be submitted through the electronic submission site: http://www.easychair.org/conferences/?conf=inap2009 The deadline for receipt of submissions is July 13, 2009. Papers received after this date will not be reviewed. Eligible papers will be peer-reviewed by at least three members of the Program Committee. Authors will be notified via email of the results by August 17, 2009. Authors of accepted papers are expected to improve their paper based on reviewers' comments and to send a camera ready version of their manuscripts by September 14, 2009. Accepted papers will be included in the workshop proceedings, which will be distributed to the participants. As in previous editions, we plan to publish selected papers in a proceedings volume in the Springer Lecture Notes in Artificial Intelligence (LNAI) series. == Organizing Committee == Vitor Nogueira vbn AT di.uevora.pt Salvador Abreu spa AT di.uevora.pt Pedro Salgueiro pds AT di.uevora.pt Universidade de Evora Portugal == Program Committee == Salvador Abreu, University of Evora, Portugal (co-chair) Sergio Alvarez, Boston College, USA Philippe Codognet, CNRS/JFLI, Tokyo, Japan Vitor Santos Costa, University of Porto, Portugal Daniel Diaz, University of Paris I, France Ulrich Geske, University of Potsdam, Germany Gopal Gupta, UT Dallas, USA Petra Hofstedt, Technical University of Berlin, Germany Ulrich Neumerkel, Technical University of Vienna, Austria Vitor Nogueira, University of Evora, Portugal Enrico Pontelli, New Mexico State University, USA Irene Rodrigues, University of Evora, Portugal Carolina Ruiz, Worcester Polytechnic Institute, USA Dietmar Seipel, University of Wuerzburg, Germany (co-chair) Terrance Swift, CENTRIA, Portugal Hans Tompits, Technical University of Vienna, Austria Masanobu Umeda, Kyushu Institute of Technology, Japan Armin Wolf, Fraunhofer FIRST, Berlin, Germany Osamu Yoshie, Waseda University, Japan == Contact Information == inap2009(a)di.uevora.pt Universidade de Evora Departamento de Informatica Largo dos Colegiais, 2 7004-516 Evora - PORTUGAL

1 0

Haskell Weekly News: Issue 123 - June 29, 2009
by Brent Yorgey 29 Jun '09

29 Jun '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090629 Issue 123 - June 29, 2009 --------------------------------------------------------------------------- Welcome to issue 123 of HWN, a newsletter covering developments in the [1]Haskell community. A bit late this week since over the weekend I was trying to get some unruly satellites to behave (with moderate success). Anyway, some fun stuff this week: Haskell on the iPhone; new libraries for 3D animation, web development, session types; new releases of haskell-src-exts and darcs; and more. Also, if it seems that there haven't been many quotes lately, it's because people haven't been @remembering very many in #haskell. I cannot telepathically sense (via the Haskell-force, hereafter known as the "Horce") when someone says something funny. Announcements Haskell Symposium call for participation. Stephanie Weirich [2]announced that [3]registration is now open for the [4]ACM SIGPLAN Haskell Symposium 2009, to be held on 3 September 2009 in Edinburgh, Scotland (co-located with ICFP). The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. jhc 0.6.1. John Meacham [5]announced the release of [6]jhc 0.6.1, featuring a a much simplified cross-compilation mechanism. X Haskell Bindings 0.3. Antoine Latter [7]announced the 0.3.* series release of the [8]X Haskell Bindings. This release, like the prior 0.2.* series focuses on making the API prettier. happstack-0.3.2. Matthew Elder [9]announced the release of [10]happstack-0.3.2, with many changes, updates, and bug fixes. sendfile-0.1. Matthew Elder [11]announced the release of [12]sendfile, a library which exposes zero-copy sendfile functionality in a portable way. Right now it natively supports linux 2.6+ (maybe older too) and windows 2000+; on other platforms it will fall back seamlessly to a portable haskell implementation. Reusable Corecursive Queues via Continuations. Leon Smith [13]requested feedback on a draft of an upcoming article in Monad.Reader issue 14, "Lloyd Allison's Corecursive Queues: Why Continuations Matter", describing the implementation of the [14]control-monad-queue package. Haskell on the iPhone. Ryan Trinkle [15]announced that his company, iPwn Studios Inc., is currently preparing to release an open source patch to GHC that allows it to output binaries for iPhone OS. The patch will be released under a BSD license as soon as possible and hopefully integrated into the GHC main-line in the near future. Program to set the GNOME desktop background picture randomly. Colin Paul Adams [16]announced [17]gnome-desktop, a library which periodically picks a random picture from $HOME/Pictures, and sets it as the GNOME desktop background. loli: a minimal web dev DSL. Jinjing Wang [18]announced the release of [19]loli, a web development DSL built on top of [20]hack. It allows you to easily define routes, build your custom template backends through a simple Template interface, and integrate with other hack middleware. Cal3D animation library. Gregory D. Weber [21]announced the [22]Cal3D for Haskell project, which provides a partial binding to the [23]C++ Cal3D animation library, a platform- and graphics-API-independent C++ library for skeletal-based character animation. There are three packages available on hackage: [24]cal3d-0.1, a Haskell binding to the Cal3D library itself; as well as [25]cal3d-opengl-0.1 and [26]cal3d-examples-0.1. A Reader Monad Tutorial. Henry Laxen [27]announced a nice [28]Reader monad tutorial. full-sessions: yet another implementation of session types. Keigo Imai [29]announced the pre-release of [30]full-sessions, yet another implementation of session types in Haskell. Session types are used to statically check the safe and consistent use of communication channels according to protocols. A notable advantage of [31]this implementation is that it requires almost no type annotation or term annotations. and at the same time provides full functionality of session types including channel-generation and channel-passing. darcs 2.3 beta 1. Petr Rockai [32]announced the immediate availability of a first beta release of darcs 2.3. There are a number of improvements and bugfixes over the last stable release, 2.2 (see the announcement for a full list). Moreover, work has been done on performance of "darcs whatsnew" for large repositories. This has also introduced a slight risk of regressions, but please note that all of the disruptive changes are in read-only code paths: the new code will never touch your repository, so it is unable to cause permanent harm. The worst that could happen is that you get no or bad diff from "darcs whatsnew". Please help test it (cabal install [33]darcs-beta)! New release of ZeroTH. Robin Green [34]announced a new release (2009.6.23.3) of [35]ZeroTH, a tool for preprocessing Haskell code to run splices and remove Template Haskell dependencies. Major changes include support for more Haskell code via haskell-src-exts 1.0.0, better error messages, and librification. Emping-0.6 and Tests/Examples. Hans van Thiel [36]announced version 0.6 of [37]Emping, a (prototype) interactive tool for the discovery and analysis of (universal, not statistical) predictive rules in tables of nominal data. haskell-src-exts-1.0.0. Niklas Broberg [38]announced the first stable release of the [39]haskell-src-exts package, version 1.0.0! haskell-src-exts is a package for Haskell source code manipulation. In particular it defines an abstract syntax tree representation, and a parser and pretty-printer to convert between this representation and String. It handles (almost) all syntactic extensions to the Haskell 98 standard implemented by GHC, and the parsing can be parametrised on what extensions to recognise. HaRe (the Haskell Refactorer) in action - short screencast. Claus Reinke [40]linked to [41]a short video showing [42]HaRe, the Haskell refactorer, in action. HaRe still exists---but needs some love in the form of time and/or funding for maintenance and continued development. Trivial pivoting for the DSP lu decomposition. Fernan Bolando [43]announced the beginnings of a [44]simple circuit simulator using haskell, which uses a modified version of the haskell DSP library matrix, extended with a simple pivoting method. Discussion make some Applicative functions into methods, and split off Data.Functor. Ross Paterson [45]proposed moving several functions such as (<$), (*>), and so on into their respective classes with default definitions, to allow for specialized implementations. base library and GHC 6.12. Ian Lynagh began a [46]discussion about how to structure the base library in the future. Proposal: ExplicitForall. Niklas Broberg [47]proposed adding a new GHC extension, ExplicitForall, to be used for turning on explicit 'forall' syntax in types, and to help disentangle and simplify some existing extensions. Generic Graph Class. Ivan Lazar Miljenovic [48]proposed a generic graph class to serve as a common interface for the many Haskell libraries that deal with graph data structures. Type system trickery. Andrew Coppin [49]asked how to statically ensure certain properties of recursive data structures with the type system, generating varied suggestions involving GADTs. Blog noise [50]Haskell news from the [51]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Magnus Therning: [52]Making a choice from a list in Haskell, Vty (part 0). * The Gentoo Haskell Team: [53]Haskell in Gentoo. * Michael Snoyman: [54]Hack Introduction. * >>> Henry Laxen: [55]Reader Monad Confusion. * >>> Akshay: [56]Dynamic Programming in Haskell and why DP is useful. * David Amos: [57]Direct products revisited. * mightybyte: [58]Basic Happstack Blog App. * David Amos: [59]Some groups and some graphs. * Gergely Patai: [60]Short-term hp2any plans. * Isaac Dupree: [61]cross-package, Plan A. * >>> Oliver Reeves: [62]Data Crunching in Haskell. * Roman Cheplyaka: [63]Halting problem. * Petr Rockai: [64]darcs 2.3 beta 1. * Eric Kow (kowey): [65]Haskell syntax highlighting on Wikipedia and Wikibooks. * Greg Bacon: [66]Setting up a simple test with Cabal. * Isaac Dupree: [67]Cross-package documentation, part 1. * Sean Leather: [68]RFC: Extensible, typed scanf- and printf-like functions for Haskell. * >>> Akshay: [69]Foray Into Haskell. * >>> Ivan Uemlianin: [70]decorate-sort-undecorate in Haskell. * Isaac Dupree: [71]How To Navigate Your Code:. * Petr Rockai: [72]soc progress 5. * DEFUN 2009: [73]The tutorial schedule is now ready. * DEFUN 2009: [74]Last call for talk proposals!. * >>> Greg Bacon: [75]Setting up a simple test with Cabal. * The GHC Team: [76]New paper: Parallel Performance Tuning for Haskell. * Brandon Simmons: [77]Fun with Lazy Arrays: the LZ77 Algorithm. * >>> Keith: [78]Bird Tracks Through Math Land: Basic Matrix Ops. Quotes of the Week * gnuvince: Contributions to Hackage are measured in µConals. * DavidWheeler: Compatibility means deliberately repeating other people's mistakes. About the Haskell Weekly News New editions are posted to [79]the Haskell mailing list as well as to [80]the Haskell Sequence and [81]Planet Haskell. [82]RSS is also available, and headlines appear on [83]haskell.org. To help create new editions of this newsletter, please see the information on [84]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [85]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17320 3. http://www.regmaster.com/conf/icfp2009.html 4. http://haskell.org/haskell-symposium/2009/ 5. http://www.haskell.org//pipermail/haskell/2009-June/021449.html 6. http://repetae.net/computer/jhc/ 7. http://www.haskell.org//pipermail/haskell/2009-June/021460.html 8. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xhb 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17317 10. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/happstack 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17316 12. http://hackage.haskell.org/package/sendfile 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17311 14. http://hackage.haskell.org/package/control-monad-queue 15. http://article.gmane.org/gmane.comp.lang.haskell.general/17307 16. http://article.gmane.org/gmane.comp.lang.haskell.general/17304 17. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/gnome%2Ddesktop 18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60675 19. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/loli 20. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hack 21. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60596 22. http://haskell.org/haskellwiki/Cal3d_animation 23. http://home.gna.org/cal3d/ 24. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/cal3d 25. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/cal3d%2Dopengl 26. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/cal3d%2Dexamples 27. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60591 28. http://www.maztravel.com/haskell/readerMonad.html 29. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60511 30. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/full%2Dsessions 31. http://www.agusa.i.is.nagoya-u.ac.jp/person/sydney/full-sessions.html 32. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60465 33. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/darcs%2Dbeta 34. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60430 35. http://hackage.haskell.org/package/zeroth 36. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60411 37. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Emping 38. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60392 39. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell%2Dsrc%2D… 40. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60388 41. http://www.youtube.com/watch?v=4I7VZV7elnY 42. http://www.cs.kent.ac.uk/projects/refactor-fp/ 43. http://article.gmane.org/gmane.comp.lang.haskell.cafe/60590 44. http://plan9.bell-labs.com/sources/contrib/fernan/escomma.tar.bz2 45. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/11428 46. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/11413 47. http://thread.gmane.org/gmane.comp.lang.haskell.glasgow.user/17137 48. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/60460 49. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/60277 50. http://planet.haskell.org/ 51. http://haskell.org/haskellwiki/Blog_articles 52. http://therning.org/magnus/archives/664 53. http://gentoohaskell.wordpress.com/?p=3 54. http://blog.snoyman.com/2009/06/28/hack-introduction/ 55. http://www.maztravel.com/haskell/readerMonad.html 56. http://www.akrish.net/2009/06/28/dynamic-programming-in-haskell-and-why-dp-… 57. http://haskellformaths.blogspot.com/2009/06/direct-products-revisited.html 58. http://softwaresimply.blogspot.com/2009/04/basic-happstack-blog-app.html 59. http://haskellformaths.blogspot.com/2009/06/some-groups-and-some-graphs.html 60. http://just-bottom.blogspot.com/2009/06/short-term-hp2any-plans.html 61. http://haddock2009.wordpress.com/2009/06/25/cross-package-plan-a/ 62. http://buffered.io/2009/06/25/data-crunching-in-haskell/ 63. http://ro-che.blogspot.com/2009/06/halting-problem.html 64. http://web.mornfall.net/blog/darcs_2.3_beta_1.html 65. http://koweycode.blogspot.com/2009/06/haskell-syntax-highlighting-on.html 66. http://feedproxy.google.com/~r/gbacon/~3/7rlf4Dd1JKU/setting-up-simple-test… 67. http://haddock2009.wordpress.com/2009/06/24/cross-package-documentation-par… 68. http://feedproxy.google.com/~r/splonderzoek/~3/vO9VuXrFTCg/rfc-extensible-t… 69. http://www.akrish.net/2009/06/24/foray-into-haskell/ 70. http://llaisdy.wordpress.com/2009/06/24/decorate-sort-undecorate-in-haskell/ 71. http://haddock2009.wordpress.com/2009/06/23/how-to-navigate-your-code/ 72. http://web.mornfall.net/blog/soc_progress_5.html 73. http://www.defun2009.info/blog/2009/06/the-tutorial-schedule-is-now-ready/ 74. http://www.defun2009.info/blog/2009/06/last-call-for-talk-proposals/ 75. http://gbacon.blogspot.com/2009/06/setting-up-simple-test-with-cabal.html 76. http://ghcmutterings.wordpress.com/2009/06/22/new-paper-parallel-performanc… 77. http://coder.bsimmons.name/blog/2009/06/fun-with-lazy-arrays-the-lz77-algor… 78. http://blog.keithsheppard.name/2009/06/bird-tracks-through-math-land-basic.… 79. http://www.haskell.org/mailman/listinfo/haskell 80. http://sequence.complete.org/ 81. http://planet.haskell.org/ 82. http://sequence.complete.org/node/feed 83. http://haskell.org/ 84. http://haskell.org/haskellwiki/HWN 85. http://code.haskell.org/~byorgey/code/hwn/

1 0

ANNOUNCE: X Haskell Bindings 0.3
by Antoine Latter 28 Jun '09

28 Jun '09

I'd like to announce the 0.3.* series release of the X Haskell Bindings. This release, like the prior 0.2.* series focuses on making the API prettier. This release is based on the XCB protocol descriptions version 1.5 This does mean that there's a good chance this is a breaking release for any code compiled against 0.2.*. The goal of XHB is to provide a Haskell implementation of the X11 wire protocol, similar in spirit to the X protocol C-language Binding (XCB). On Hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xhb Source: darcs get http://community.haskell.org/~aslatter/code/xhb/ New this release: * In 0.2, a lot of the core protocol requests, events and replies were updated to use prettier Haskell datatypes for the various enums and bitmasks. Thanks to Peter Harris's work on the protocol description XML files, these niceties have extended out to all of the extension requests, events and replies and such. * Due to name clashes, I the type-names for events and errors now include an "Event" or "Error" suffix. For example, the type "Notify" has become "NotifyEvent". * Now based on the protocol description version 1.5, from 1.4. Related projects: X protocol C-language Binding: http://xcb.freedesktop.org/

1 0

ANNOUNCE: Cal3D animation library
by Gregory D. Weber 27 Jun '09

27 Jun '09

The Cal3D for Haskell project provides a partial binding to the C++ Cal3D animation library. The project homepage is http://haskell.org/haskellwiki/Cal3d_animation There are three packages available on hackage: * cal3d-0.1 is a Haskell binding to the Cal3D library itself. * cal3d-opengl-0.1 adds a few functions for using Cal3D with OpenGL. * cal3d-examples-0.1 provides a simple example based on the Cally Demo. Cal3D is a C++ library for skeletal-based character animation. It is platform-independent and independent of any particular graphics API. In fact, it does not actually render the animation, but provides hooks that the graphics API (such as OpenGL) can use to do the actual drawing. (As far as I know, though, the only graphics API available for Haskell is OpenGL.) For more information about the (C++) Cal3D library, please see * Cal3D FAQ: http://cal3d.sourceforge.net/docs/api/html/cal3dfaq.html * Cal3D Homepage: http://home.gna.org/cal3d/ -- ___ ___ __ _ / _ \ / _ \| | | | Gregory D. Weber, Associate Professor / /_\// / | | | /\ | | Indiana University East / /_\\/ /__| | |/ \| | http://mypage.iu.edu/~gdweber/ \____/\_____/\___/\__/ Tel. (765) 973-8420; FAX (765) 973-8550

1 0

ANNOUNCE: jhc 0.6.1
by John Meacham 25 Jun '09

25 Jun '09

Hi, this is to announce the release of jhc 0.6.1. The jhc homepage with distribution information is at http://repetae.net/computer/jhc/ The main new feature in this release is a much simplified cross-compilation mechanism. While cross-compilation was always possible with jhc, it used to involve manually copying the C file and calling gcc with the right options on it, now this is taken care of by jhc. A (popular) example would be setting up an iPhone cross compilation target. For instance with the SDK setup I have, I would simply add the following to a file ~/.jhc/targets.ini [iphone] cc=arm-apple-darwin cflags+=-I/usr/local/arm-apple-darwin/include merge=le32 then you can compile iphone binaries with ; jhc --cross -miphone HelloWorld.hs the targets mechanism is extensible at run-time and I have included native unix, win32, osx-intel and osx-powerpc targets. But certainly many more interesting ones are possible. Some I have tested have been a nokia N770 as a target and an atheros MIPS based router running dd-wrt. There is more information on cross compilation in the jhc manual at http://repetae.net/computer/jhc/manual.html#crosscompilation jhc is also now available in the repetae yum repository which you can get at via ; rpm -i http://repetae.net/yum/repetae-repo-1.0-3.noarch.rpm ; yum install jhc Enjoy! John -- John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/

2 2