From blume at tti-c.org Thu Sep 3 11:11:24 2009 From: blume at tti-c.org (Matthias Blume) Date: Thu Sep 3 10:50:41 2009 Subject: [Haskell] *** FLOPS 2010: 2nd Call for Papers *** Message-ID: <2CDFAB3F-DBE2-4581-BE35-9F9404711317@tti-c.org> ---------------------------------------------------------------------------- SECOND CALL FOR PAPERS Tenth International Symposium on Functional and Logic Programming (FLOPS 2010) April 19-21, 2010 Sendai, Japan http://www.kb.ecei.tohoku.ac.jp/flops2010/ Submission deadline: October 16, 2009 FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise (2008). TOPICS FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to): Declarative Pearls: new and excellent declarative programs with illustrative applications. Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing. Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems. Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism. Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking. The proceedings will be published as an LNCS volume. The proceedings of the previous meeting (FLOPS 2008) were published as LNCS 4989. INVITED SPEAKERS TBD PC CO-CHAIRS Matthias Blume (Google, Chicago, USA) German Vidal (Technical University of Valencia, Spain) CONFERENCE CHAIR Naoki Kobayashi (Tohoku University, Sendai, Japan) PC MEMBERS Nick Benton (Microsoft Research, Cambridge, UK) Manuel Chakravarty (University of New South Wales, Australia) Michael Codish (Ben-Gurion University of the Negev, Israel) Bart Demoen (Katholieke Universiteit Leuven, Belgium) Agostino Dovier (University of Udine, Italy) John P. Gallagher (Roskilde University, Denmark) Maria Garcia de la Banda (Monash University, Australia) Michael Hanus (University of Kiel, Germany) Atsushi Igarashi (Kyoto University, Japan) Patricia Johann (Rutgers University, USA) Shin-ya Katsumata (Kyoto University, Japan) Michael Leuschel (University of Dusseldorf, Germany) Francisco Lopez-Fraguas (Complutense University of Madrid, Spain) Paqui Lucio (University of the Basque Country, Spain) Yasuhiko Minamide (University of Tsukuba, Japan) Frank Pfenning (Carnegie Mellon University, USA) Francois Pottier (INRIA, France) Tom Schrijvers (Katholieke Universiteit Leuven, Belgium) Chung-chieh "Ken" Shan (Rutgers University, USA) Zhong Shao (Yale University, USA) Jan-Georg Smaus (University of Freiburg, Germany) Nobuko Yoshida (Imperial College London, UK) LOCAL CHAIR Eijiro Sumii (Tohoku University, Sendai, Japan) SUBMISSION Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Submissions should fall into one of the following categories: Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. All submissions must be written in English and can be up to 15 proceedings pages long. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a web page, or an appendix). Papers should be submitted electronically at http://www.easychair.org/conferences/?conf=flops2010 IMPORTANT DATES Submission deadlines: - Abstract: October 16, 2009 - Paper: October 23, 2009 Author notification: December 21, 2009 Camera-ready copy: January 24, 2010 Conference: April 19-21, 2010 PLACE Sendai, Japan Some previous FLOPS: FLOPS 2008, Ise: http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/ FLOPS 2004, Nara FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/ SPONSOR JSSST SIG-PPL IN COOPERATION with AAFS (Asian Association for Foundation of Software) ACM SIGPLAN ALP (Association for Logic Programming) ---------------------------------------------------------------------------- From niklas.broberg at gmail.com Thu Sep 3 17:57:42 2009 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Thu Sep 3 17:37:01 2009 Subject: [Haskell] ANN: haskell-src-exts-1.1.4 Message-ID: Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.1.4! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Via darcs: darcs get http://code.haskell.org/haskell-src-exts * Report bugs: http://trac.haskell.org/haskell-src-exts 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. haskell-src-exts-1.1.4 follows version 1.1.3 in being a mostly experimental release. From a PVP perspective, the version number indicates that no incompatible changes have been made to the *stable* portion of the package, i.e. anything that doesn't contain Annotated in its module name. The experimental stuff in Language.Haskell.Annotated{.*} has changed quite a lot, but those of you who depend on it already must obviously know what you're doing. ;-) haskell-src-exts-1.1.4: =================== * For the stable part, the only new thing in haskell-src-exts-1.1.4 is a bug fix that allows declaration headers surrounded by parentheses to be parsed, e.g. "data (a :< b) = ...". * For the experimental part, the new and cool feature is a full exact-printer, allowing full round-tripping of parsing plus printing. In other words, using the parser and the exact-printer in conjunction gives the same result back: exactPrint . parse == id . (Well, that's half a lie since you need to use parseWithComments and some uncurrying if you want to so easily compose, but that's the gist of it anyway. :-)) * There have also been a number of further changes to the (annotated) AST to allow it to retain enough source information to allow for said exact-printing. In particular there have been changes to the way contexts and declaration heads are treated, and literals have been embellished to remember just how they were given (e.g. did we use 0xFF or 255? \BEL or \a?). * With a few small caveats, the round-tripping works over the full (alas somewhat small) test suite that comes with (the darcs version of) haskell-src-exts: - Trailing whitespace on a line is not retained. (The test suite uses reverse . dropWhile (isSpace) . reverse on each line to disregard that issue.) - Tab characters in the source are converted to (8) spaces (except when they appear inside comments or literals). (The test suite doesn't contain tabs.) - Exact specification of literals is only remembered for literals used as literals :-). What I mean is, source literals appearing in other positions in the source than as Haskell literals will be converted to a basic form. E.g. 'infixl 0x02 %%' will become 'infixl 2 %%'. Apart from infix declarations (tell me you never considered writing them that way!) this mostly matters for various pragmas. - Parentheses used around the function symbol in a function declaration will not be remembered (I can't figure out how to make a non-outrageous change to the AST to cope with them). E.g. '(foo a) b = ...' will be printed as 'foo a b = ...'. If anyone has an idea for a neat (or at least non-outrageous) AST fix that could handle these cases, drop me a line. - Literate source files are not handled by the exact-printer (can't re-literate them). Please, help me test this on your source code! If you grab a darcs version of the package from the repository, you can put any and all source files you want to test in the "haskell-src-exts/Test/examples" directory and then just run 'cabal test'. Please report any failing cases to my trac! :-) Cheers and Happy Haskelling, /Niklas From niklas.broberg at gmail.com Thu Sep 3 18:43:32 2009 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Thu Sep 3 18:22:55 2009 Subject: [Haskell] Re: [Haskell-cafe] ANN: haskell-src-exts-1.1.4 In-Reply-To: <06CE42D0-5229-47D7-9E1D-3CBE151CEC20@n-brain.net> References: <06CE42D0-5229-47D7-9E1D-3CBE151CEC20@n-brain.net> Message-ID: > Roundtrip is an important milestone for automated refactoring tools. Nice > work! Thanks a lot! Refactoring was indeed the 'killer app' in mind when writing the exact-printer. For instance I don't expect it to be hard to get HLint to apply suggestions automatically now, instead of just suggesting them. :-) Cheers, /Niklas From coreyoconnor at gmail.com Thu Sep 3 21:51:06 2009 From: coreyoconnor at gmail.com (Corey O'Connor) Date: Thu Sep 3 21:30:28 2009 Subject: [Haskell] ANN: vty-4.0.0.1 released Message-ID: Vty is a terminal UI library. Release 4.0.0.1 brings a number of important fixes, features, and performance enhancements. - Completely rewritten output backend. - Efficient, "scanline rasterization" style output span generator. Has not been fully optimized, but should be fast enough. - Terminfo based display terminal implementation. With specialized derivitives for xterm, Terminal.app, and iTerm.app. - Attempts to robustly handle even terminals that don't support all display attributes. - I've tested the following terminals with success: iTerm.app, Terminal.app, xterm, rxvt, mlterm, Eterm, gnome-terminal, konsole, screen, linux vty. Hopefully you will be as successfull. - Improved unicode support. Double wide characters will display as expected. - 256 color support. See Graphics.Vty.Attributes.Color240. The actual output color is adjusted according to the number of colors the terminal supports. - The Graphics.Vty.Image combinators no longer require matching dimensions to arguments! Unspecified areas are filled in with a user-customizable background pattern. See Graphics.Vty.Picture. - output picture will be cropped to display size as expected. - GHC 6.8 support is broken :-( - Unknown Windows platform support. - API changes: - "getSize" has been removed. Use "terminal vty >>= display_bounds" where "vty" is an instance of the Vty data structure. - added a "terminal" field to the Vty data structure. Accesses the TerminalHandle associated with the Vty instance. See Graphics.Vty.Terminal for details on the API usable with a TerminalHandle. - Graphics.Vty.Types has undergone a number of changes. Summary: - Partitioned into Graphics.Vty.Attributes for display attributes. Graphics.Vty.Image for image combinators. Graphics.Vty.Picture for final picture construction. - Graphics.Vty.Attributes: - "setFG" and "setBG" are now "with_fore_color" and "with_back_color" - All other "set.." equations similarly replaced. - "attr" is now "def_attr", short for "default display attributes" Also added a "current_attr" for "currently applied display attributes" - Graphics.Vty.Image: - "horzcat" is now "horiz_cat" - "vertcat" is now "vert_cat" - "renderBS" is now "utf8_bytestring" - "renderChar" is now "char" - "renderFill" is now "char_fill" - added a "utf8_string" and "string" (AKA "iso_10464_string") for UTF-8 encoded Strings and ISO-10464 encoded Strings. String literals in GHC have an ISO-10464 runtime representation. - Graphics.Vty.Picture: - exports Graphics.Vty.Image - "pic" is now "pic_for_image" - added API for setting background fill pattern. issues resolved: - "gnome terminal displays non-basic attributes as strikethrough" - http://trac.haskell.org/vty/ticket/14 - "Multi-byte characters are not displayed correctly on update" - http://trac.haskell.org/vty/ticket/10 - "Redraw does not handle rendering a line that extends beyond screen width characters" - http://trac.haskell.org/vty/ticket/13 - "The <|> and <-> combinators should be more forgiving of mismatched dimensions" - http://trac.haskell.org/vty/ticket/9 - "256-color support" - http://trac.haskell.org/vty/ticket/19 From leaf.pub1 at gmail.com Fri Sep 4 23:18:48 2009 From: leaf.pub1 at gmail.com (Leaf Petersen) Date: Fri Sep 4 22:58:03 2009 Subject: [Haskell] DAMP 2010 Final Call For Papers Message-ID: DAMP 2010: Workshop Declarative Aspects of Multicore Programming Madrid, SPAIN (colocated with POPL 2010) January 19, 2010 damp10.cs.nmsu.edu SUBMISSION DEADLINE: SEPTEMBER 21, 2009 The advent of multicore architectures has profoundly increased the importance of research in parallel computing. Modern platforms are becoming more complex and heterogenous and novel solutions are needed to account for their peculiarities. Multicore architectures will differ in significant ways from their multisocket predecessors. For example, the communication to compute bandwidth ratio is likely to be higher, which will positively impact performance. More generally, multicore architectures introduce several new dimensions of variability in both performance guarantees and architectural contracts, such as the memory model, that may not stabilize for several generations of product. Programs written in functional or (constraint-)logic programming languages, or in other highly declarative languages with a controlled use of side effects, can greatly simplify parallel programming. Such declarative programming allows for a deterministic semantics even when the underlying implementation might be highly non-deterministic. In addition to simplifying programming this can simplify debugging and analyzing correctness. DAMP 2010 is the fifth in a series of one-day workshops seeking to explore ideas in declarative programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. The emphasis will be on (constraint-)logic and functional programming, but any declarative programming language ideas that aim to raise the level of abstraction are welcome. DAMP seeks to gather together researchers in declarative approaches to parallel programming and to foster cross fertilization across different approaches. Specific topics include, but are not limited to: * investigation of applications of logic, constraint logic, and functional programing to multicore programing * run-time issues of exploitation of parallelism using declarative programming approaches (e.g., garbage collection, scheduling) * architectural impact on exploitation of parallelism from declarative languages * type systems and analysis for accurately detecting dependencies, aliasing, side effects, and impure features * language level declarative constructs for expressing parallelism * declarative language specification for the description of data placement and distribution * compilation and static analysis techniques to support exploitation of parallelism from declarative languages (e.g., granularity control) * practical experiences and challenges arising from parallel declarative programming * technology for debugging parallel programs * design and implementation of domain-specific declarative languages for multicore programming Submission: Submitted papers papers should not exceed 10 pages in ACM SIGPLAN conference format. Submission is electronic via: http://www.easychair.org/conferences/?conf=damp10 Accepted papers will be published in the ACM Digital Library and in a physical proceedings. Papers must adhere to the SIGPLAN Republication Policy: http://www.sigplan.org/republicationpolicy.htm Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. However, DAMP is intended to be a venue for discussion and exploration of works-in-progress, and so publication of a paper at DAMP 2010 is not intended to preclude later publication as appropriate. Additional information about the submission process can be found at the conference web site. Important dates: Abstract submission: Sept. 21 Paper submission: Sept. 25 Notification to authors: Oct. 26 Camera ready: Nov. 9 Program Chair: Enrico Pontelli New Mexico State University General Chairs: Leaf Petersen Intel Corporation Santa Clara, CA, USA Program Committee: Manuel Carro Universidad Politecnica de Madrid Clemens Grelck University of Hertfordshire Haifeng Guo University of Nebraska at Omaha Gabriele Keller University of New South Wales Hans-Wolfgang Loidl Ludwig-Maximilians-Universitat Munchen Leaf Petersen Intel Corporation John Reppy University of Chicago Ricardo Rocha University of Porto Kostis Sagonas National Technical University of Athens Vitor Santos Costa University of Porto Satnam Singh Microsoft Research Philip Trinder Heriot-Watt University Pascal Van Hentenryck Brown University URL: http://damp10.cs.nmsu.edu -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090904/2916a6bf/attachment.html From byorgey at seas.upenn.edu Sat Sep 5 16:56:10 2009 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Sat Sep 5 16:35:26 2009 Subject: [Haskell] Haskell Weekly News: Issue 129 - September 5, 2009 Message-ID: <20090905205610.GB4041@seas.upenn.edu> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090905 Issue 129 - September 05, 2009 --------------------------------------------------------------------------- Welcome to issue 129 of HWN, a newsletter covering developments in the [1]Haskell community. The [2]Haskell Symposium was a great success, with many [3]interesting talks and a good discussion on the future of Haskell. Watch this space for links to video from the Symposium as it becomes available! Announcements HStringTemplate 0.6.2. Sterling Clover [4]announced some new features in the [5]HStringTemplate library, including simple quasiquotation; proper Unicode support; creation of groups from hierarchies of directories; separators applied within iterated template application; depthwise chained iterated template application; generalized encoding functions; and more. fclabels-0.4.0 - First class accessor labels. Sebastiaan Visser [6]announced a new release of the [7]fclabels package, straight from ICFP in Edinburgh. The package provides first-class labels which act as fully composable, bidirectional record fields, as well as support for automatically generating them from record types. vty-4.0.0.1 released. Corey O'Connor [8]announced release 4.0.0.1 of [9]vty, a terminal UI library. This release brings a number of important fixes, features, and performance enhancements, including a completely rewritten output backend; efficient, "scanline rasterization" style output span generator; terminfo based display terminal implementation; improved Unicode support; 256 color support; and more. haskell-src-exts-1.1.4. Niklas Broberg [10]announced the release of [11]haskell-src-exts-1.1.4, a package for Haskell source code manipulation. The experimental code in Language.Haskell.Annotated{.*} has changed quite a lot, although the stable portion of the package interface has not changed. Significantly, the package now includes an exact-printer which allows round-tripping between parsing and pretty-printing to be the identity. Next BostonHaskell meeting: September 16th at MIT (32G-882). Ravi Nanavati [12]announced the September meeting of the Boston Area Haskell Users' Group, to be held Wednesday, September 16th from 7pm - 9pm. As usual, it will be held in the MIT CSAIL Reading Room (32-G882, on the 8th floor of the Gates Tower of the MIT's Stata Center at 32 Vassar St in Cambridge, MA). The featured speaker will be Edward Kmett, who will be presenting the second part of his monoids and parsing presentation: "A Parallel Parsing Trifecta: Iteratees, Parsec, and Monoids". lenses -- Simple Functional Lenses. Job Vranish [13]announced the release of [14]lenses, a simple but powerful implementation of function lenses (aka functional references/accessors). This library provides a convenient way to access and update the elements of a structure. It is very similar to Data.Accessors, but simpler, a bit more generic and has fewer dependencies. Dutch HUG: meeting next week (September 11th) in Utrecht. Tom Lokhorst [15]invited functional programmers in The Netherlands to the [16]Dutch Haskell User Group, meeting Friday, September 11 at 19:00 in the [17]Booth Hall of the Utrecht University Library. Thomas (noknok) will be talking about his system for doing propositional logic in Haskell. Pedro will give an introductory talk about generic programming, and Sean will talk about xformat, a library for extensible and type-safe formatting with scanf- and printf-like functions. There is also still space for short 5-minute lighting talk about something related to Haskell or functional programming; contact Tom if you're interested. moe html combinator. Jinjing Wang [18]announced the release of [19]moe, a DSL for generating HTML. jail-0.0.1 - Jailed IO monad. Sebastiaan Visser [20]announced the first release of the [21]jail package, a jailed IO monad that can restrict filesystem access for your code. scion 0.1. Thomas Schilling [22]announced the first release of [23]Scion, a Haskell library that aims to implement those parts of a Haskell IDE which are independent of a particular front-end. Scion is based on the GHC API and Cabal. It provides both a Haskell API and a server for non-Haskell clients such as Emacs and Vim. Blog noise [24]Haskell news from the [25]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Don Stewart (dons): [26]DEFUN 2009: Multicore Programming in Haskell Now!. * Bryan O'Sullivan: [27]Slides from my CUFP 2009 keynote talk. * LHC Team: [28]Yet another unfair benchmark.. * Alex McLean: [29]Hackpact documentation. * >>> Jeff Foster: [30]Exploring Haskell's List Functions. * Don Stewart (dons): [31]Parallel Programming in Haskell: A Reading List. * David Amos: [32]Finite fields, part 2. * >>> Jeff Foster: [33]Debugging in Haskell. * apfelmus: [34]Fun with Morse Code. * Ketil Malde: [35]Parsing ints. * Alex McLean: [36]Hackpact. * Greg Bacon: [37]Finding duplicates with Perl and Haskell. * Colin Adams: [38]Selecting software for a replacement for this website. * Don Stewart (dons): [39]Haskell Popularity Rankings: September 2009. * Mikael Vejdemo-Johansson: [40][Stanford] MATH 198: Category Theory and Functional Programming. * Jeff Heard: [41]HDR imaging library for Haskell based on pfsutils. * David Amos: [42]Extension fields. * Magnus Therning: [43]Trying to work out iteratees. Quotes of the Week * benmachine: ho hum. I understand both your positions. but i don't understand mine, now :( * ksf: agda is actually a secret mindwar-weapon of the illuminati, who want to wrack your nerves with excessively big symbol sets requiring a keyboard with 10 modifier keys. just like APL. * Axman6: does anyone else think that C++ looks like a dead fish? (C++<) * Cale: The difference between Many Worlds and Copenhagen is a garbage collector ;) * apfelmus: Lambda Fu, form 72 - three way dragon zip: 'averages3 xs = zipWith3 avg xs (drop 1 xs) (drop 2 xs); where avg a b c = (a+b+c) / 3' About the Haskell Weekly News New editions are posted to [44]the Haskell mailing list as well as to [45]the Haskell Sequence and [46]Planet Haskell. [47]RSS is also available, and headlines appear on [48]haskell.org. To help create new editions of this newsletter, please see the information on [49]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [50]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://www.haskell.org/haskell-symposium/2009/ 3. http://www.haskell.org/haskell-symposium/2009/schedule.html 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63108 5. http://hackage.haskell.org/package/HStringTemplate 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63082 7. http://hackage.haskell.org/package/fclabels 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63072 9. http://hackage.haskell.org/package/vty 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63068 11. http://hackage.haskell.org/package/haskell-src-exts 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63067 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63059 14. http://hackage.haskell.org/package/lenses 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63000 16. http://www.haskell.org/haskellwiki/Dutch_HUG 17. http://www.uu.nl/EN/library/contact/university_library/zaalverhuur/Pages/default.aspx#booth 18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/62865 19. http://hackage.haskell.org/package/moe 20. http://article.gmane.org/gmane.comp.lang.haskell.cafe/62839 21. http://hackage.haskell.org/package/jail 22. http://article.gmane.org/gmane.comp.lang.haskell.cafe/62820 23. http://hackage.haskell.org/package/scion 24. http://planet.haskell.org/ 25. http://haskell.org/haskellwiki/Blog_articles 26. http://donsbot.wordpress.com/2009/09/05/defun-2009-multicore-programming-in-haskell-now/ 27. http://www.serpentine.com/blog/2009/09/04/slides-from-my-cufp-2009-keynote-talk/ 28. http://lhc-compiler.blogspot.com/2009/09/yet-another-unfair-benchmark.html 29. http://yaxu.org/hackpact-documentation/ 30. http://www.fatvat.co.uk/2009/09/exploring-haskells-list-functions.html 31. http://donsbot.wordpress.com/2009/09/03/parallel-programming-in-haskell-a-reading-list/ 32. http://haskellformaths.blogspot.com/2009/09/finite-fields-part-2.html 33. http://www.fatvat.co.uk/2009/09/debugging-in-haskell.html 34. http://apfelmus.nfshost.com/fun-with-morse-code.html 35. http://blog.malde.org/index.php/2009/08/31/parsing-ints/ 36. http://yaxu.org/hackpact/ 37. http://feedproxy.google.com/~r/gbacon/~3/aaZePz6Gv2Q/finding-duplicates-with-perl-and.html 38. http://colina.demon.co.uk/?q=node/753 39. http://donsbot.wordpress.com/2009/08/29/haskell-popularity-rankings-september-2009/ 40. http://blog.mikael.johanssons.org/archive/2009/08/stanford-math-198-category-theory-and-functional-programming/ 41. http://vis.renci.org/jeff/2009/08/28/hdr-imaging-library-for-haskell-based-on-pfsutils/ 42. http://haskellformaths.blogspot.com/2009/08/extension-fields.html 43. http://therning.org/magnus/archives/735 44. http://www.haskell.org/mailman/listinfo/haskell 45. http://sequence.complete.org/ 46. http://planet.haskell.org/ 47. http://sequence.complete.org/node/feed 48. http://haskell.org/ 49. http://haskell.org/haskellwiki/HWN 50. http://code.haskell.org/~byorgey/code/hwn/ From byorgey at seas.upenn.edu Sat Sep 5 17:26:08 2009 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Sat Sep 5 17:05:21 2009 Subject: [Haskell] Looking for a new HWN editor Message-ID: <20090905212608.GA379@seas.upenn.edu> Executive summary: * I'm looking for someone to take over as HWN editor * It is highly automated and doesn't take as much time as you might think (about 3-4 hours/week on average) * You DON'T need to be a Haskell guru * It is far from a thankless job and is a fun way to provide an appreciated service to the community! Read on for more details! ------------------------------------------------------------------------- Hi all, As you probably know, I've been the editor of the Haskell Weekly News for a little over a year now, and I've decided that it's time for me to move on to other things. So, I'm looking for someone to volunteer to take over as HWN editor. Why might you want to do this? It's true that there is no concrete reward. But judging from the number of comments I have received from people over the past year, the HWN provides a valuable and appreciated service to the Haskell community: there are many who simply don't have time to read the mailing lists, but like to know about new libraries, compiler releases, interesting discussions, and other major goings-on in the community. What does the editorship entail? Thanks to some automated tools developed specifically for the job, it doesn't take as much time as you might think: usually about 4 hours per week; most of that is spent simply reading/skimming various Haskell mailing lists to pick out items for the HWN. The process generally goes like this: * pick out funny quotes from the IRC channel using an automated tool * pick out Haskell-related blog posts using an automated tool * pick out announcements and discussions from the mailing list with an automated tool, writing a short blurb for each (usually this just involves cutting and pasting from the announcement itself, with a bit of editing to make it flow * compile text and HTML versions with an automated tool * post to sequence.complete.org and the mailing list. There are much more detailed instructions written up, and of course I'll be happy to provide detailed help and support for the first few weeks of the new editor's tenure. I should emphasize that the HWN editor does NOT need to be a Haskell guru. In fact, this could be an ideal job for someone who is relatively new to Haskell and the community, but would like to contribute in a tangible way. I also want to emphasize that with the change in editorship, the HWN need not remain exactly the same: if you have exciting ideas about changes to make to the format or content, be my guest! The HWN will be whatever you make of it. So, let me know if you are interested! There won't be any formal interview process; the first person to contact me who wants to do it, gets the job. But of course, if you are not sure and want more information, feel free to email me with questions. -Brent From byorgey at seas.upenn.edu Sat Sep 5 19:34:24 2009 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Sat Sep 5 19:13:37 2009 Subject: [Haskell] Looking for a new HWN editor In-Reply-To: <20090905212608.GA379@seas.upenn.edu> References: <20090905212608.GA379@seas.upenn.edu> Message-ID: <20090905233424.GA29650@seas.upenn.edu> On Sat, Sep 05, 2009 at 05:26:08PM -0400, Brent Yorgey wrote: > Executive summary: > > * I'm looking for someone to take over as HWN editor > * It is highly automated and doesn't take as much time as you might > think (about 3-4 hours/week on average) > * You DON'T need to be a Haskell guru > * It is far from a thankless job and is a fun way to provide an > appreciated service to the community! The position has been filled! More details to come. -Brent From carliros.g at gmail.com Sat Sep 5 20:04:47 2009 From: carliros.g at gmail.com (carlos gomez) Date: Sat Sep 5 19:44:07 2009 Subject: [Haskell] Looking for a new HWN editor In-Reply-To: <20090905233424.GA29650@seas.upenn.edu> References: <20090905212608.GA379@seas.upenn.edu> <20090905233424.GA29650@seas.upenn.edu> Message-ID: I'm interested too. Is there any place for one more ? 2009/9/5 Brent Yorgey > On Sat, Sep 05, 2009 at 05:26:08PM -0400, Brent Yorgey wrote: > > Executive summary: > > > > * I'm looking for someone to take over as HWN editor > > * It is highly automated and doesn't take as much time as you might > > think (about 3-4 hours/week on average) > > * You DON'T need to be a Haskell guru > > * It is far from a thankless job and is a fun way to provide an > > appreciated service to the community! > > The position has been filled! More details to come. > > -Brent > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090905/f8162bc8/attachment.html From trebla at vex.net Sat Sep 5 20:31:18 2009 From: trebla at vex.net (Albert Y. C. Lai) Date: Sat Sep 5 20:10:34 2009 Subject: [Haskell] Looking for a new HWN editor In-Reply-To: References: <20090905212608.GA379@seas.upenn.edu> <20090905233424.GA29650@seas.upenn.edu> Message-ID: <4AA302D6.6060800@vex.net> carlos gomez wrote: > I'm interested too. Is there any place for one more ? If we have two editors (let's say), we can set up a redundantly highly available roster: * usually they take turns to release issues * but they have a way to arrange "I'm unavailable this weekend, please do this weekend for me, in exchange of..." * if one resigns, we still have the other to keep going for a few weeks, during which we have time to find one more editor and restore the redundancy. From johanj at cs.uu.nl Sun Sep 6 12:54:48 2009 From: johanj at cs.uu.nl (Johan Jeuring) Date: Sun Sep 6 12:34:00 2009 Subject: [Haskell] ANNOUNCE: Palindromes 0.1 Message-ID: Palindromes ============================================== Palindromes is a package for finding palindromes in files. Visit the homepage http://www.jeuring.net/Palindromes/ Features -------- The primary features of Palindromes include: * Linear-time algorithm for finding exact palindromes * Linear-time algorithm for finding text palindromes, ignoring spaces, case of characters, and punctuation symbols. Requirements ------------ Palindromes has the following requirements: * GHC version 6.8.1 or later - It has been tested with version 6.10.1. * Cabal library version 1.2.1 or later - It has been tested with version 1.6.0.1. Download & Installation ----------------------- * Use cabal-install cabal install palindromes * If you don't have cabal-install, you must download the Palindromes package from HackageDB and install it manually. Get the `tar.gz` file and decompress it. http://hackage.haskell.org/package/palindromes Once downloaded, use the following commands for configuring, building, and installing the library. runghc Setup.lhs configure runghc Setup.lhs build runghc Setup.lhs install * Get the source: svn checkout https://subversion.cs.uu.nl/repos/staff.johanj.palindromes/ Documentation ------------- The API is documented using Haddock and available on the Palindromes package site. Examples -------- You can find example palindromes, on which Palindromes has been tested, in the `examples` directory of the source distribution. https://subversion.cs.uu.nl/repos/staff.johanj.palindromes/trunk/examples/palindromes Bugs & Support -------------- To report bugs, use the Google Code project page for Palindromes. http://code.google.com/p/palindromes/ For general concerns and questions, email the author: johan at jeuring.net Licensing --------- Palindromes is licensed under the so-called BSD3 license. See the included `LICENSE` file. Credits ------- Palindromes is based on the functional program developed by Johan Jeuring in his PhD thesis. The current author and maintainer of Palindromes is Johan Jeuring. http://www.jeuring.net/ From byorgey at seas.upenn.edu Sun Sep 6 13:17:40 2009 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Sun Sep 6 12:56:49 2009 Subject: [Haskell] Looking for a new HWN editor In-Reply-To: <4AA302D6.6060800@vex.net> References: <20090905212608.GA379@seas.upenn.edu> <20090905233424.GA29650@seas.upenn.edu> <4AA302D6.6060800@vex.net> Message-ID: <20090906171740.GA19801@seas.upenn.edu> On Sat, Sep 05, 2009 at 08:31:18PM -0400, Albert Y. C. Lai wrote: > carlos gomez wrote: >> I'm interested too. Is there any place for one more ? > > If we have two editors (let's say), we can set up a redundantly highly > available roster: > > * usually they take turns to release issues > * but they have a way to arrange "I'm unavailable this weekend, please do > this weekend for me, in exchange of..." > * if one resigns, we still have the other to keep going for a few weeks, > during which we have time to find one more editor and restore the > redundancy. Sure, this could be a good idea. But I will leave it up to the new editor to decide. -Brent From carliros.g at gmail.com Mon Sep 7 13:42:45 2009 From: carliros.g at gmail.com (carlos gomez) Date: Mon Sep 7 13:21:56 2009 Subject: [Haskell] Looking for a new HWN editor In-Reply-To: <20090906171740.GA19801@seas.upenn.edu> References: <20090905212608.GA379@seas.upenn.edu> <20090905233424.GA29650@seas.upenn.edu> <4AA302D6.6060800@vex.net> <20090906171740.GA19801@seas.upenn.edu> Message-ID: Yeah, two heads think better than one. 2009/9/6 Brent Yorgey > On Sat, Sep 05, 2009 at 08:31:18PM -0400, Albert Y. C. Lai wrote: > > carlos gomez wrote: > >> I'm interested too. Is there any place for one more ? > > > > If we have two editors (let's say), we can set up a redundantly highly > > available roster: > > > > * usually they take turns to release issues > > * but they have a way to arrange "I'm unavailable this weekend, please do > > this weekend for me, in exchange of..." > > * if one resigns, we still have the other to keep going for a few weeks, > > during which we have time to find one more editor and restore the > > redundancy. > > Sure, this could be a good idea. But I will leave it up to the new > editor to decide. > > -Brent > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090907/bc012fde/attachment.html From drcygnus at gmail.com Tue Sep 8 01:22:18 2009 From: drcygnus at gmail.com (Jonathan Daugherty) Date: Tue Sep 8 01:01:25 2009 Subject: [Haskell] ANNOUNCE: dbmigrations 0.1 Message-ID: dbmigrations is: A library and program for the creation, management, and installation of schema updates (called migrations) for a relational database. In particular, this package lets the migration author express explicit dependencies between migrations and the management tool automatically installs or reverts migrations accordingly, using transactions for safety. This package is written to support any HDBC-supported database, although at present only PostgreSQL is fully supported. To get started, see the included README and MOO.TXT files and the usage output for the "moo" command. Get it from Hackage: http://hackage.haskell.org/package/dbmigrations Or get the source with darcs: http://repos.codevine.org/dbmigrations/ This package is motivated by the need for a framework-independent, solid tool to manage database schema changes in a clean way without assuming a linear sequence of changes assumed by existing tools. dbmigrations lets you manage a forest of schema changes. Future work will include an hscurses-based tool to visualize and manipulate available migrations and their dependencies and support for other database engines. Please don't hesitate to send patches, feedback, and criticism directly to me at drcygnus AT gmail DOT com. I'd like to say thanks to Josh Hoyt and Jason Dagit for suggesting improvements, providing support, and showing me how beautiful Haskell is. Thanks! Enjoy! -- Jonathan Daugherty From Jean-Christophe.Filliatre at lri.fr Tue Sep 8 03:16:13 2009 From: Jean-Christophe.Filliatre at lri.fr (=?ISO-8859-1?Q?Jean-Christophe_Filli=E2tre?=) Date: Tue Sep 8 02:53:57 2009 Subject: [Haskell] Last Call for Papers: VSTTE 2009 Message-ID: <4AA604BD.2040808@lri.fr> ********************************************************* * * * VSTTE 2009 * * * * Workshop on Verified Software * * Theory Tools and Experiments * * * * (affiliated with Formal Methods Week) * * * * November 2, 2009 * * Eindhoven, the Netherlands * * http://vstte09.lri.fr/ * * * * Deadline for submissions: Sep 11, 2009 * * * ********************************************************* FM 2009 is the sixteenth in a series of symposia of the Formal Methods Europe association, and the second one that is organized as a world congress. Ten years after FM'99, the 1st World Congress, the formal methods communities from all over the world will once again have an opportunity to meet. FM 2009 will be both an opportunity to celebrate, and an opportunity to join in when enthusiastic researchers and practitioners from a diversity of backgrounds and schools come together to discuss their ideas and experiences. 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. This includes topics like: * Program logic * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications Papers about tool architectures, and their achievements are most welcome. The contributed papers, which should report on previously unpublished work, can reflect current and preliminary work in areas of software verification. New technical results, overviews of new developments in software verification projects, short papers accompanying tool demonstrations, as well as position papers on how to further advance the goal of verified software are all welcome. SUBMISSION PROCEDURE ==================== VSTTE proceedings will be published as a special issue of the Software Tools for Technology Transfer (STTT) journal. Submitted papers should not have been submitted elsewhere for publication. Papers should use Springer-Verlag's STTT package ftp://ftp.springer.de/pub/tex/latex/svjour/sttt/, and should not exceed 15 pages including appendices. Papers are processed through the EasyChair conference management system. IMPORTANT DATES =============== Submission deadline September 11, 2009, 11:59pm Samoa time (UTC-11) Notification of acceptance October 2, 2009 Final version October 16, 2009 PROGRAM COMMITTEE ================= * David Deharbe, Dimap UFRN, Brazil * Dino Distefano, Queen Mary University of London, UK * Jean-Christophe Filli?tre (co-chair), CNRS, France * Leo Freitas (co-chair), University of York, UK * John McDermott, Naval Research Laboratory, USA * Yannick Moy, AdaCore, France * Arnaud Venet, Kestrel Technology, USA CONTACT ======= Leo Freitas, leo@cs.york.ac.uk Department of Computer Science University of York, YO10 5DD York, UK Tel: (+44) (0) 1904 434753 Jean-Christophe Filliatre, Jean-Christophe.Filliatre@lri.fr CNRS / INRIA Saclay - Ile-de-france - ProVal Parc Orsay Universite, batiment N 4, rue Jacques Monod 91893 Orsay Cedex FRANCE Tel: (+33) (0)1 74 85 42 27 FURTHER INFORMATION =================== Further information will be put on the workshop web-page http://vstte09.lri.fr/. From joubert at dsic.upv.es Tue Sep 8 06:32:19 2009 From: joubert at dsic.upv.es (Christophe Joubert) Date: Tue Sep 8 06:11:25 2009 Subject: [Haskell] CfPart: FMICS 2009, 2-3 November 2009 Message-ID: <4AA632B3.5030504@dsic.upv.es> FMICS 2009 - FIRST CALL FOR PARTICIPATION Please visit: http://users.dsic.upv.es/workshops/fmics2009 ************************************************************ * 14th International Workshop on * * Formal Methods for Industrial Critical Systems * * FMICS 2009 * * * * November 2-3, 2009 * * Eindhoven, The Netherlands * ************************************************************ * ** NEWS ** * * * * >> Full programme for FMICS 2009 now available * * * * >> Registration for FMICS 2009 is open * * Early registration before September 14 * * * * >> FMICS 2009 proceedings available as LNCS 5825 * * * ************************************************************ FMICS 2009 is the fourteenth in a series of International Workshop on Formal Methods for Industrial Critical Systems. Previous workshops of the ERCIM working group on Formal Methods for Industrial Critical Systems were held in Oxford (March 1996), Cesena (July 1997), Amsterdam (May 1998), Trento (July 1999), Berlin (April 2000), Paris (July 2001), Malaga (July 2002), Trondheim (June 2003), Linz (September 2004), Lisbon (September 2005), Bonn (August 2006), Berlin (July 2007), and L'Aquila (September 2008). The aim of the FMICS workshop series is to provide a forum for researchers who are interested in the development and application of formal methods in industry. In particular, these workshops bring together scientists and engineers who are active in the area of formal methods and are interested in exchanging their experiences in the industrial usage of these methods. These workshops also strive to promote research and development for the improvement of formal methods and tools for industrial applications. Complete and up to date information can be found at the event website http://users.dsic.upv.es/workshops/fmics2009/. FMICS 2009 is part of the 1st FMweek (Formal Methods week, http://www.win.tue.nl/fmweek/), which brings together 10 international scientific events, 6 project and working group meetings, and a variety of other activities in the area. Further information about the FMICS working group and the next FMICS workshop can be found at: http://www.inrialpes.fr/vasy/fmics. The topics chosen for FMICS 2009 include: - design, specification, code generation and testing based on formal methods; - methods, techniques and tools to support automated analysis, certification, debugging, learning, optimization and transformation of complex, distributed, real-time and embedded systems; - verification and validation methods that address shortcomings of existing methods with respect to their industrial applicability (e.g., scalability and usability issues); - tools for the development of formal design descriptions; - case studies and experience reports on industrial applications of formal methods, focusing on lessons learned or new research directions; - impact and costs of the adoption of formal methods; - application of formal methods in standardization and industrial forums; In response to the call for papers, 24 contributions were submitted from 16 different countries. The Program Committee selected ten papers, basing this choice on their scientific quality, originality, and relevance to the workshop. Each paper was reviewed by at least three Program Committee members or external referees. The programme also includes four invited contributions as well as six poster descriptions. INVITED SPEAKERS ---------------- Dino Distefano Queen Mary, University of London, UK Diego Latella CNR/ISTI, Italy Thierry Lecomte ClearSy, France Ken McMillan Cadence Berkeley Labs, USA Following a tradition established over the past few years, the European Association of Software Science and Technology (EASST) will offer an award to the best FMICS paper. VENUE ----- The venue for FMICS 2009 is the Auditorium of Eindhoven University of Technology. The university campus lies in the centre of Eindhoven, within walking distance of conference hotels. The city itself can easily be reached via both its own airport and Schiphol (the Dutch mainport). REGISTRATION ------------ The event website provides a one-stop window where participants can register to FMICS 2009 and to any combination of FMweek events they would like to participate in, and make hotel reservation for their stay in Eindhoven. ************************************************************ * * * +============================================+ * * | | * * | ** FMweek ** | * * | | * * +============================================+ * * | FMICS | FM2009 | REFINE | * * +--------------------------------------------+ * * | PDMC | TESTCOM/FATES | * * +--------------------------------------------+ * * | FACS | CPA | FAST | FMCO | * * +--------------------------------------------+ * * | http://www.win.tue.nl/fmweek | * * +============================================+ * * * ************************************************************ SPONSORS -------- FMICS 2009 is sponsored by the following institutions: the Universidad Politecnica de Valencia, ERCIM, FME, Microsoft Research, the Departamento de Sistemas Informaticos y Computacion (UPV), MEC (Feder) Tin2007-30509-E, EASST, and the Technical University of Eindhoven. From DekuDekuplex at Yahoo.com Tue Sep 8 07:16:27 2009 From: DekuDekuplex at Yahoo.com (Benjamin L.Russell) Date: Tue Sep 8 06:59:05 2009 Subject: [Haskell] Looking for a new HWN editor References: <20090905212608.GA379@seas.upenn.edu> <20090905233424.GA29650@seas.upenn.edu> Message-ID: On Sat, 5 Sep 2009 19:34:24 -0400, Brent Yorgey wrote: >On Sat, Sep 05, 2009 at 05:26:08PM -0400, Brent Yorgey wrote: >> Executive summary: >> >> * I'm looking for someone to take over as HWN editor >> * It is highly automated and doesn't take as much time as you might >> think (about 3-4 hours/week on average) >> * You DON'T need to be a Haskell guru >> * It is far from a thankless job and is a fun way to provide an >> appreciated service to the community! > >The position has been filled! More details to come. Wow! That was a quick decision! Most Haskell users probably didn't even have time to read the announcement before the position was filled; I certainly did not. Well, since this position has already been filled, there's probably not much that can be done (other than ask the new editor and hope that he/she is understanding), but just to give a fair opportunity to all Haskell users, if the editor changes again, it may be helpful at least to give everybody an opportunity to read the announcement and apply for the position. Just my two cents.... -- Benjamin L. Russell -- Benjamin L. Russell / DekuDekuplex at Yahoo dot com http://dekudekuplex.wordpress.com/ Translator/Interpreter / Mobile: +011 81 80-3603-6725 "Furuike ya, kawazu tobikomu mizu no oto." -- Matsuo Basho^ From doaitse at swierstra.net Tue Sep 8 11:18:18 2009 From: doaitse at swierstra.net (S.Doaitse Swierstra) Date: Tue Sep 8 10:57:22 2009 Subject: [Haskell] Ph.D position, Utrecht University, the Netherlands Message-ID: =================================================== Vacancy PhD student on Realizing Optimal Sharing in the Functional Language Implementations Utrecht University, The Netherlands. =================================================== Within the Software Technology group of the Information and Computing Sciences department of Utrecht University there is a vacancy for a PhD student to work on the efficient implementation of functional languages. The position is funded by NWO, the Netherlands Organization for Scientific Research. ----------------------------------------------------------------------------------------- Project summary: Lambda-calculus and term rewriting are models of computation lying at the basis of functional programming languages. Both possess syntactic meta-theories based on analyzing rewrite steps. Unfortunately, naive implementations are inefficient, since subterms are frequently copied. To overcome this problem in both theoretical systems and actual implementations, duplicate work is avoided by using graph-based term representations, in which identical subterms can be (but not always are) shared. The question arises whether graph-representations and their reductions that are optimal in a theoretical sense can also be practical from an implementer's point of view. However, so far it is unclear whether nice theoretical ideas combine well with existing implementation methods. The overall-goal of this project is to answer this question in a back-and-forth communication between theoretical concepts and practical realizations. Starting points are the recent work on the optimal Lambdascope implementation based on context sharing, and the Haskell implementation developed at Utrecht University. One of the open problems is whether the Lambdascope framework can be extended to efficiently represent sets of mutually recursive definitions. Another, whether global program analysis can discover where Lambdascope-based approaches solve problems due to insufficient sharing. If both questions can be solved, we want to combine Lambdascope-based implementations with conventional frameworks, and investigate how efficient the resulting implementations become. The unique combination of the theoretical depth from the Logic department and the implementation skills and compiler infrastructure from the Computer Science department make Utrecht University the optimal surroundings for such a project. ----------------------------------------------------------------------------------------- Project leaders are Prof.dr. Doaitse Swierstra and dr. Vincent van Oostrom (principal investigator). The project will be executed in close cooperation between * the Software Technology group (http://www.cs.uu.nl/wiki/Center) of the Information and Computing Sciences department (http://www.cs.uu.nl/ ) * and the Theoretical Philosophy group (http://www.uu.nl/EN/faculties/Humanities/research/researchinstitutes/zeno/research/theoreticalphilosophy/Pages/default.aspx ) of the Philosophy department (http://www.phil.uu.nl/), and between * the more practically oriented PhD student and * the more theory oriented postdoc. ----------------------------------------------------------------------------------------- Requirements: Master degree in Computer Science, Logic, or equivalent. Good knowledge of functional programming, and several advanced computer science techniques. Knowledge of lambda-calculus implementations, Haskell, and compiler construction will be useful. Both theory and software development based on this should appeal to you. Terms of employment: the PhD student should start as soon as possible, but no later than January 1, 2010. The position is for four years (after one year there will be an evaluation), full-time. Gross salary starts with ? 2042,-- per month in the first year and increases to ? 2612,-- in the fourth year of employment. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 3%. In addition we offer: a pension scheme, partially paid parental leave, facilities for child care, flexible employment conditions in which you may trade salary for vacation days or vice versa. Conditions are based on the Collective Employment Agreement of the Dutch Universities: http://www.vsnu.nl/Workstudy/Universities-as-employers-/Collective-Labour-Agreement.htm More information: * about the project can be found on http://www.cs.uu.nl/wiki/bin/view/Center/OptimalSharing * about the Software Technology group on http://www.cs.uu.nl/wiki/Center * about the Information and Computing Sciences department on http://www.cs.uu.nl/ * about this vacancy can be obtained from Doaitse Swierstra (doaitse@cs.uu.nl , +31 6 4613 6929). Send your application in pdf (or another non-proprietary format) to mailto:SciencePenO@uu.nl with a cc to mailto:doaitse@cs.uu.nl. on or before Sept 31, 2009. Mention vacancy nr 62910. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090908/c05b54ea/attachment.html From dan.doel at gmail.com Tue Sep 8 15:41:02 2009 From: dan.doel at gmail.com (Dan Doel) Date: Tue Sep 8 15:20:15 2009 Subject: [Haskell] ANNOUNCE: uvector-algorithms 0.2 Message-ID: <200909081541.03112.dan.doel@gmail.com> Greetings, It is my pleasure to announce version 0.2 of the uvector-algorithms package. The package so far has implementations of several sorting and selection algorithms for use on the mutable arrays from the uvector library, as well as combinators for applying them to immutable arrays. New developments in this version include: - A simple benchmarking program for testing the performance of the algorithms (it's what I use to measure them, but I only have one computer to run it on, so perhaps other folks might want to see how it works on their machine) - A testing program, written with quick check to verify properties of the algorithms - Several bugs found and fixed due to the above tests and using HPC to verify good program coverage - Combinators for Schwartzian transform - Reworking radix sort to be more amenable to optimization. It's now around twice as fast. - A Radix instance for strict pairs, and a radix sortBy - Merge sort is now slightly faster due to memcpy in uvector :) The library can be found at hackage: http://hackage.haskell.org/package/uvector-algorithms or in its darcs repository: http://code.haskell.org/~dolio/uvector-algorithms/ As always, I can be notified of any issues. Enjoy. -- Dan From ivan.miljenovic at gmail.com Wed Sep 9 05:59:07 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Wed Sep 9 05:38:17 2009 Subject: [Haskell] ANNOUNCE: graphviz-2999.5.0.0 Message-ID: <87r5ugmob8.fsf@gmail.com> I am pleased to announce version 2999.5.0.0 [1] of the graphviz [2] package for Haskell. This is what I like to think of as the "Hey, this is almost getting to be a decent library!" version :p [1] http://hackage.haskell.org/packages/archive/graphviz/2999.5.0.0/graphviz-2999.5.0.0.tar.gz [2] http://hackage.haskell.org/package/graphviz The graphviz package provides bindings to the GraphViz [3] suite of programs by providing the ability to generate and parse GraphViz's Dot [4] language as well as wrappers around the tools themselves. [3] http://www.graphviz.org/ [4] http://www.graphviz.org/doc/info/lang.html This is an almost complete re-write of the previously released version (2999.1.0.2): I do not mean that this version was re-written from scratch, but substantial portions of the library have been improved or replaced. As such, current users of this library will unfortunately have to update their code that uses it. The major changes (becuase there's probably heaps of smaller changes I've forgotten about) are: * Parsing and printing of Dot code was re-written to use the new ParseDot and PrintDot classes rather than the old Parseable class and the Show class. What this means for the end-user is that quotation problems should finally all be resolved (I hope...). In particular, proper quotation of String values is now done automagically: if it is found that the String to be printed requires quoting (because it does not match the format required for non-quoted String values), then quotes within the String are escaped and the entire String is quoted. As part of this, the Data.GraphViz.ParserCombinators module has been moved to Data.GraphViz.Types.Parsing. * Re-write the various Dot* datatypes in Data.GraphViz.Types. Sub-graphs/clusters are now their own entity rather than being part of DotNode and the Node ID type is now a type parameter rather than being just Int. Sub-graphs/clusters can now also be parsed. DotGraph and DotSubGraph now both contain a "DotStatements" value, which in turn contains global attributes, subgraphs, nodes and edges. * The various conversion functions in Data.GraphViz now come in two flavours: the unprimed versions take in a Bool indicating if the graph is directed or not; the primed versions attempt to automatically detect this. Also add cluster support for the graph -> dot -> graph conversion-style functions, as requested by Nikolas Mayr. * Allow custom arrow types as supported by GraphViz; as requested by Han Joosten. * Fixed a bug in HSV-style Color values where Int was used instead of Double; spotted by Michael deLorimier. * Properly resolved the situation initially spotted by Neil Brown: Matthew Sackman was following Dot terminology for an edge `a -> b' when using "head" for `b' and "tail" for `a' (this is presumably because the head/tail of the arrow are at those nodes). DotEdge now uses "from" and "to" avoid ambiguity; the various Attribute values still follow upstream usage. This should hopefully be the last update that is such an intrusive change. The next release will most likely contain updates on how to specify a particular output to use (including variants), with most of the rest remain as-is. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From ndmitchell at gmail.com Wed Sep 9 09:48:39 2009 From: ndmitchell at gmail.com (Neil Mitchell) Date: Wed Sep 9 09:27:39 2009 Subject: [Haskell] ANN: HLint 1.6.8 Message-ID: <404396ef0909090648p42ceef5cpa8268b01f074c03b@mail.gmail.com> Hi, I am pleased to announce HLint 1.6.8. HLint is a tool for suggesting improvements to your source code. It suggests the use of library functions you may have been unaware of, finds patterns of recursion that are really folds/maps, hints about extensions you aren't using and much more. HLint is now one of the top 20 applications on Hackage, and is used by the darcs project to improve and statically check their code base. HLint is ideal for learning Haskell, but is of use even to experienced developers. I now refuse to code review any Haskell that hasn't had HLint applied, as HLint automates the dull bits allowing people to do the more advanced higher-level reviews. Installation: cabal update && cabal install hlint Hackage: http://hackage.haskell.org/package/hlint Home page: http://community.haskell.org/~ndm/hlint/ Manual: http://community.haskell.org/~ndm/darcs/hlint/hlint.htm HLint 1.6.8 is a _strongly_ recommended upgrade. It fixes quite a few bugs, in particular it requires a newer version of cpphs which doesn't have a very severe bug that could lead to non-termination. == NEW FEATURES (since the last announcement) == * Changelog is now maintained: http://community.haskell.org/~ndm/darcs/hlint/CHANGES.txt * Lots of bugfixes (thanks to everyone who reported bugs) * Add suggestion to replace lambda with operator sections * Hints about redundant imports * Added -threaded flag to Cabal to disable threaded mode * Hints about unused extensions * Hints about functors * Integrates with cpphs to process CPP files * Integrate with HPC, and increase the test coverage (now ~ 70%). I would like to express my thanks to the HPC authors (Andy Gill and Colin Runciman) and encourage everyone to use it in their testing. I welcome any comments/bug reports for HLint, Thanks, Neil From marcel at bitrot.dyndns.org Wed Sep 9 12:17:10 2009 From: marcel at bitrot.dyndns.org (Marcel =?UTF-8?B?Rm91cm7DqQ==?=) Date: Wed Sep 9 11:56:13 2009 Subject: [Haskell] ANNOUNCE: hecc-0.1 Message-ID: <20090909181710.67ab4874@deck.Biotop> Hi, this is the first release of hecc, the Elliptic Curve Cryptography Library for Haskell, to be found at http://hackage.haskell.org/package/hecc Implemented are affine, projective, jacobian and modified jacobian point formats with the basic operations. Included as an Example is a basic ECDH as well as a basic speed test (just a point multiplication on NIST P-256). The code grew out of some finger exercises used during my Master-studies and has been molded into some (arguably) releasable state. The library tries to be fast (achieving the above-mentioned test in just under 10ms on my hardware) but won't compete with a C or assembler-implementation (meaning: it stays more readable). The API is not stable, there may be bugs, you have been warned... Further algorithms may come at a point, but there is no timeframe atm. Please send feedback! Marcel -- Marcel Fourn? OpenPGP-Key-ID: 0x74545C72 From kmatsu at ipl.t.u-tokyo.ac.jp Thu Sep 10 00:31:59 2009 From: kmatsu at ipl.t.u-tokyo.ac.jp (Kiminori Matsuzaki) Date: Thu Sep 10 00:10:52 2009 Subject: [Haskell] Call for Posters: APLAS 2009 Message-ID: <4AA8813F.2090201@ipl.t.u-tokyo.ac.jp> CALL FOR POSTER PRESENTATIONS The Seventh ASIAN Symposium on Programming Languages and Systems (APLAS 2009) December 14 - 16, 2009 Seoul National University, Seoul, Korea http://ropas.snu.ac.kr/aplas09/ FYI: The list of accepted papers is now on the webpage. APLAS 2009 will include a poster session during the conference. The session aims to give students and researchers an opportunity to present their research to the community, and to get responses from other researchers. SCOPE: Poster presentations describing research advances or experience with non-trivial systems are sought in all areas of programming languages and systems, including (but not limited to): - 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 FORMAT: A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. If you need more space, contact the poster chair (kmatsu AT ipl.t.u-tokyo.ac.jp). To prepare a good poster, search the Web for "poster presentation" and you will find many useful resources. SUBMISSION: Each presenter should e-mail a 1-2 page abstract in PDF or PostScript to the poster chair (Kiminori Matsuzaki; kmatsu AT ipl.t.u-tokyo.ac.jp) by September 30th 2009. The abstract should include the title, author(s), affiliation(s), and summary of the work, and a LaTeX-template will be available at "http://ropas.snu.ac.kr/aplas09/aplas_poster_template.tex". The program of the poster session will be announced by October 10th, 2009. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. IMPORTANT DATES: - 1-2 page abstract September 30, 2009 - Notification October 10, 2009 - Conference December 14 - 16, 2009 CONTACT: For questions or requests, please contact the APLAS 2009 poster chair, Kiminori Matsuzaki (kmatsu AT ipl.t.u-tokyo.ac.jp). -- Kiminori MATSUZAKI, Ph.D. Graduate School of Information Science and Technology, University of Tokyo Email: kmatsu@ipl.t.u-tokyo.ac.jp From v.dijk.bas at gmail.com Thu Sep 10 09:21:40 2009 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Thu Sep 10 09:00:43 2009 Subject: [Haskell] ANNOUNCE: A Levenberg-Marquardt implementation Message-ID: Dear all, We like to announce the release of a Haskell binding to Manolis Lourakis's C levmar library at: http://www.ics.forth.gr/~lourakis/levmar/ This library implements the Levenberg-Marquardt algorithm which is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions. It has become a standard technique for nonlinear least-squares problems and can be thought of as a combination of steepest descent and the Gauss-Newton method. When the current solution is far from the correct one, the algorithm behaves like a steepest descent method: slow, but guaranteed to converge. When the current solution is close to the correct solution, it becomes a Gauss-Newton method. Our binding consists of three packages: * http://hackage.haskell.org/package/bindings-levmar-0.1 A low-level wrapper around the C library. Note that the C library is lightly patched so that the functions can be safely called inside unsafePerformIO. The patched C library is bundled with this package. * http://hackage.haskell.org/package/levmar-0.1 A high-level wrapper around bindings-levmar. It provides a more familiar Haskell interface. For example, instead of passing a 'Ptr r' to the levmar function you can pass a [r]. levmar also provides some higher-level modules that use some type-level programming to add more type safety. * http://hackage.haskell.org/package/levmar-chart-0.1 Finally levmar-chart is a small package for quickly viewing the output of levmar in a chart. Unfortunately the documentation of these libraries is not available from hackage because bindings-levmar won't configure because of a missing dependency (lapack) on the hackage server. Instead I put the documentation at the following places: http://code.haskell.org/bindings-levmar/bindings-levmar-0.1/doc/html/bindings-levmar/index.html http://code.haskell.org/levmar/levmar-0.1/doc/html/levmar/index.html Here follows a quick example: Suppose we have the following model functions: constant :: Num r => Model N1 r r linear :: Num r => Model N2 r r quadratic :: Num r => Model N3 r r cubic :: Num r => Model N4 r r constant a _ = a linear b a x = b * x + constant a x quadratic c b a x = c * x*x + linear b a x cubic d c b a x = d * x*x*x + quadratic c b a x And the jacobians: constantJacob :: Num r => Jacobian N1 r r linearJacob :: Num r => Jacobian N2 r r quadraticJacob :: Num r => Jacobian N3 r r cubicJacob :: Num r => Jacobian N4 r r constantJacob _ _ = 1 ::: Nil linearJacob _ a x = x ::: constantJacob a x quadraticJacob _ b a x = x*x ::: linearJacob b a x cubicJacob _ c b a x = x*x*x ::: quadraticJacob c b a x Now assume we have some sample data. If you call levmar like this: levmar cubic (Just cubicJacob) (-0.05 ::: 0.5 ::: -12 ::: 10 ::: Nil) samples 1000 defaultOpts Nothing Nothing noLinearConstraints Nothing You get the following fit (using levmar-chart): http://code.haskell.org/~roelvandijk/code/levmar-chart/cubicFit.png Note that levmar contains a demo with a lot more examples: http://code.haskell.org/levmar/Demo.hs Happy fitting, Roel and Bas van Dijk From jfredett at gmail.com Sat Sep 12 13:11:59 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Sep 12 12:51:27 2009 Subject: [Haskell] Haskell Weekly News: Issue 130 - September 12, 2009 Message-ID: --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090912 Issue 130 - September 12, 2009 --------------------------------------------------------------------------- Welcome to issue 130 of HWN, a newsletter covering developments in the [1]Haskell community. Welcome to issue 130 of HWN! In the last week, HWN has gotten a new editor, me! I'm Joe Fredette (jfredett on IRC, reddit, and everywhere else), and I'll be taking over for Brent (byorgey) from now on. I think I speak for the whole community when I thank him for his excellent work on the HWN and associated tools. I have a few ideas about how I want to change HWN for the better, and hopefully you'll like them too! So, without further ado, The Haskell Weekly News! Announcements Looking for a new HWN editor. Brent Yorgey [2]went looking for a new editor for the HWN, and that's how you got me! See the editorial for more details. CfPart: FMICS 2009, 2-3 November 2009. Christophe Joubert [3]announced FMICS 2009 - FIRST CALL FOR PARTICIPATION, 14th International Workshop on Formal Methods for Industrial Critical Systems. November 2-3, 2009 Call for Posters: APLAS 2009. Kiminori Matsuzaki [4]announced a CALL FOR POSTER PRESENTATIONS The Seventh ASIAN Symposium on Programming Languages and Systems (APLAS 2009) December 14 - 16, 2009 Seoul National University, Seoul, Korea. hecc-0.1. Marcel Fourn?? [5]announced the first release of hecc, the Elliptic Curve Cryptography Library for Haskell. Implemented are affine, projective, jacobian and modified jacobian point formats with the basic operations. Included as an Example is a basic ECDH as well as a basic speed test. HLint 1.6.8. Neil Mitchell [6]announced HLint 1.6.8. HLint is a tool for suggesting improvements to your source code. It suggests the use of library functions you may have been unaware of, finds patterns of recursion that are really folds/maps, hints about extensions you aren't using and much more. HLint is now one of the top 20 applications on Hackage, and is used by the darcs project to improve and statically check their code base. A Levenberg-Marquardt implementation. Bas van Dijk [7]announced the release of a Haskell binding to Manolis Lourakis's C levmar library. This library implements the Levenberg-Marquardt algorithm which is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions. It has become a standard technique for nonlinear least-squares problems and can be thought of as a combination of steepest descent and the Gauss-Newton method. CCA-0.1. Paul L [8]announced that a library for Causal Commutative Arrows (CCA) has been uploaded to Hackage DB. It implements CCA normalization using Template Haskell and a modified arrow pre- processor (based on arrowp) to generate outout that Template Haskell can parse. It's highly experimental since we are still fiddling with several design choices, and by no means we imply Template Haskell is the best choice to implement CCA. Any suggestion or comment is welcome! graphviz-2999.5.0.0. Ivan Lazar Miljenovic [9]announced version 2999.5.0.0 of the graphviz package for Haskell. This is what I like to think of as the 'Hey, this is almost getting to be a decent library!' version. The graphviz package provides bindings to the GraphViz suite of programs by providing the ability to generate and parse GraphViz's Dot language as well as wrappers around the tools themselves. uvector-algorithms 0.2. Dan Doel [10]announced version 0.2 of the uvector-algorithms package. The package so far has implementations of several sorting and selection algorithms for use on the mutable arrays from the uvector library, as well as combinators for applying them to immutable arrays. dbmigrations 0.1. Jonathan Daugherty [11]announced dbmigrations, A library and program for the creation, management, and installation of schema updates (called migrations) for a relational database. In particular, this package lets the migration author express explicit dependencies between migrations and the management tool automatically installs or reverts migrations accordingly, using transactions for safety. This package is written to support any HDBC-supported database, although at present only PostgreSQL is fully supported. Palindromes 0.1. Johan Jeuring [12]announced Palindromes, a package for finding palindromes in files. Visit the [13]homepage The primary features of Palindromes include: A linear-time algorithm for finding exact palindromes, A linear-time algorithm for finding text palindromes, ignoring spaces, case of characters, and punctuation symbols. Discussion Averting QuickCheck Madness. Christopher Lane Hinson Christopher Hinson [14]asked about best practices with regards to QuickCheck, and it's inclusion/exclusion as a dependency for end-user programs. How to customize dyre recompile? Andy Stewart Andy Stewart [15]asked about how to customize Dyre's settings to do a whole-program recompilation. Externally derive instance of Data? Dimitry Golubovsky Dimitry Golubovsky [16]asked about stand-alone deriving for third-party datatypes. Parallel parsing & multicore. Anakim Border Anakim Border [17]talked about parallel parsing, specifically about a parser he had put together, which led to a discussion of Edward Kmett's recent talks at BAHUG. Ph.D position, Utrecht University, the Netherlands. S.Doaitse [18]announced Vacancy PhD student on Realizing Optimal Sharing in the Functional Language Implementations Utrecht University, The Netherlands. Blog noise [19]Haskell news from the [20]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Eric Kow (kowey): [21]Cabal-Installing graphical apps on MacOS X. * Don Stewart (dons): [22]Improving Data Structures with Associated Types. * Manuel M T Chakravarty: [23]Haskell Arrays, Accelerated.. * Galois, Inc: [24]Tech Talk: Building Systems That Enforce Measurable Security Goals. * Kevin Reid (kpreid): [25]GSoC conclusion.. * Neil Brown: [26]Boids Simulation: Part 1. * Paul Potts: [27]MacPorts, Snow Leopard, and GHC == Sadness. * Andrew Calleja: [28]Haskell IDEs on Windows. * Sean Leather: [29]"Upwards and downwards accumulations on trees" translated into Haskell. * Xmonad: [30]The Design and Implementation of XMonad. * Galois, Inc: [31]Tech Talk: Constructing a Universal Domain for Reasoning About Haskell Datatypes. * Well-Typed.Com: [32]Slides from the IHG talk at CUFP. * Alex McLean: [33]Hackpact Documentation. This links to part one of a two part series. * Bas van Gijze: [34]Cannibals, Missionaries and the State Monad pt. 1. * Magnus Therning: [35]Wrapping IO. This links to part one of a two part series. * Don Stewart (dons): [36]Stream Fusion for Haskell Arrays. * Tom Schrijvers: [37]EffectiveAdvice: AOP, mixin inheritance, monads, parametricity, non-interference, .... * Johan Jeuring: [38]Finding palindromes. * Neil Brown: [39]Concurrent vs Parallel vs Sequential. * Don Stewart (dons): [40]DEFUN 2009: Multicore Programming in Haskell Now!. * Don Stewart (dons): [41]The Haskell Platform: Status Report: Haskell Symposium 2009. Quotes of the Week * lispy: All haskell lists have less than 400 elements * Jafet: The C preprocessor is purely dysfunctional * edwardk: so the -> is matched on the outside, but the -> and , fail to match on the inside, unification fails, dogs and cats start living together in harmony, general chaos. * yaxu: [about lambdabot] an irc bot that no-one understands the workings of has to be a fine precursor to artificial intelligence * Gracenotes: all in all, you're just another brick in the -Wall 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://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63133 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17476 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17483 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17482 6. http://article.gmane.org/gmane.comp.lang.haskell.general/17481 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63283 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63233 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63219 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63205 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63187 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63157 13. http://www.jeuring.net/Palindromes/ 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63146 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63143 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63314 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63223 18. http://article.gmane.org/gmane.comp.lang.haskell.general/17478 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://koweycode.blogspot.com/2009/09/cabal-installing-graphical-apps-on.html 22. http://donsbot.wordpress.com/2009/09/11/improving-data-structures-with-associated-types/ 23. http://justtesting.org/post/185173082 24. http://www.galois.com/blog/2009/09/10/jaegermeasurablesecurit/ 25. http://kpreid.livejournal.com/16930.html 26. http://chplib.wordpress.com/2009/09/08/boids-simulation-part-1/ 27. http://praisecurseandrecurse.blogspot.com/2009/09/macports-snow-leopard-and-ghc-sadness.html 28. http://lambdacolyte.wordpress.com/2009/09/08/haskell-ides-on-windows/ 29. http://feedproxy.google.com/~r/splonderzoek/~3/4E8TZPDZ-aM/ upwards-and-downwards-accumulations-on.html 30. http://xmonad.wordpress.com/2009/09/09/the-design-and-implementation-of-xmonad/ 31. http://www.galois.com/blog/2009/09/08/huffman_universaldomain/ 32. http://blog.well-typed.com/2009/09/slides-from-the-ihg-talk-at-cufp/ 33. http://yaxu.org/hackpact-documentation/ 34. http://adoseoflogic.blogspot.com/2009/07/cannibals-missionaries-and-state-monad.html 35. http://therning.org/magnus/archives/738 36. http://donsbot.wordpress.com/2009/09/07/stream-fusion-for-haskell-arrays/ 37. http://tomschrijvers.blogspot.com/2009/09/effectiveadvice-aop-mixin-inheritance.html 38. http://johanjeuring.blogspot.com/2007/08/finding-palindromes.html 39. http://chplib.wordpress.com/2009/09/06/concurrent-vs-parallel-vs-sequential/ 40. http://donsbot.wordpress.com/2009/09/05/defun-2009-multicore-programming-in-haskell-now/ 41. http://donsbot.wordpress.com/2009/09/05/the-haskell-platform-status-report-haskell-symposium-2009/ 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://code.haskell.org/~byorgey/code/hwn/ From Sven.Panne at aedion.de Sun Sep 13 09:55:15 2009 From: Sven.Panne at aedion.de (Sven Panne) Date: Sun Sep 13 09:34:05 2009 Subject: [Haskell] ANNOUNCE: GLUT 2.2.2.0 Message-ID: <200909131555.16038.Sven.Panne@aedion.de> A new version of the GLUT package has been uploaded to Hackage. * Fixed linking issues on Mac OS X, the package should work out of the box without any warnings or additional flags now. * Handle additional mouse buttons via 'AdditionalButton Int' in the MouseButton type. * Made a few minor typing adjustments, which don't really matter for the type synonyms used for the basic OpenGL types so far, but which do matter for the upcoming datatype renamings for them. * Aesthetic improvements in the brick shader example. Cheers, S. From Sven.Panne at aedion.de Sun Sep 13 10:21:49 2009 From: Sven.Panne at aedion.de (Sven Panne) Date: Sun Sep 13 10:00:41 2009 Subject: [Haskell] ANNOUNCE: GLURaw 1.1.0.0 Message-ID: <200909131621.49991.Sven.Panne@aedion.de> A new version of the GLURaw package has been uploaded to Hackage. ? ?* Fixed linking issues on Mac OS X, the package should work out of the box without any warnings or additional flags now. * Fixed the type of gluUnProject4, the near and far parameters are of type GLclampd, not GLdouble. This matches the GLU spec. Cheers, ? ?S. From Sven.Panne at aedion.de Sun Sep 13 10:34:52 2009 From: Sven.Panne at aedion.de (Sven Panne) Date: Sun Sep 13 10:13:42 2009 Subject: [Haskell] ANNOUNCE: OpenGLRaw 1.1.0.0 Message-ID: <200909131634.52381.Sven.Panne@aedion.de> A new version of the OpenGLRaw package has been uploaded to Hackage. * Use opaque newtypes for the basic OpenGL types, adding the common instances for them, too. Note that this might break programs which depend on the concrete representations. Use explicit conversions where necessary, making all assumptions explicit. ? ?* Fixed linking issues on Mac OS X, the package should work out of the box without any warnings or additional flags now. * Fall back to GetProcAddress on Windows when WGL doesn't find an API entry. This should fix problems using core functions with some driver/OS combinations. * Added support for OpenGL 3.2 and the latest NV extensions. * All extensions export all their functions/tokens/types, even if they are in the core. This will keep the extension module exports more stable. * Fixed the types of the glPixelMap functions, using GLsizei instead of GLint for the size, following the OpenGL specification. Cheers, S. From Sven.Panne at aedion.de Sun Sep 13 10:40:08 2009 From: Sven.Panne at aedion.de (Sven Panne) Date: Sun Sep 13 10:18:56 2009 Subject: [Haskell] ANNOUNCE: OpenGL 2.4.0.0 Message-ID: <200909131640.08344.Sven.Panne@aedion.de> A new version of the OpenGL package has bee uploaded to Hackage. * Added contextProfile query. * Made a few tiny internal typing changes to make things work with the latest OpenGLRaw package. Cheers, S. From Sven.Panne at aedion.de Sun Sep 13 10:57:16 2009 From: Sven.Panne at aedion.de (Sven Panne) Date: Sun Sep 13 10:36:06 2009 Subject: [Haskell] ANNOUNCE: OpenGL 2.4.0.1 Message-ID: <200909131657.16167.Sven.Panne@aedion.de> A new version of the OpenGL package has been uploaded to Hackage. * Fixed maxTextureUnit query. This change didn't make it in the last release... :-( Cheers, ? ?S. From ndmitchell at gmail.com Mon Sep 14 10:46:43 2009 From: ndmitchell at gmail.com (Neil Mitchell) Date: Mon Sep 14 10:25:28 2009 Subject: [Haskell] ANN: CmdArgs - easy command line argument processing Message-ID: <404396ef0909140746g6deb29aeic90ed2a1e14fee30@mail.gmail.com> Hi, I am pleased to announce CmdArgs v0.1. CmdArgs is a library for easy command line argument processing - taking the arguments passed into your program from getArgs and converting them into a structured value for use in your program. Compared to the System.Console.GetOpts library there are two key advantages: 1) The command line argument processors are shorter - in a typical case they are about 1/3 the size, 90 lines with getopts vs 30 simpler lines with CmdArgs (for HLint). 2) CmdArgs can support multiple mode command lines, such as those found in hpc, darcs and cabal. The guiding principle of CmdArgs is to try and write each piece of information only once, which makes the command line processing shorter, and eliminates many of the accidental copy-and-paste style bugs that are easy with getopts. CmdArgs requires GHC, but other than this restriction, I do not foresee any reason for anyone to use getopts over CmdArgs. To install use the standard cabal magic: cabal update && cabal install cmdargs Useful links Home page: http://community.haskell.org/~ndm/cmdargs/ Manual: http://community.haskell.org/~ndm/darcs/cmdargs/cmdargs.htm Haddock: http://hackage.haskell.org/packages/archive/cmdargs/latest/doc/html/System-Console-CmdArgs.html If you want to start using CmdArgs I recommend reading through the manual, and referring to the haddock documentation as necessary. I welcome any comments and bug reports. Thanks, Neil From malcolm.wallace at cs.york.ac.uk Mon Sep 14 12:40:50 2009 From: malcolm.wallace at cs.york.ac.uk (Malcolm Wallace) Date: Mon Sep 14 12:19:34 2009 Subject: [Haskell] Videos of HIW 2009 Message-ID: <421B5E0B-2F4C-4884-9186-D8D99DD352BC@cs.york.ac.uk> Videos of all the presentations/discussions at the recent Haskell Implementers Workshop 2009, in Edinburgh, are now online. http://www.vimeo.com/album/126462 The programme of talks (which does not mention some of the on-the-day 5minute slots) is here: http://haskell.org/haskellwiki/HaskellImplementorsWorkshop Regards, Malcolm From donnie at darthik.com Mon Sep 14 12:57:32 2009 From: donnie at darthik.com (Donnie Jones) Date: Mon Sep 14 12:36:17 2009 Subject: [Haskell] Videos of HIW 2009 In-Reply-To: <421B5E0B-2F4C-4884-9186-D8D99DD352BC@cs.york.ac.uk> References: <421B5E0B-2F4C-4884-9186-D8D99DD352BC@cs.york.ac.uk> Message-ID: Thank you! -- Donnie Jones On Mon, Sep 14, 2009 at 11:40 AM, Malcolm Wallace wrote: > Videos of all the presentations/discussions at the recent Haskell > Implementers Workshop 2009, in Edinburgh, are now online. > > ? ?http://www.vimeo.com/album/126462 > > The programme of talks (which does not mention some of the on-the-day > 5minute slots) is here: > > ? ?http://haskell.org/haskellwiki/HaskellImplementorsWorkshop > > Regards, > ? ?Malcolm > > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell > From voigt at tcs.inf.tu-dresden.de Tue Sep 15 01:52:20 2009 From: voigt at tcs.inf.tu-dresden.de (Janis Voigtlaender) Date: Tue Sep 15 01:31:03 2009 Subject: [Haskell] PEPM'10 - Last CFP (Submission: 6 Oct 09, Notification: 29 Oct 09) Message-ID: <4AAF2B94.1020707@tcs.inf.tu-dresden.de> =============================================================== CALL FOR PAPERS ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM'10) Madrid, January 18-19, 2010 (Affiliated with POPL'10) http://www.program-transformation.org/PEPM10 =============================================================== INVITED SPEAKERS: * Lennart Augustsson (Standard Chartered Bank, UK) * Jeremy Siek (University of Colorado at Boulder, USA) IMPORTANT DATES: * Paper submission: Tue, October 6, 2009, 23:59, Apia time * Author notification: Thu, October 29, 2009 * Camera-ready papers: Mon, November 9, 2009 To facilitate smooth organization of the review process, authors are asked to submit a short abstract by October 1, 2009. SUBMISSION CATEGORIES: * Regular research papers (max. 10 pages in ACM Proceedings style) * Tool demonstration papers (max. 4 pages plus max. 6 pages appendix) TRAVEL SUPPORT: Students and other attendants in need can apply for a SIGPLAN PAC grant to help cover expenses. For details, see http://www.sigplan.org/PAC.htm. SCOPE: The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theories, tools, and applications of analysis and manipulation of programs. The 2010 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation in a continued effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, it covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, there is a separate category of tool demonstration papers. Topics of interest for PEPM'10 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, program inversion, program composition, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, type systems, automated testing and test case generation. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, deep embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and web-based programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. PROCEEDINGS: There will be formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'10. SUBMISSION GUIDELINES: Papers should be submitted electronically via the workshop web site. Regular research papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style, and authors will be expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Authors using Latex to prepare their submissions should use the new improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template). PROGRAM CO-CHAIRS: * John Gallagher (Roskilde University, Denmark, and IMDEA Software, Spain) * Janis Voigtl?nder (Technische Universit?t Dresden, Germany) PROGRAM COMMITTEE MEMBERS: * Wei-Ngan Chin (National University of Singapore, Singapore) * Michael Codish (Ben-Gurion University of the Negev, Israel) * Jim Cordy (Queen's University, Canada) * Nate Foster (University of Pennsylvania, USA) * Haifeng Guo (University of Nebraska at Omaha, USA) * Patricia Johann (University of Strathclyde, UK) * Oleg Kiselyov (FNMOC, USA) * G?nter Kniesel (University of Bonn, Germany) * Viktor Kuncak (Ecole Polytechnique F?d?rale de Lausanne, Switzerland) * Yanhong Annie Liu (State University of New York at Stony Brook, USA) * Andres L?h (Utrecht University, Netherlands) * Jan Midtgaard (Roskilde University, Denmark) * David Monniaux (National Center for Scientific Research (CNRS) and VERIMAG laboratory, France) * Akimasa Morihata (University of Tokyo, Japan) * Alberto Pettorossi (Universit? di Roma Tor Vergata, Italy) * Jo?o Saraiva (Universidade do Minho, Portugal) * Ganesh Sittampalam (Credit Suisse, UK) * Fausto Spoto (Universit? di Verona, Italy) * Harald S?ndergaard (University of Melbourne, Australia) * Walid Taha (Rice University, USA) From judah.jacobson at gmail.com Tue Sep 15 11:55:37 2009 From: judah.jacobson at gmail.com (Judah Jacobson) Date: Tue Sep 15 11:34:38 2009 Subject: [Haskell] ANNOUNCE: Haskeline 0.6.2 Message-ID: <6d74b0d20909150855w2ecbb3c3je7036dc8722893a4@mail.gmail.com> I am pleased to announce the release of Haskeline 0.6.2: http://hackage.haskell.org/package/haskeline (Make sure to run cabal update first to get its updated dependencies.) Haskeline provides a user interface for line input in command-line programs. The library is similar in purpose to readline or editline, but since it is written in Haskell it is (hopefully) more easily used in other Haskell programs. With this release, thanks to much appreciated feedback and suggestions from the community, Haskeline's features become more competitive with its C alternatives. Improvements include: * A multitude of new emacs and vi bindings: http://trac.haskell.org/haskeline/wiki/KeyBindings * A new preference 'historyDuplicates' to remove repeated history entries * Recognize PageUp and PageDown keys * Compatibility with ghc-6.12 * Correct width calculations for Unicode combining characters Documentation, development and mailing list information can be found at: http://trac.haskell.org/haskeline Best, -Judah From kyagrd at gmail.com Tue Sep 15 16:00:10 2009 From: kyagrd at gmail.com (Ahn, Ki Yung) Date: Tue Sep 15 15:39:23 2009 Subject: [Haskell] Re: ANNOUNCE: Haskeline 0.6.2 In-Reply-To: <6d74b0d20909150855w2ecbb3c3je7036dc8722893a4@mail.gmail.com> References: <6d74b0d20909150855w2ecbb3c3je7036dc8722893a4@mail.gmail.com> Message-ID: Judah Jacobson wrote: > > With this release, thanks to much appreciated feedback and suggestions from the > community, Haskeline's features become more competitive with its C > alternatives. Improvements include: > > * A multitude of new emacs and vi bindings: > http://trac.haskell.org/haskeline/wiki/KeyBindings > * A new preference 'historyDuplicates' to remove repeated history entries > * Recognize PageUp and PageDown keys > * Compatibility with ghc-6.12 > * Correct width calculations for Unicode combining characters Oh, this Unicode width calculation sounds great! This was the only reason I needed readline and stay away from haskline. If this works properly, I no more nead to depend on readline for line input. I think this is a very good news for any mutibyte charset users. I'll try to replace readline in my memscript utility to haskline and come back to report the results. Thanks for your work on this! Ahn, Ki Yung From kyagrd at gmail.com Tue Sep 15 16:21:29 2009 From: kyagrd at gmail.com (Ahn, Ki Yung) Date: Tue Sep 15 16:00:36 2009 Subject: [Haskell] Re: ANNOUNCE: Haskeline 0.6.2 - unicode width calculation not working In-Reply-To: References: <6d74b0d20909150855w2ecbb3c3je7036dc8722893a4@mail.gmail.com> Message-ID: <4AAFF749.6080006@gmail.com> Ahn, Ki Yung wrote: > Judah Jacobson wrote: >> >> With this release, thanks to much appreciated feedback and suggestions >> from the >> community, Haskeline's features become more competitive with its C >> alternatives. Improvements include: >> >> * A multitude of new emacs and vi bindings: >> http://trac.haskell.org/haskeline/wiki/KeyBindings >> * A new preference 'historyDuplicates' to remove repeated history >> entries >> * Recognize PageUp and PageDown keys >> * Compatibility with ghc-6.12 >> * Correct width calculations for Unicode combining characters > > Oh, this Unicode width calculation sounds great! This was the only > reason I needed readline and stay away from haskline. If this works > properly, I no more nead to depend on readline for line input. I think > this is a very good news for any mutibyte charset users. I'll try to > replace readline in my memscript utility to haskline and come back to > report the results. Thanks for your work on this! Sorry for the bad news, but haskeline does not caculate correct width for Korean, and I don't believe it will for Chinese or Japanese either. My linux LANG setting LANG=ko_KR.UTF-8, and I tested with the following example program in the Hackage Haddock documentation: > import System.Console.Haskeline > > main :: IO () > main = runInputT defaultSettings loop > where > loop :: InputT IO () > loop = do > minput <- getInputLine "% " > case minput of > Nothing -> return () > Just "quit" -> return () > Just input -> do outputStrLn $ "Input was: " ++ input > loop When I typed in Korean characters and tried to erase them with backspace or del, it only deletes half of the characters on the screen although it seems that in the buffer the composed multibyte character was deleted. That is, when I type three Korean characters of my name, which is of 6 ASCII alphabet character width, and press backspace key three times, the buffer is empty, but on my screen there is one and a half character remaining. This same problem existed in the previous versions as well, and this is why multibyte charset users cannot adopt haskeline for their project, and have less satisfying experience using ghci to testing text input output actions. In summary, I think haskeline is calculating the correct width but only applies that to the buffer content but not what is printed on the screen. This gives the user very awkward experience when they try to move the cursor back to fix the line input. > Ahn, Ki Yung From vandijk.roel at gmail.com Wed Sep 16 05:25:44 2009 From: vandijk.roel at gmail.com (Roel van Dijk) Date: Wed Sep 16 05:04:29 2009 Subject: [Haskell] ANNOUNCE: bindings-levmar-0.1.1 Message-ID: I am pleased to announce the release of bindings-levmar-0.1.1: http://hackage.haskell.org/package/bindings-levmar The most important change compared to the previous version is a custom configure script (copied from hmatrix) that detects which libraries are needed. The cabal file also has some flags which allow you to choose for instance intel's mkl library instead of the normal lapack (also copied from hmatrix). Happy hacking, Roel and Bas van Dijk From v.dijk.bas at gmail.com Wed Sep 16 05:35:25 2009 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Wed Sep 16 05:14:08 2009 Subject: [Haskell] ANNOUNCE: levmar-0.2 Message-ID: Hello, We like to announce a new release of the high-level Levenberg-Marquardt library levmar: http://hackage.haskell.org/package/levmar-0.2 Changes: * There's one new major feature: automatic calculation of the Jacobian using automatic differentiation with Conal Elliott's vector-space library. (Conal: would you like to take a quick look at the implementation and see if I'm using vector-space the way it supposed to be used, thanks) * Furthermore we made the type Model from LevMar more type-safe by replacing: type Model m r = NFunction m r [r] with: type Model m n r = NFunction m r (SizedList n r) * Finally we did lot's of internal refactorings and updated the documentation. regards, Bas and Roel van Dijk From demis at dimi.uniud.it Wed Sep 16 11:13:18 2009 From: demis at dimi.uniud.it (demis@dimi.uniud.it) Date: Wed Sep 16 10:52:05 2009 Subject: [Haskell] CFP: JSC Special Issue on Automated Verification and Specification of Web Systems Message-ID: <20090916151319.653113FC114@sole.dimi.uniud.it> Skipped content of type multipart/alternative From ivan.miljenovic at gmail.com Thu Sep 17 06:30:37 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Thu Sep 17 06:09:22 2009 Subject: [Haskell] ANNOUNCE: graphviz-2999.5.1.0 Message-ID: <87eiq5ooc2.fsf@gmail.com> I'm pleased to announce version 2999.5.1.0 [1] of the graphviz library, which provides bindings to the GraphViz [2] suite of tools for drawing graphs. [1] http://hackage.haskell.org/package/graphviz-2999.5.1.0 [2] http://www.graphviz.org/ This is mainly a bug-fix release; as such, there is no API change (though if you use the graphvizWithHandle function in Data.GraphViz.Commands, you should ensure that your Handle -> IO a function closes the Handle when done). Changes in this release are: * Potentially fixed the graphvizWithHandle bug where warnings would be emitted about Handles not being closed correctly or too early; correct approach spotted by Nikolas Mayr. * Fixed up Parsing of various Attribute sub-values, especially Point and Spline (and hence Pos, which uses them). * Pre-process out comments and join together multi-line strings before parsing. * Properly parse Doubles like ".2". -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From Jean-Christophe.Filliatre at lri.fr Fri Sep 18 16:19:34 2009 From: Jean-Christophe.Filliatre at lri.fr (=?ISO-8859-1?Q?Jean-Christophe_Filli=E2tre?=) Date: Fri Sep 18 15:58:06 2009 Subject: [Haskell] Call for Papers: PLPV 2010 Message-ID: <4AB3EB56.6010105@lri.fr> Call For Papers Programming Languages meets Program Verification (PLPV) 2010 http://slang.soe.ucsc.edu/plpv10/ Tuesday, January 19, 2010 Madrid, Spain Affiliated with POPL 2010 Overview: The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic and/or structural properties of the programming language. One example is dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications, possibly with programmer-provided proof terms. Another example is extended static checking systems like Spec#, which extends C# with pre- and postconditions along with a static verifier for these contracts. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage cross-pollination between different communities, we seek a broad the scope for PLPV. In particular, submissions may have diverse foundations for verification (type-based, Hoare-logic-based, etc), target diverse kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, etc). Submissions: Submissions should fall into one of the following three categories: 1. Regular research papers that describe new work on the above or related topics. Submissions in this category have an upper limit of 12 pages, but shorter submissions are also encouraged. 2. Work-in-progress reports should describe new work that is ongoing and may not be fully completed or evaluated. Submissions in this category should be at most 6 pages in total length. 3. Proposals for challenge problems which the author believes is are useful benchmarks or important domains for language-based program verification techniques. Submissions in this category should be at most 6 pages in total length. Submissions should be prepared with SIGPLAN two-column conference format. Submitted papers must adhere to the SIGPLAN republication policy. Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. Papers should be submitted through Easychair, at http://www.easychair.org/conferences/?conf=plpv2010 Publication: Accepted papers will be published by the ACM and appear in the ACM digital library. Student Attendees: Students with accepted papers or posters are encouraged to apply for a SIGPLAN PAC grant that will help to cover travel expenses to PLPV. Details on the PAC program and the application can be found on the workshop web page. PAC also offers support for companion travel. Important Dates: * Electronic submission: October 8, 2009, 11:59pm Samoa time (UTC-11) * Notification: November 8, 2009 * Final version: November 17, 2009 * Workshop: January 19, 2010 Organizers: * Cormac Flanagan (University of California, Santa Cruz) * Jean-Christophe Filli?tre (CNRS) Program Committee: * Adam Chlipala (Harvard University) * Ranjit Jhala (University of California, San Diego) * Joseph Kiniry (University College Dublin) * Rustan Leino (Microsoft Research) * Xavier Leroy (INRIA Paris-Rocquencourt) * Conor McBride (University of Strathclyde) * Andrey Rybalchenko (Max Planck Institute for Software Systems) * Tim Sheard (Portland State University) * Stephanie Weirich (University of Pennsylvania) From jfredett at gmail.com Sat Sep 19 13:22:05 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Sep 19 13:02:42 2009 Subject: [Haskell] Haskell Weekly News: Issue 131 - September 19, 2009 Message-ID: Hopefully the line endings come out okay this week, I did a test before sending it to the list, please let me know if you notice anything awry. Just put a [HWN] in the subject line so my filter's will catch it. --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090918 Issue 131 - September 18, 2009 --------------------------------------------------------------------------- Welcome to issue 131 of HWN, a newsletter covering developments in the [1]Haskell community. Last week, I received an email from Mark Wotton about his project [2]Hubris. I totally forgot to put it in the HWN last week, too busy trying to figure out all the tools. So, I thought I'd make it up and give him some special editorial status this week. Hubris is a bridge between Ruby and Haskell, allowing you to call Haskell from Ruby. It's very cool, I highly suggest playing with it. Also, I've been posting a bit about the new HWN tools (dubbed "HWN2") on my [3]blog, there is also a repo up at [4]patch-tag which will have all the code. If there is some interest in helping me, I'll try to come up with a TODO list/Trac. Announcements hssqlppp, sql parser and type checker, pre-alpha. Jake Wheat [5]announced his parser/type checker for SQL. It currently parses a subset of PostGreSQL and PL/pgSQL, and can type check some statements. LambdaINet-0.1.0, Graphical Interaction Net Evaluator for Optimal Evaluation. Paul L [6]announced a LambdaINet 0.1.0, available on [7]Hackage. LambdaINet implements an interaction net based optimal evaluator. With an interactive graphical interface allowing the user to view and directly manipulate the interaction net. arbtt-0.1. Joachim Breitner [8]announced the Automatic Rule-Based Time Tracking tool on hackage. he has an introduction available [9]here. A statistics library. Bryan O'Sullivan [10]announced the imaginatively named [11]statistics library. Which supports common discrete and continuous probability distributions, Kernel density estimation, Auto-correlation analysis, Functions over sample data, Quantile estimation, and Re-sampling techniques. CFP: JSC Special Issue on Automated Verification and Specification of Web Systems. [12]A Special Issue of the Journal of symbolic computation was announced. This issue is related to the topics of the Automated Specification and Verification of Web Systems Workshop (WWV'09). Read the announcement for more details. Haskeline 0.6.2. Judah Jacobson [13]announced the release of Haskeline 0.6.2, available [14]here. Improvements over the last version include, new emacs and vi bindings, a new preference to remove repeated history entries, recognition of page-up and page-down keys, and more. PEPM'10 - Last CFP (Submission: 6 Oct 09, Notification: 29 Oct 09). Janis Voigtlaender [15]announced the Last Call for Papers for PEPM'10, see the announcement for more details. Videos of HIW 2009. Malcolm Wallace [16]announced videos of all the presentations/discussions at the recent Haskell Implementers Workshop 2009, in Edinburgh, are now [17]online. The program of talks is available [18]here. Unification in a Commutative Monoid (cmu 1.1) and a new release of Abelian group unification and matching (agum 2.2). John D. Ramsdell [19]announced cmu 1.1, which provides unification in a commutative monoid, also know as ACU-unification. The core computation finds the minimal non-zero solutions to homogeneous linear Diophantine equations. The linear equation solver has been place in a separate module so it can be used for other applications. He also announced agum 2.2, which provides unification and matching in an Abelian group, also know as AG-unification and matching. graphviz-2999.5.1.0. Ivan Lazar Miljenovic [20]announced a bug-fix release of the GraphViz package, no major API changes occurred. levmar-0.2, bindings-levmar-0.1.1. Bas van Dijk and Roel van Dijk announced [21]new [22]versions of the levmar and bindings-levmar packages. New features include automatic calculation of the Jacobian via Conal Elliot's automatic differentiation from his vector-space library. CmdArgs - easy command line argument processing. Neil Mitchell [23]announced CmdArgs 0.1. CmdArgs is a library for parsing command-line arguments. It offers several improvements over GetOpts, namely that the Command Line Argument Processors are shorter and CmdArgs can support multiple-mode command lines such as those found in darcs, cabal, hpc, etc. OpenGL 2.4.0.1. Sven Panne [24]announced a new version of the OpenGL package, this version fixes a bug that didn't make it into the previous release. OpenGLRaw 1.1.0.0. Sven Panne [25]announced a new version of the OpenGLRaw package has been uploaded to Hackage. Discussion Thank you guys. Cristiano Paris took some time to thank us all from -Cafe for helping him learn Haskell. You're welcome, Cristiano! Unicode lexing in GHC and GHCi. Sean McLaughlin [26]asked about why certain unicode characters parsed in GHCi without error, but not in compiled code. Help with FFI. Jose Prous [27]asked for some help with the foreign function interface. Ambiguous type variable with subclass instance. Andy Gimblett [28]asked about a particular ambiguous type error Haskell -> .NET. Peter Verswyvelen [29]asked about the possibilities for a .NET version of Haskell. A thought about liberating Haskell's syntax. George Pollard [30]suggested a new way to do templates, so that brace-like syntax could be added without having to seriously hack GHC. Blog noise [31]Haskell news from the [32]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Brown: [33]Concurrent Pearl: The Sort Pump. * Roman Cheplyaka: [34]CCC #6: HWN. A comic revealing the _real_ reason Brent left the HWN to me. * Don Stewart (dons): [35]Data.Binary: performance improvements for Haskell binary parsing. * Thomas M. DuBuisson: [36]Kernel Modules in Haskell. * Neil Brown: [37]Boids Simulation: Part 4. * Edward Kmett: [38]Iteratees, Parsec, and Monoids, Oh My!. * Edward Kmett: [39]Remodeling Precision. * Alex McLean: [40]Hackpact documentation (week 3). The continuation of Alex's series on Hackpact * Luke Palmer: [41]IO-free splittable supply. * Thomas M. DuBuisson: [42]Kernel Modules in Haskell. * Bryan O'Sullivan: [43]A video demo of my Haskell benchmarking framework. * Don Stewart (dons): [44]Haskell for Everyone: Hackage and the Haskell Platform : Haskell Implementers Workshop 2009. * David Sankel: [45]Applied Functional Programming: Part 1. * Neil Brown: [46]Boids Simulation: Part 4. * Darcs: [47]darcs weekly news #40. * Chris Smith: [48]On Inverses of Haskell Functions. * David Amos: [49]Finite geometries, part 1: AG(n,Fq). A multipart series from David, part of his Haskell For Maths project. Quotes of the Week * quicksilver: no, you mispelt >> as ; * dons: Cale's my alter-ego. I talk about applications and benchmarking, he talks about theory and math. We've been doing this for years :) * gwern: #haskell: because none of us are as offtopic as all of us * some-crazy-hwn-editor: A monster! HAH! It will not be a monster, but a god! ALL SHALL BOW BEFORE MY SPAWN AND DESPAIR! ALL HAIL THE PROGRAMMER CHILD! ALL HAIL THE HYPNOTOAD! * AlanJPerlis: Purely applicative languages are poorly applicable. About the Haskell Weekly News New editions are posted to [50]the Haskell mailing list as well as to [51]the Haskell Sequence and [52]Planet Haskell. [53]RSS is also available, and headlines appear on [54]haskell.org. To help create new editions of this newsletter, please see the information on [55]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [56]http://patch-tag.com/r/HWN2/home . References 1. http://haskell.org/ 2. http://github.com/mwotton/Hubris 3. http://lowlymath.net/?p=45 4. http://patch-tag.com/r/HWN2/snapshot/current/content/pretty 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63413 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63390 7. http://hackage.haskell.org/package/LambdaINet 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63369 9. https://www.joachim-breitner.de/blog/archives/336-The-Automatic-Rule-Based-Time-Tracker.html 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63362 11. http://hackage.haskell.org/package/statistics 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17502 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17497 14. http://hackage.haskell.org/package/haskeline 15. http://article.gmane.org/gmane.comp.lang.haskell.general/17496 16. http://article.gmane.org/gmane.comp.lang.haskell.general/17494 17. http://www.vimeo.com/album/126462 18. http://haskell.org/haskellwiki/HaskellImplementorsWorkshop 19. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63572 20. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63542 21. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63499 22. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63498 23. http://article.gmane.org/gmane.comp.lang.haskell.general/17493 24. http://article.gmane.org/gmane.comp.lang.haskell.general/17492 25. http://article.gmane.org/gmane.comp.lang.haskell.general/17490 26. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63580 27. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63574 28. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63545 29. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63512 30. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63492 31. http://planet.haskell.org/ 32. http://haskell.org/haskellwiki/Blog_articles 33. http://chplib.wordpress.com/2009/09/18/the-sort-pump/ 34. http://ro-che.blogspot.com/2009/09/ccc-6-hwn.html 35. http://donsbot.wordpress.com/2009/09/16/data-binary-performance-improvments-for-haskell-binary-parsing/ 36. http://tommd.wordpress.com/2009/09/13/kernel-modules-in-haskell/ 37. http://chplib.wordpress.com/2009/09/16/boids-simulation-part-4/ 38. http://comonad.com/reader/2009/iteratees-take-2/ 39. http://comonad.com/reader/2009/remodeling-precision/ 40. http://yaxu.org/hackpact-documentation-week-3/ 41. http://lukepalmer.wordpress.com/2009/09/14/io-free-splittable-supply/ 42. http://tommd.wordpress.com/2009/09/13/kernel-modules-in-haskell/ 43. http://www.serpentine.com/blog/2009/09/14/a-video-demo-of-my-haskell-benchmarking-framework/ 44. http://donsbot.wordpress.com/2009/09/14/haskell-for-everyone-hackage-and-the-haskell-platform-haskell-implementors-workshop-2009/ 45. http://netsuperbrain.com/blog/posts/applied-functional-programming-part-1/ 46. http://chplib.wordpress.com/2009/09/14/boids-simulation-part-4/ 47. http://blog.darcs.net/2009/09/darcs-weekly-news-40.html 48. http://cdsmith.wordpress.com/2009/09/14/on-inverses-of-haskell-functions/ 49. http://haskellformaths.blogspot.com/2009/09/finite-geometries-part-1-agnfq.html 50. http://www.haskell.org/mailman/listinfo/haskell 51. http://sequence.complete.org/ 52. http://planet.haskell.org/ 53. http://sequence.complete.org/node/feed 54. http://haskell.org/ 55. http://haskell.org/haskellwiki/HWN 56. http://patch-tag.com/r/HWN2/home From jno at di.uminho.pt Sun Sep 20 03:42:58 2009 From: jno at di.uminho.pt (J.N. Oliveira) Date: Sun Sep 20 03:21:10 2009 Subject: [Haskell] TFM09: Call for Participation (FMWeek, Eindhoven, November 2009) In-Reply-To: <4DAEC066-B5BA-45A8-987A-F02AC5B99C19@di.uminho.pt> References: <6AC8F250-5C3 7-4593-BCBD-144AB137C75D@di.uminho.pt><1FB8BC34-C683-4850-8FA6-DA12D9743D5E @di.uminho.pt><8093D19D- B78D-4D7C-A2FF-FAE182EC67AE@di.uminho.pt><61E3A078-D722-47E9-AC4F-A2610969CE13@di.uminho.pt><485E9D1C-AF99-4B8E-B8DA-F45997 FD26F0@di.uminho.pt><10B841BC-C0B9-4186-A8B4-D3C FFFCB8116@di.uminho.pt>< 5023897F-1EAE-4E3A-95FF-BAB39FAD9445@di.uminho.pt><342EB496-47B1-42EA-B133- 2DBB1BB074F5@di.uminho.pt><45FDA14E-EB10-44BD-980D-2FED948F4C9B@di.uminho.p t><47D23ACA-946B-451C-88D5-D5D2970B32AF@di.uminho.pt> <4AB4C40B.4020001@di.uminho.pt> <5D96C512-8B7B-4EFE-AE37-BC31FFAE1B33@di.uminho.pt> <2B579A1E-6D2E-4B30-AF27-5302F31A21EF@di.uminho.pt> <1A959A6D-ED8C-4231-AEFB-B361827D33D4@di.uminho.pt> <8622B674-62F0-439C-80C5-EE256B716DAC@di.uminho.pt> <4DAEC066-B5BA-45A8-987A-F02AC5B99C19@di.uminho.pt> Message-ID: <94BB0D54-2E17-4455-92C7-FCFCEBC5CCC2@di.uminho.pt> TFM2009 2nd Int. FME Conference on Teaching Formal Methods Friday, November 6th 2009, co-located with FM2009 : 16th Int. Symposium on Formal Methods Eindhoven, the Netherlands, November 2 - November 6, 2009 CALL FOR PARTICIPATION (URL: http://www.di.uminho.pt/tfm09) 1. About the conference ----------------------- Ten years after the First World Formal Methods Congress (FM'99) in Toulouse, formal methods communities from all over the world will once again have an opportunity to come together. As part of the First Formal Methods Week event surrounding the FM2009 conference in Eindhoven, Formal Methods Europe will be organizing TFM2009, the Second International Conference on Teaching Formal Methods. The conference will serve as a forum to explore the successes and failures of Formal Methods (FM) education, and to promote cooperative projects to further education and training in FMs. TFM2009 will include a panel discussion on the idea of building a 'Guide to the Formal Methods Body of Knowledge' (FMBoK), inspired by similar efforts for software engineering (SWEBoK) and for project management (PMBoK); such a resource would provide guidance to teachers, managers, and developers on what should be expected from a comprehensive, balanced programme of education in FMs. 2. Invited speaker ------------------ Jeff Kramer (Imperial College London, UK) 3. Accepted papers ------------------ * Teaching Concurrency: Theory in Practice (Luca Aceto, Anna Ingolfsdottir, Kim Guldstrand Larsen, Jiri Srba) * Integrated and Tool-Supported Teaching of Testing, Debugging, and Verification (Wolfgang Ahrendt, Richard Bubel, Reiner Haehnle) * What Top-Level Software Engineers Tackle after Learning Formal Methods - Experiences from the Top SE Project (Fuyuki Ishikawa, Kenji Taguchi, Nobukazu Yoshioka, Shinichi Honiden) * Teaching program specification and verification using JML and ESC/Java2 (Erik Poll) * Chief Chefs of Z to Alloy: Using A Kitchen Example to Teach Alloy with Z (Sureyya Tarkan, Vibha Sazawal) * Teaching Formal Methods based on Rewriting Logic and Maude (Peter Olveczky) * Which Mathematics for the Information Society? (Joao Ferreira, Alexandra Mendes, Roland Backhouse, Luis Barbosa) * How to explain mistakes (Stefan Hallerstede, Michael Leuschel) * On Teaching Formal Methods: Behavior Models and Code Analysis (Jan Kofron, Ondrej Sery, Pavel Parizek) * Teaching Formal Methods for the Unconquered Territory (Nestor Catano, Camilo Rueda) 4. Sponsors -------------- * Formal Methods Europe Association (FME) * Software Improvement Group (SIG) , Amsterdam, Netherlands 5. Programme Committee ---------------------- Izzat Alsmadi (North Dakota State University, USA) Dines Bjorner (IIMM Institute, Denmark) Eerke Boiten (University of Kent, UK) Raymond Boute (Universiteit Gent, Belgium) Andrew Butterfield (Trinity College, Dublin) Jim Davies (University of Oxford, UK) David Duce (Oxford Brookes University, UK) John Fitzgerald (University of Newcastle upon Tyne, UK) Jeremy Gibbons (University of Oxford, UK) Randolph Johnson (National Security Agency, USA) Michael Mac an Airchinnigh (Trinity College, Dublin) Dino Mandrioli (Politecnico di Milano, Italy) Jose Oliveira (Universidade do Minho, Portugal) Kees Pronk (Technische Universiteit Delft, NL) Bernhard Schaetz (Tecnical University of Munique, Germany) Wolfgang Schreiner (Johannes Kepler University Linz, Austria) Simao Melo de Sousa (Universidade da Beira Interior, Portugal) Kenji Taguchi (National Institute of Informatics, Japan) Jeannette Wing (Carnegie-Mellon University, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090920/a94eafcb/attachment.html From tux_rocker at reinier.de Sun Sep 20 16:38:24 2009 From: tux_rocker at reinier.de (Reinier Lamers) Date: Sun Sep 20 16:16:52 2009 Subject: [Haskell] ANN: darcs 2.3.1: better docs, fewer bugs Message-ID: <200909202238.27339.tux_rocker@reinier.de> Dear Darcs users, The darcs team would like to announce the immediate availability of a new stable version of darcs, 2.3.1. This is a bugfix release. The user-visible changes are: * Fix bugs in optimizations in 2.3.0 * Documentation improvements * Remove autoconf build system A more complete list of changes in this and older versions of darcs can be found at http://www.darcs.net/NEWS . Installing ---------- You can obtain the source tarball at the following address: * http://darcs.net/releases/darcs-2.3.1.tar.gz The build instructions are available in the enclosed README file in those tarballs. Moreover, if you have cabal-install available, you can install latest stable release of darcs by issuing the following commands (no tarballs needed): $ cabal update $ cabal install darcs This should give you a darcs binary in `~/.cabal/bin` -- you should probably add this to your PATH. More detailed instructions for installing on Windows are available near the end of this announcement. Installing on Windows --------------------- To install darcs on Windows systems from scratch, please download the Haskell Platform and MSYS: * http://hackage.haskell.org/platform/2009.2.0.1/HaskellPlatform-2009.2.0.1- setup.exe * http://sourceforge.net/projects/mingw/files/MSYS+Base+System/MSYS-1.0.11- rc-1.exe/download After installing both, you should have an "MSYS" icon: run MSYS and in the terminal window type (the `$` character denotes the prompt, do not repeat it): $ cabal update $ cabal install darcs -f-curl This should download, compile and install all required dependencies and also darcs itself. The resulting darcs executable will be placed into the Haskell Platform executables folder, and should be accessible from the MSYS shell (just type "darcs --version" to check). Yours, Reinier. From akenn at microsoft.com Mon Sep 21 06:29:53 2009 From: akenn at microsoft.com (Andrew Kennedy) Date: Mon Sep 21 06:07:13 2009 Subject: [Haskell] 2nd CFP: TLDI 2010 Message-ID: <8E144E0A808A2A4AA6940401CD70C5742AB3DE79BC@EA-EXMSG-C332.europe.corp.microsoft.com> ???????????????????????? TLDI 2010????????????????????? ??????????????? *** Second Call for Papers *** ????? ?????? The Fifth ACM SIGPLAN Workshop on ????????? Types in Language Design and Implementation ??????????? ? Madrid, Spain, January 23, 2010 ??????????? ??? (Co-located with POPL 2010) ????? ? http://research.microsoft.com/~akenn/tldi2010/ ??????????????? Submission Deadline: 5 October 2009 The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2010 is the fifth workshop in the series and will be co-located with POPL in Madrid, Spain in January 2010. Submissions for TLDI 2010 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2010 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented, dynamically-typed or late-bound languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: ?? * Typed intermediate languages and type-directed compilation ?? * Type-based language support for safety and security ?? * Types for interoperability ?? * Type systems for system programming languages ?? * Type-based program analysis, transformation, and optimization ?? * Dependent types and type-based proof assistants ?? * Types for security protocols, concurrency, and distributed computing ?? * Type inference and type reconstruction ?? * Type-based specifications of data structures and program invariants ?? * Type-based memory management ?? * Proof-carrying code and certifying compilation ?? * Types and objects This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. Submission Guidelines: Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Monday 5th October, 2009. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template. Papers must be submitted electronically via the conference website in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy. Submissions should contain original research not published or submitted for publication elsewhere. Important Dates: - Submission of papers: 5 October 2009 (Monday) - Notification:???????? 6 November 2009 (Friday) - Final versions due:? 15 November 2009 (Sunday) - Workshop:??????????? 23 January 2010 (Saturday) General Chair: ? Andrew Kennedy, Microsoft Research, UK Program Chair: ? Nick Benton, Microsoft Research, UK Program Committee: ? Gilles Barthe, IMDEA Software, Spain ? Viviana Bono, University of Torino, Italy ? Giorgio Ghelli, University of Pisa, Italy ? Dan Grossman, University of Washington, USA ? Atsushi Igarashi, Kyoto University, Japan ? Conor McBride, University of Strathclyde, UK ? Jeremy Siek, University of Colorado at Boulder, USA ? Zhong Shao, Yale University, USA ? Matthieu Sozeau, Harvard University, USA ? Chris Stone, Harvey Mudd College, USA ? Kristian St?vring, ITU Copenhagen, Denmark Steering Committee: Amal Ahmed, Indiana University, USA ? Craig Chambers, University of Washington, USA ? Robert Harper, Carnegie Mellon University, USA (Chair) ? Xavier Leroy, INRIA Paris-Rocquencourt, France ? Greg Morrisett, Harvard University, USA ? George Necula, Rinera Networks and UC Berkeley, USA ? Atsushi Ohori, Tohoku University, Japan ? Francois Pottier, INRIA Paris-Rocquencourt, France ? Zhong Shao, Yale University, USA From carliros.g at gmail.com Mon Sep 21 22:40:59 2009 From: carliros.g at gmail.com (carlos gomez) Date: Mon Sep 21 22:19:22 2009 Subject: [Haskell] An error using hs-plugins In-Reply-To: References: Message-ID: Hello haskell programmers I was trying to use hs-plugins [looks interesting!!], but when I tried to execute my first example [the first of the documentation or the first of the hs-plugins paper], I got this error: Main: /tmp/MjpXp11632.o: unknown symbol `base_GHCziList_reverse_closure' Main: user error (resolvedObjs failed.) I don't know how can I fix it, can someone help me? This error happened when I tried to execute and nothing happened when i compiled. I also compiled that with the makefile provided by the library and her examples, and I got the same error. I'm using ubuntu 9.04, ghc6.10.4 and hs-plugins1.4.1 Thanks, -- Carlos Gomez -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090921/e878e9f2/attachment.html From gwern0 at gmail.com Mon Sep 21 22:48:00 2009 From: gwern0 at gmail.com (Gwern Branwen) Date: Mon Sep 21 22:26:22 2009 Subject: [Haskell] An error using hs-plugins In-Reply-To: References: Message-ID: On Mon, Sep 21, 2009 at 10:40 PM, carlos gomez wrote: > Hello haskell programmers I was trying to use hs-plugins [looks > interesting!!], but when I tried to execute my first example [the first of > the documentation or the first of the hs-plugins paper], I got this error: > Main: /tmp/MjpXp11632.o: unknown symbol `base_GHCziList_reverse_closure' > Main: user error (resolvedObjs failed.) I don't know how can I fix it, can > someone help me? This error happened when I tried to execute and nothing > happened when i compiled. I also compiled that with the makefile provided by > the library and her examples, and I got the same error. I'm using ubuntu > 9.04, ghc6.10.4 and hs-plugins1.4.1 Thanks, -- Carlos Gomez hs-plugins isn't particularly maintained right now; you should probably use hint instead, or use the GHC API directly. -- gwern From kowey at darcs.net Wed Sep 23 11:36:51 2009 From: kowey at darcs.net (Eric Kow) Date: Wed Sep 23 11:15:15 2009 Subject: [Haskell] ANNOUNCE: Darcs Hacking Sprint - 14-15 November Vienna Message-ID: <20090923153650.GI11779@brighton.ac.uk> Dear Haskellers, The Darcs Team will soon be hosting its third hacking sprint. Details ------- When : 14-15 November 2009 Where: University of Technology, Vienna, Austria Who : Anybody who wants to hack on Darcs (or Camp, Focal, SO6, etc) Beginners especially welcome! Why : Darcs aims to have bi-annual hacking sprints so that we can get together on a regular basis, hold design discussions, hack up a storm and have a lot fun. What : We plan to put some finishing touches on Darcs-2.4. Darcs 2.4 is a pretty exciting release because we expect it to offer nice performance enhancements from Petr's Google Summer of Code Project, and also a nice new 'hunk splitting' feature. We also intend to set aside at least one Darcs hacker for mentoring beginners, so if you're new to Haskell or to Darcs hacking, here's a good chance to plunge in and start working on a real world project. How: Add yourself to http://wiki.darcs.net/Sprints/2009-11 or email me to let me know you're interested! Thanks ------ Thanks to our local team David Markvica and Benedikt Huber for generously offering to host this event! Thanks also to donors from the last fundraising drive. We'll be using that money to help Darcs hackers get to Vienna. Supporting Darcs ---------------- Darcs is a very happy member of the Software Freedom Conservancy. Among other things, the Software Freedom Conservancy makes it easy for open source projects to raise funds and hold assets (as part of a legal entity). For more information on supporting Darcs, see http://darcs.net/donations.html See you there! -- Eric Kow PGP Key ID: 08AC04F9 -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 197 bytes Desc: Digital signature Url : http://www.haskell.org/pipermail/haskell/attachments/20090923/0392ea77/attachment.bin From ivan.miljenovic at gmail.com Thu Sep 24 06:28:23 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Thu Sep 24 06:06:46 2009 Subject: [Haskell] ANNOUNCE: graphviz-2999.5.1.1 Message-ID: <87ocp0d4c8.fsf@gmail.com> I'm pleased to announce version 2999.5.1.1 [1] of the graphviz library, which provides bindings to the GraphViz [2] suite of tools for drawing graphs. [1] http://hackage.haskell.org/package/graphviz-2999.5.1.1 [2] http://www.graphviz.org/ This is yet another bugfix release, fixing the problem spotted by Kathleen Fisher where Dot keywords need to be explicitly quoted if used as labels, etc. Once again, this is done automagically with no change to the API. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From agocorona at gmail.com Thu Sep 24 15:24:15 2009 From: agocorona at gmail.com (Alberto G. Corona ) Date: Thu Sep 24 15:02:29 2009 Subject: [Haskell] ANN: Workflow-0.5.5, TCache-0.6.4 RefSerialize-0.2.4 In-Reply-To: References: Message-ID: Hi I'm proud to announce Workflow 0.5.5. This is a package intended to define workflows as sequences of actions with he usual do notation. Such actions may include wait for events, queue messages, etc perform processing etc for days weeks or even years without regards for shutdowns and restarts. Technically, Workflow includes a monad transformer that encapsulates any computation in a state monad that bring automatic state logging and recovery. A workflow can be viewed as a thread that persist across planeed or unplanned application shutdowns. When recovering the excution is resumed at the last action that was logged. The process continues at the same state as if not interruption took place. Any feedback will be appreciated. Besides state logging and recovery, there are a number of communication primitives that are aware of persistence across reinitiations such are persistent queues, persistent timeouts, or wait for events in the STM monad. These primitives permits inter-woikflow communications and communications with external threads. I hope that this package would be useful for very long computations, either the programs that are CPU intensive and produce valuable intermediate data or programs that wait for actions from users and others processes during days or weeks. That is typical in web applications. Such programs can be defined in a single monadic procedure transparently, without regards of saving intermediate results or reinitiations at the correct point. This new version is not restricted to handle a single type. Every intermediate data must be an instance of Read and Show. For complex data types, other persistence mechanisms can be used (see documentation). The package is at: http://hackage.haskell.org/package/Workflow http://hackage.haskell.org/packages/archive/Workflow/0.5.5/Workflow-0.5.5.tar.gz The tar archive has the documentation and some examples. Among them, a simulation of workflow for the creation and approval of documents, with two levels of approval and approval timeouts, It uses most of the features of the package. NOTE: cabal install reports Tar checksum errors when installed, however, such errors do not appear by downloading the tar.gz archive and decompressing it with the unix or windows tools. I do not know why cabal install behaves as such. Here is a simple example: This is a counter that shows a sequence of numbers, one a second: *module Main where import Control.Concurrent(threadDelay) import System.IO (hFlush,stdout) count n= do putStr (show n ++ " " ) >> hFlush stdout >> threadDelay 1000000 count (n+1) main= count 0 * This is the same program, with the added feature of remembering the last count after interruption (sequence.hs): *module Main where import Control.Workflow import Control.Concurrent(threadDelay) import System.IO (hFlush,stdout) mcount n= do step $ putStr (show n ++ " " ) >> hFlush stdout >> threadDelay 1000000 mcount (n+1) main= do registerType :: IO () registerType :: IO Int let start= 0 :: Int startWF "count" start [("count", mcount)] :: IO () * This is the execution log: *Worflow-0.5.5demos>runghc sequence.hs 0 1 2 3 4 5 6 7 sequence.hs: win32ConsoleHandler sequence.hs: sequence.hs: interrupted Worflow-0.5.5demos> Worflow-0.5.5demos>runghc sequence.hs 7 8 9 10 11 .... * This package uses TCache and RefSerialize. I also uploaded new versions of these packages with extensive documentation and examplles included in the tar.gz archives ( cabal install also repor checksum errors, but are OK when downloading and installing by hand): http://hackage.haskell.org/package/TCache http://hackage.haskell.org/packages/archive/TCache/0.6.4/TCache-0.6.4.tar.gz http://hackage.haskell.org/package/RefSerialize http://hackage.haskell.org/packages/archive/RefSerialize/0.2.4/RefSerialize-0.2.4.tar.gz -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090924/cdea6098/attachment.html From jfredett at gmail.com Sat Sep 26 12:18:01 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Sep 26 11:56:16 2009 Subject: [Haskell] Haskell Weekly News: Issue 131 - Semptember 25, 2009 Message-ID: <4abe3eb9.9453f10a.19ce.29a6@mx.google.com> This week is an experiment, I'm eliminating the mail client from the sendout, and simply using sendmail directly. If this doesn't fix the line ending problem, then I'm pretty sure it's a software issue, and not a client issue. If you notice problems, please email me at this address, put [HWN] in the subject line so my filters will catch it. Please _don't_ email me if there are no problems. Thanks, /Joe --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090926 Issue 133 - September 26, 2009 --------------------------------------------------------------------------- Welcome to issue 133 of HWN, a newsletter covering developments in the [1]Haskell community. This week, we have a few new libraries, some interesting discussion about EDSLs, a comment from Oleg, and dons extolling the virtues of SCIENCE! On the new HWN software front, I've decided to jump right into something I had planned for far further down the development chain. Specifically, rather than scraping GMane for messages, I've been working on a way to grab the messages directly from the mailing-lists. I'm not entirely sure how I'm going to create links as they are now for the messages, but one crisis at a time. Till next week, here's the Haskell Weekly News! Announcements epoll bindings 0.2. Toralf Wittner [2]announced the release of epoll bindings 0.2 available [3]here. Epoll is an I/O event notification facility for Linux similar to poll but with good scaling characteristics. This release adds a buffer abstraction on top of the existing low-level bindings, so client code can write and read to buffers without having to deal directly with the underlying epoll event handling. diagrams 0.2.1, and planned major improvements. Brent Yorgey [4]announced version 0.2.1 of the diagrams library, available now on [5]Hackage. This minor release which fixes a few bugs and adds a few new combinators, most notably a grid layout combinator contributed by Ganesh Sittampalam. Workflow-0.5.5, TCache-0.6.4 RefSerialize-0.2.4. Alberto G. Corona [6]announced Workflow 0.5.5. Workflow provides a monad transformer that encapsulates any monad in a state monad that bring automatic state logging and recovery. A workflow can be viewed as a thread that persist across planeed or unplanned application shutdowns. When recovering the execution is resumed at the last action that was logged. The process continues at the same state as if not interruption took place. graphviz-2999.5.1.1. Ivan Lazar Miljenovic [7]announced version 2999.5.1.1 of the [8]graphviz library. This is another bug-fix release, fixing the problem spotted by Kathleen Fisher where Dot keywords need to be explicitly quoted if used as labels, etc. There is no change to the API. histogram-fill, library for creating histograms. Khudyakov Alexey [9]announced [10]histogram-fill. histogram-fill provides a generic and convenient API for making histograms. Features include, multiple simultaneous histogram creation, Immutable histograms, and Serialization to and from human readable text. Darcs Hacking Sprint - 14-15 November Vienna. Eric Kow [11]announced the third Darcs Hacking Sprint. Which will take place 14-15 November, 2009 at the University of Technology, Vienna, Austria. Anybody who wants to hack on Darcs (or Camp, Focal, SO6, etc) -- Beginners especially -- are welcome! 2nd CFP: TLDI 2010. Andrew Kennedy [12]announced a second call for papers for TLDI2010, the Types in Language Design and Implementation Workshop. darcs 2.3.1: better docs, fewer bugs. Reinier Lamers [13]announced a new stable version of darcs, with bugfixes from 2.3.0, improved documentation, and removal of the old autoconf build system. TFM09: Call for Participation (FMWeek, Eindhoven, November 2009). J.N. Oliveira [14]announced a Call for Participation in TFM2009 2nd Int. FME Conference on Teaching Formal Methods Friday, November 6th 2009, co-located with FM2009 : 16th Int. Symposium on Formal Methods Eindhoven, the Netherlands, November 2 - November 6, 2009. Discussion Monad Tutorial in C++. Adrian May [15]wrote a tutorial about monads in some other niche language... Beginning of a meta-Haskell. Oleg -- [16]as if he needs any introduction -- commented on things far above my ability to understand. Evidently, however, it involves extensible, modular interpreters in the ``tagless final'' style. It was a reply to an earlier thread [17]here. An issue with EDSLs in the ``finally tagless'' tradition. Brad Larsen [18]talked about his run in with [19]the expression problem while experimenting with EDSLs. Blog noise [20]Haskell news from the [21]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Bryan O'Sullivan: [22]Riddle me this. * David Amos: [23]Finite geometries, part 3: Points in PG(n,Fq). David's continuing series on Finite Geometries. * Neil Brown: [24]Concurrent Pearl: The Expanding Prime Pipeline. * Mikael Vejdemo Johansson (Syzygy-): [25][MATH198] Lecture 1 now online. Mikael's first Category Theory Lecture is up online. * Brent Yorgey: [26]diagrams 0.2.1, and future plans. * Alex McLean: [27]hackpact week 4. Part of the continuing series on Alex's hackpact progress. * Manuel M T Chakravarty: [28]Heads Up: GHC devs on Macs - GHC's testsuite crashes spotlight indexer on SL. * Clint Moore: [29]8 Cores of Awesome. * Bryan O'Sullivan: [30]Video of my CUFP keynote. * Chris Smith: [31]Thoughts on Hackage and the Haskell Platform. * Manuel M T Chakravarty: [32]Haskell Bindings to C -> c2hs. * Neil Brown: [33]Functions into processes, using arrows. * Brent Yorgey: [34]Functional MetaPost. * Malcolm Wallace: [35]Haskell Symposium 2009 - videos now online. * DEFUN 2009: [36]DEFUN and CUFP 2009 registration are now open!. * Chris Smith: [37]Type Classes With An Easier Example. * Darcs: [38]darcs weekly news #41. * Greg Bacon: [39]Haskell craps. * Bryan O'Sullivan: [40]A new pseudo-random number generator for Haskell. * Thomas M. DuBuisson: [41]HacPDX is Coming. * Dan Piponi (sigfpe): [42]More Parsing With Best First Search. * Osfameron: [43]Coin Tricks. Quotes of the Week * lilac: ponders whether unsafePerformIO would be better as simonSaysPerformIO * bos: [On the type signature of hPrintf] This makes me a sad Irish panda. * ksf: (But if (on the other hand)) (I think only a number in general (whether it be five or a hundred)) (this thought is rather the representation of a method (whereby a multiplicity (for instance a thousand) may be represented (in an image in conformity with a certain concept)) than the image itself. * dons: ah, via the magic of SCIENCE * dobblego: many of my colleagues used to be [fond of ruby] as well until I was let loose on them * dons: (on whether a library is wanted) *yes* put it on Hackage! * BMeph: (about parsec) 'Cause it's light-years ahead of the competition! * switch: Comeon people! You make the news! * ray: I think programmers make the worst programmers, also the worst people, and I'm saying this having not looked at programming reddit in a while. * Orclev: ... a lot of haskell still looks greek to me, and I'm not talking about lambdas. * Jason Dusek: "Some day, we're going to need a short, catchy name for Cabal packages. Let's call them cabbages." [see http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63649]. * Reinier Lamers: If we keep up the current pace of performance hacking, darcs will be complete before you even hit the enter key in a few years * Trent Buck: [To Reiner Lamers] With the appropriate (ie unbuffered) terminal, this is already the case for interactive prompts. About the Haskell Weekly News New editions are posted to [44]the Haskell mailing list as well as to [45]the Haskell Sequence and [46]Planet Haskell. [47]RSS is also available, and headlines appear on [48]haskell.org. To help create new editions of this newsletter, please see the information on [49]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [50]http://patch-tag.com/r/HWN2/home . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63815 3. http://hackage.haskell.org/package/epoll 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63791 5. http://hackage.haskell.org/package/diagrams 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63786 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63770 8. http://hackage.haskell.org/package/graphviz-2999.5.1.1 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63640 10. http://hackage.haskell.org/package/histogram-fill 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17511 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17508 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17507 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17506 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63800 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63761 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 19. http://www.daimi.au.dk/~madst/tool/papers/expression.txt 20. http://planet.haskell.org/ 21. http://haskell.org/haskellwiki/Blog_articles 22. http://www.serpentine.com/blog/2009/09/25/riddle-me-this/ 23. http://haskellformaths.blogspot.com/2009/09/finite-geometries-part-3-points-in.html 24. http://chplib.wordpress.com/2009/09/24/the-expanding-prime-pipeline/ 25. http://blog.mikael.johanssons.org/archive/2009/09/math198-lecture-1-now-online/ 26. http://byorgey.wordpress.com/2009/09/24/diagrams-0-2-1-and-future-plans/ 27. http://yaxu.org/hackpact-week-3-2/ 28. http://justtesting.org/post/195668539 29. http://www.l2mlogistics.com/2009/09/8-cores-of-awesome.html 30. http://www.serpentine.com/blog/2009/09/23/video-of-my-cufp-keynote/ 31. http://cdsmith.wordpress.com/2009/09/23/thoughts-on-hackage-and-the-haskell-platform/ 32. http://justtesting.org/post/194790750 33. http://chplib.wordpress.com/2009/09/22/functions-into-processes-using-arrows/ 34. http://byorgey.wordpress.com/2009/09/21/functional-metapost/ 35. http://feedproxy.google.com/~r/malcolm/~3/wxsdwfUArJ8/haskell-symposium-2009-videos-now.html 36. http://www.defun2009.info/blog/2009/06/defun-2009-registration-is-now-open/ 37. http://cdsmith.wordpress.com/2009/09/20/side-computations-via-type-classes/ 38. http://blog.darcs.net/2009/09/darcs-weekly-news-41.html 39. http://feedproxy.google.com/~r/gbacon/~3/QILx5EtQN4o/haskell-craps.html 40. http://www.serpentine.com/blog/2009/09/19/a-new-pseudo-random-number-generator-for-haskell/ 41. http://tommd.wordpress.com/2009/09/19/hacpdx-is-coming/ 42. http://blog.sigfpe.com/2009/09/language-nomonomorphismrestrictiongener.html 43. http://greenokapi.net/blog/2009/09/19/coin-tricks/ 44. http://www.haskell.org/mailman/listinfo/haskell 45. http://sequence.complete.org/ 46. http://planet.haskell.org/ 47. http://sequence.complete.org/node/feed 48. http://haskell.org/ 49. http://haskell.org/haskellwiki/HWN 50. http://patch-tag.com/r/HWN2/home From jfredett at gmail.com Sat Sep 26 12:22:17 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Sep 26 12:00:33 2009 Subject: [Haskell] Haskell Weekly News: Issue 131 - Semptember 25, 2009 Message-ID: <4abe3fb9.9453f10a.6e9e.708a@mx.google.com> This week is an experiment, I'm eliminating the mail client from the sendout, and simply using sendmail directly. If this doesn't fix the line ending problem, then I'm pretty sure it's a software issue, and not a client issue. If you notice problems, please email me at this address, put [HWN] in the subject line so my filters will catch it. Please _don't_ email me if there are no problems. Thanks, /Joe --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090926 Issue 133 - September 26, 2009 --------------------------------------------------------------------------- Welcome to issue 133 of HWN, a newsletter covering developments in the [1]Haskell community. This week, we have a few new libraries, some interesting discussion about EDSLs, a comment from Oleg, and dons extolling the virtues of SCIENCE! On the new HWN software front, I've decided to jump right into something I had planned for far further down the development chain. Specifically, rather than scraping GMane for messages, I've been working on a way to grab the messages directly from the mailing-lists. I'm not entirely sure how I'm going to create links as they are now for the messages, but one crisis at a time. Till next week, here's the Haskell Weekly News! Announcements epoll bindings 0.2. Toralf Wittner [2]announced the release of epoll bindings 0.2 available [3]here. Epoll is an I/O event notification facility for Linux similar to poll but with good scaling characteristics. This release adds a buffer abstraction on top of the existing low-level bindings, so client code can write and read to buffers without having to deal directly with the underlying epoll event handling. diagrams 0.2.1, and planned major improvements. Brent Yorgey [4]announced version 0.2.1 of the diagrams library, available now on [5]Hackage. This minor release which fixes a few bugs and adds a few new combinators, most notably a grid layout combinator contributed by Ganesh Sittampalam. Workflow-0.5.5, TCache-0.6.4 RefSerialize-0.2.4. Alberto G. Corona [6]announced Workflow 0.5.5. Workflow provides a monad transformer that encapsulates any monad in a state monad that bring automatic state logging and recovery. A workflow can be viewed as a thread that persist across planeed or unplanned application shutdowns. When recovering the execution is resumed at the last action that was logged. The process continues at the same state as if not interruption took place. graphviz-2999.5.1.1. Ivan Lazar Miljenovic [7]announced version 2999.5.1.1 of the [8]graphviz library. This is another bug-fix release, fixing the problem spotted by Kathleen Fisher where Dot keywords need to be explicitly quoted if used as labels, etc. There is no change to the API. histogram-fill, library for creating histograms. Khudyakov Alexey [9]announced [10]histogram-fill. histogram-fill provides a generic and convenient API for making histograms. Features include, multiple simultaneous histogram creation, Immutable histograms, and Serialization to and from human readable text. Darcs Hacking Sprint - 14-15 November Vienna. Eric Kow [11]announced the third Darcs Hacking Sprint. Which will take place 14-15 November, 2009 at the University of Technology, Vienna, Austria. Anybody who wants to hack on Darcs (or Camp, Focal, SO6, etc) -- Beginners especially -- are welcome! 2nd CFP: TLDI 2010. Andrew Kennedy [12]announced a second call for papers for TLDI2010, the Types in Language Design and Implementation Workshop. darcs 2.3.1: better docs, fewer bugs. Reinier Lamers [13]announced a new stable version of darcs, with bugfixes from 2.3.0, improved documentation, and removal of the old autoconf build system. TFM09: Call for Participation (FMWeek, Eindhoven, November 2009). J.N. Oliveira [14]announced a Call for Participation in TFM2009 2nd Int. FME Conference on Teaching Formal Methods Friday, November 6th 2009, co-located with FM2009 : 16th Int. Symposium on Formal Methods Eindhoven, the Netherlands, November 2 - November 6, 2009. Discussion Monad Tutorial in C++. Adrian May [15]wrote a tutorial about monads in some other niche language... Beginning of a meta-Haskell. Oleg -- [16]as if he needs any introduction -- commented on things far above my ability to understand. Evidently, however, it involves extensible, modular interpreters in the ``tagless final'' style. It was a reply to an earlier thread [17]here. An issue with EDSLs in the ``finally tagless'' tradition. Brad Larsen [18]talked about his run in with [19]the expression problem while experimenting with EDSLs. Blog noise [20]Haskell news from the [21]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Bryan O'Sullivan: [22]Riddle me this. * David Amos: [23]Finite geometries, part 3: Points in PG(n,Fq). David's continuing series on Finite Geometries. * Neil Brown: [24]Concurrent Pearl: The Expanding Prime Pipeline. * Mikael Vejdemo Johansson (Syzygy-): [25][MATH198] Lecture 1 now online. Mikael's first Category Theory Lecture is up online. * Brent Yorgey: [26]diagrams 0.2.1, and future plans. * Alex McLean: [27]hackpact week 4. Part of the continuing series on Alex's hackpact progress. * Manuel M T Chakravarty: [28]Heads Up: GHC devs on Macs - GHC's testsuite crashes spotlight indexer on SL. * Clint Moore: [29]8 Cores of Awesome. * Bryan O'Sullivan: [30]Video of my CUFP keynote. * Chris Smith: [31]Thoughts on Hackage and the Haskell Platform. * Manuel M T Chakravarty: [32]Haskell Bindings to C -> c2hs. * Neil Brown: [33]Functions into processes, using arrows. * Brent Yorgey: [34]Functional MetaPost. * Malcolm Wallace: [35]Haskell Symposium 2009 - videos now online. * DEFUN 2009: [36]DEFUN and CUFP 2009 registration are now open!. * Chris Smith: [37]Type Classes With An Easier Example. * Darcs: [38]darcs weekly news #41. * Greg Bacon: [39]Haskell craps. * Bryan O'Sullivan: [40]A new pseudo-random number generator for Haskell. * Thomas M. DuBuisson: [41]HacPDX is Coming. * Dan Piponi (sigfpe): [42]More Parsing With Best First Search. * Osfameron: [43]Coin Tricks. Quotes of the Week * lilac: ponders whether unsafePerformIO would be better as simonSaysPerformIO * bos: [On the type signature of hPrintf] This makes me a sad Irish panda. * ksf: (But if (on the other hand)) (I think only a number in general (whether it be five or a hundred)) (this thought is rather the representation of a method (whereby a multiplicity (for instance a thousand) may be represented (in an image in conformity with a certain concept)) than the image itself. * dons: ah, via the magic of SCIENCE * dobblego: many of my colleagues used to be [fond of ruby] as well until I was let loose on them * dons: (on whether a library is wanted) *yes* put it on Hackage! * BMeph: (about parsec) 'Cause it's light-years ahead of the competition! * switch: Comeon people! You make the news! * ray: I think programmers make the worst programmers, also the worst people, and I'm saying this having not looked at programming reddit in a while. * Orclev: ... a lot of haskell still looks greek to me, and I'm not talking about lambdas. * Jason Dusek: "Some day, we're going to need a short, catchy name for Cabal packages. Let's call them cabbages." [see http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63649]. * Reinier Lamers: If we keep up the current pace of performance hacking, darcs will be complete before you even hit the enter key in a few years * Trent Buck: [To Reiner Lamers] With the appropriate (ie unbuffered) terminal, this is already the case for interactive prompts. About the Haskell Weekly News New editions are posted to [44]the Haskell mailing list as well as to [45]the Haskell Sequence and [46]Planet Haskell. [47]RSS is also available, and headlines appear on [48]haskell.org. To help create new editions of this newsletter, please see the information on [49]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [50]http://patch-tag.com/r/HWN2/home . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63815 3. http://hackage.haskell.org/package/epoll 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63791 5. http://hackage.haskell.org/package/diagrams 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63786 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63770 8. http://hackage.haskell.org/package/graphviz-2999.5.1.1 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63640 10. http://hackage.haskell.org/package/histogram-fill 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17511 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17508 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17507 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17506 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63800 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63761 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 19. http://www.daimi.au.dk/~madst/tool/papers/expression.txt 20. http://planet.haskell.org/ 21. http://haskell.org/haskellwiki/Blog_articles 22. http://www.serpentine.com/blog/2009/09/25/riddle-me-this/ 23. http://haskellformaths.blogspot.com/2009/09/finite-geometries-part-3-points-in.html 24. http://chplib.wordpress.com/2009/09/24/the-expanding-prime-pipeline/ 25. http://blog.mikael.johanssons.org/archive/2009/09/math198-lecture-1-now-online/ 26. http://byorgey.wordpress.com/2009/09/24/diagrams-0-2-1-and-future-plans/ 27. http://yaxu.org/hackpact-week-3-2/ 28. http://justtesting.org/post/195668539 29. http://www.l2mlogistics.com/2009/09/8-cores-of-awesome.html 30. http://www.serpentine.com/blog/2009/09/23/video-of-my-cufp-keynote/ 31. http://cdsmith.wordpress.com/2009/09/23/thoughts-on-hackage-and-the-haskell-platform/ 32. http://justtesting.org/post/194790750 33. http://chplib.wordpress.com/2009/09/22/functions-into-processes-using-arrows/ 34. http://byorgey.wordpress.com/2009/09/21/functional-metapost/ 35. http://feedproxy.google.com/~r/malcolm/~3/wxsdwfUArJ8/haskell-symposium-2009-videos-now.html 36. http://www.defun2009.info/blog/2009/06/defun-2009-registration-is-now-open/ 37. http://cdsmith.wordpress.com/2009/09/20/side-computations-via-type-classes/ 38. http://blog.darcs.net/2009/09/darcs-weekly-news-41.html 39. http://feedproxy.google.com/~r/gbacon/~3/QILx5EtQN4o/haskell-craps.html 40. http://www.serpentine.com/blog/2009/09/19/a-new-pseudo-random-number-generator-for-haskell/ 41. http://tommd.wordpress.com/2009/09/19/hacpdx-is-coming/ 42. http://blog.sigfpe.com/2009/09/language-nomonomorphismrestrictiongener.html 43. http://greenokapi.net/blog/2009/09/19/coin-tricks/ 44. http://www.haskell.org/mailman/listinfo/haskell 45. http://sequence.complete.org/ 46. http://planet.haskell.org/ 47. http://sequence.complete.org/node/feed 48. http://haskell.org/ 49. http://haskell.org/haskellwiki/HWN 50. http://patch-tag.com/r/HWN2/home From jfredett at gmail.com Sat Sep 26 12:24:01 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Sep 26 12:02:16 2009 Subject: [Haskell] Haskell Weekly News: Issue 131 - Semptember 25, 2009 Message-ID: <4abe4021.9553f10a.0bfb.3fbb@mx.google.com> This week is an experiment, I'm eliminating the mail client from the sendout, and simply using sendmail directly. If this doesn't fix the line ending problem, then I'm pretty sure it's a software issue, and not a client issue. If you notice problems, please email me at this address, put [HWN] in the subject line so my filters will catch it. Please _don't_ email me if there are no problems. Thanks, /Joe --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090926 Issue 133 - September 26, 2009 --------------------------------------------------------------------------- Welcome to issue 133 of HWN, a newsletter covering developments in the [1]Haskell community. This week, we have a few new libraries, some interesting discussion about EDSLs, a comment from Oleg, and dons extolling the virtues of SCIENCE! On the new HWN software front, I've decided to jump right into something I had planned for far further down the development chain. Specifically, rather than scraping GMane for messages, I've been working on a way to grab the messages directly from the mailing-lists. I'm not entirely sure how I'm going to create links as they are now for the messages, but one crisis at a time. Till next week, here's the Haskell Weekly News! Announcements epoll bindings 0.2. Toralf Wittner [2]announced the release of epoll bindings 0.2 available [3]here. Epoll is an I/O event notification facility for Linux similar to poll but with good scaling characteristics. This release adds a buffer abstraction on top of the existing low-level bindings, so client code can write and read to buffers without having to deal directly with the underlying epoll event handling. diagrams 0.2.1, and planned major improvements. Brent Yorgey [4]announced version 0.2.1 of the diagrams library, available now on [5]Hackage. This minor release which fixes a few bugs and adds a few new combinators, most notably a grid layout combinator contributed by Ganesh Sittampalam. Workflow-0.5.5, TCache-0.6.4 RefSerialize-0.2.4. Alberto G. Corona [6]announced Workflow 0.5.5. Workflow provides a monad transformer that encapsulates any monad in a state monad that bring automatic state logging and recovery. A workflow can be viewed as a thread that persist across planeed or unplanned application shutdowns. When recovering the execution is resumed at the last action that was logged. The process continues at the same state as if not interruption took place. graphviz-2999.5.1.1. Ivan Lazar Miljenovic [7]announced version 2999.5.1.1 of the [8]graphviz library. This is another bug-fix release, fixing the problem spotted by Kathleen Fisher where Dot keywords need to be explicitly quoted if used as labels, etc. There is no change to the API. histogram-fill, library for creating histograms. Khudyakov Alexey [9]announced [10]histogram-fill. histogram-fill provides a generic and convenient API for making histograms. Features include, multiple simultaneous histogram creation, Immutable histograms, and Serialization to and from human readable text. Darcs Hacking Sprint - 14-15 November Vienna. Eric Kow [11]announced the third Darcs Hacking Sprint. Which will take place 14-15 November, 2009 at the University of Technology, Vienna, Austria. Anybody who wants to hack on Darcs (or Camp, Focal, SO6, etc) -- Beginners especially -- are welcome! 2nd CFP: TLDI 2010. Andrew Kennedy [12]announced a second call for papers for TLDI2010, the Types in Language Design and Implementation Workshop. darcs 2.3.1: better docs, fewer bugs. Reinier Lamers [13]announced a new stable version of darcs, with bugfixes from 2.3.0, improved documentation, and removal of the old autoconf build system. TFM09: Call for Participation (FMWeek, Eindhoven, November 2009). J.N. Oliveira [14]announced a Call for Participation in TFM2009 2nd Int. FME Conference on Teaching Formal Methods Friday, November 6th 2009, co-located with FM2009 : 16th Int. Symposium on Formal Methods Eindhoven, the Netherlands, November 2 - November 6, 2009. Discussion Monad Tutorial in C++. Adrian May [15]wrote a tutorial about monads in some other niche language... Beginning of a meta-Haskell. Oleg -- [16]as if he needs any introduction -- commented on things far above my ability to understand. Evidently, however, it involves extensible, modular interpreters in the ``tagless final'' style. It was a reply to an earlier thread [17]here. An issue with EDSLs in the ``finally tagless'' tradition. Brad Larsen [18]talked about his run in with [19]the expression problem while experimenting with EDSLs. Blog noise [20]Haskell news from the [21]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Bryan O'Sullivan: [22]Riddle me this. * David Amos: [23]Finite geometries, part 3: Points in PG(n,Fq). David's continuing series on Finite Geometries. * Neil Brown: [24]Concurrent Pearl: The Expanding Prime Pipeline. * Mikael Vejdemo Johansson (Syzygy-): [25][MATH198] Lecture 1 now online. Mikael's first Category Theory Lecture is up online. * Brent Yorgey: [26]diagrams 0.2.1, and future plans. * Alex McLean: [27]hackpact week 4. Part of the continuing series on Alex's hackpact progress. * Manuel M T Chakravarty: [28]Heads Up: GHC devs on Macs - GHC's testsuite crashes spotlight indexer on SL. * Clint Moore: [29]8 Cores of Awesome. * Bryan O'Sullivan: [30]Video of my CUFP keynote. * Chris Smith: [31]Thoughts on Hackage and the Haskell Platform. * Manuel M T Chakravarty: [32]Haskell Bindings to C -> c2hs. * Neil Brown: [33]Functions into processes, using arrows. * Brent Yorgey: [34]Functional MetaPost. * Malcolm Wallace: [35]Haskell Symposium 2009 - videos now online. * DEFUN 2009: [36]DEFUN and CUFP 2009 registration are now open!. * Chris Smith: [37]Type Classes With An Easier Example. * Darcs: [38]darcs weekly news #41. * Greg Bacon: [39]Haskell craps. * Bryan O'Sullivan: [40]A new pseudo-random number generator for Haskell. * Thomas M. DuBuisson: [41]HacPDX is Coming. * Dan Piponi (sigfpe): [42]More Parsing With Best First Search. * Osfameron: [43]Coin Tricks. Quotes of the Week * lilac: ponders whether unsafePerformIO would be better as simonSaysPerformIO * bos: [On the type signature of hPrintf] This makes me a sad Irish panda. * ksf: (But if (on the other hand)) (I think only a number in general (whether it be five or a hundred)) (this thought is rather the representation of a method (whereby a multiplicity (for instance a thousand) may be represented (in an image in conformity with a certain concept)) than the image itself. * dons: ah, via the magic of SCIENCE * dobblego: many of my colleagues used to be [fond of ruby] as well until I was let loose on them * dons: (on whether a library is wanted) *yes* put it on Hackage! * BMeph: (about parsec) 'Cause it's light-years ahead of the competition! * switch: Comeon people! You make the news! * ray: I think programmers make the worst programmers, also the worst people, and I'm saying this having not looked at programming reddit in a while. * Orclev: ... a lot of haskell still looks greek to me, and I'm not talking about lambdas. * Jason Dusek: "Some day, we're going to need a short, catchy name for Cabal packages. Let's call them cabbages." [see http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63649]. * Reinier Lamers: If we keep up the current pace of performance hacking, darcs will be complete before you even hit the enter key in a few years * Trent Buck: [To Reiner Lamers] With the appropriate (ie unbuffered) terminal, this is already the case for interactive prompts. About the Haskell Weekly News New editions are posted to [44]the Haskell mailing list as well as to [45]the Haskell Sequence and [46]Planet Haskell. [47]RSS is also available, and headlines appear on [48]haskell.org. To help create new editions of this newsletter, please see the information on [49]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [50]http://patch-tag.com/r/HWN2/home . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63815 3. http://hackage.haskell.org/package/epoll 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63791 5. http://hackage.haskell.org/package/diagrams 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63786 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63770 8. http://hackage.haskell.org/package/graphviz-2999.5.1.1 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63640 10. http://hackage.haskell.org/package/histogram-fill 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17511 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17508 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17507 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17506 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63800 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63761 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 19. http://www.daimi.au.dk/~madst/tool/papers/expression.txt 20. http://planet.haskell.org/ 21. http://haskell.org/haskellwiki/Blog_articles 22. http://www.serpentine.com/blog/2009/09/25/riddle-me-this/ 23. http://haskellformaths.blogspot.com/2009/09/finite-geometries-part-3-points-in.html 24. http://chplib.wordpress.com/2009/09/24/the-expanding-prime-pipeline/ 25. http://blog.mikael.johanssons.org/archive/2009/09/math198-lecture-1-now-online/ 26. http://byorgey.wordpress.com/2009/09/24/diagrams-0-2-1-and-future-plans/ 27. http://yaxu.org/hackpact-week-3-2/ 28. http://justtesting.org/post/195668539 29. http://www.l2mlogistics.com/2009/09/8-cores-of-awesome.html 30. http://www.serpentine.com/blog/2009/09/23/video-of-my-cufp-keynote/ 31. http://cdsmith.wordpress.com/2009/09/23/thoughts-on-hackage-and-the-haskell-platform/ 32. http://justtesting.org/post/194790750 33. http://chplib.wordpress.com/2009/09/22/functions-into-processes-using-arrows/ 34. http://byorgey.wordpress.com/2009/09/21/functional-metapost/ 35. http://feedproxy.google.com/~r/malcolm/~3/wxsdwfUArJ8/haskell-symposium-2009-videos-now.html 36. http://www.defun2009.info/blog/2009/06/defun-2009-registration-is-now-open/ 37. http://cdsmith.wordpress.com/2009/09/20/side-computations-via-type-classes/ 38. http://blog.darcs.net/2009/09/darcs-weekly-news-41.html 39. http://feedproxy.google.com/~r/gbacon/~3/QILx5EtQN4o/haskell-craps.html 40. http://www.serpentine.com/blog/2009/09/19/a-new-pseudo-random-number-generator-for-haskell/ 41. http://tommd.wordpress.com/2009/09/19/hacpdx-is-coming/ 42. http://blog.sigfpe.com/2009/09/language-nomonomorphismrestrictiongener.html 43. http://greenokapi.net/blog/2009/09/19/coin-tricks/ 44. http://www.haskell.org/mailman/listinfo/haskell 45. http://sequence.complete.org/ 46. http://planet.haskell.org/ 47. http://sequence.complete.org/node/feed 48. http://haskell.org/ 49. http://haskell.org/haskellwiki/HWN 50. http://patch-tag.com/r/HWN2/home From jfredett at gmail.com Sat Sep 26 12:32:07 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Sep 26 12:10:23 2009 Subject: [Haskell] Sorry about the triple post Message-ID: Trying to work out how to make sendmail do what I want, my computer is a fickle beast. Also- it should be HWN issue 133. But I'm an idiot, and just copied the value without thinking. Someday, when I automate all the uploading/sending to the list business, this will not be an issue... :/ /Joe From simon at joyful.com Sat Sep 26 19:44:08 2009 From: simon at joyful.com (Simon Michael) Date: Sat Sep 26 19:22:24 2009 Subject: [Haskell] ANN: rss2irc 0.4 released Message-ID: I have released rss2irc 0.4, with some improvements from the field: - fix a problem connecting with irc.quakenet.org (Radoslav Dorcik) - feed polling now recovers from transient failures - can poll a local file: uri as well as remote uris - more robust new item detection, with some alternate strategies available - --idle option, waits for channel inactivity before announcing - limit individual field sizes, preventing too many irc messages per item - misc. output improvements - logging improvements - --delay now takes minutes, not seconds See hackage for more detail. Note the new contributor! Thanks Radoslav. home: http://hackage.haskell.org/package/rss2irc darcs repo: http://joyful.com/darcsweb/darcsweb.cgi?r=rss2irc I am currently using this to run hackagebot, darcscommitbot and other announce-bots on freenode. A tip: if you experiment, avoid joining the irc server too frequently; once per minute may be ok. Feedback and patches welcome. Best, -Simon -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20090926/091cfae9/attachment.html From simon at joyful.com Sun Sep 27 17:52:32 2009 From: simon at joyful.com (Simon Michael) Date: Sun Sep 27 17:30:43 2009 Subject: [Haskell] Re: ANN: rss2irc 0.4 released In-Reply-To: References: Message-ID: <273501BB-A5E9-4CCA-B8D0-13E737ECCC04@joyful.com> Whoops, bugfixes: Release notes for 0.4.2, 2009-09-27: - fix a bug where every --max-items-th announcement was skipped Release notes for 0.4.1, 2009-09-26: - fix release notes From ivan.miljenovic at gmail.com Tue Sep 29 03:36:37 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Tue Sep 29 03:14:42 2009 Subject: [Haskell] ANNOUNCE: graphviz-2999.6.0.0 Message-ID: <87my4ew6be.fsf@gmail.com> I'm pleased to announce version 2999.6.0.0 [1] of the graphviz library, which provides bindings to the GraphViz [2] suite of tools for drawing graphs. [1] http://hackage.haskell.org/package/graphviz-2999.6.0.0 [2] http://www.graphviz.org/ Changes since the previous version are: * Remove some Shape aliases and change capitalisation of others. * Properly parse and print IDs of clusters. * Allow NodeCluster values have node types different from the LNode they come from. Since the node type is only used for passing to the function to create the appropriate Attributes for that node, this can mean avoiding having to apply a transformation function before getting the attributes if you have a composite type for node value/cluster. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From ivan.miljenovic at gmail.com Tue Sep 29 03:46:09 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Tue Sep 29 03:24:16 2009 Subject: [Haskell] ANNOUNCE: Graphalyze-0.7.0.0 Message-ID: <87iqf2w5vi.fsf@gmail.com> Graphalyze [1] is a library for using graph-theoretic techniques to analyse the relationships inherent within discrete data. It was originally written for my Honours thesis [2] last year, and I have now started updating it. [1] http://hackage.haskell.org/package/Graphalyze [2] http://ivanmiljenovic.wordpress.com/2008/11/03/graph-theoretic-analysis-of-relationships-within-discrete-data/ Graphalyze provides helper functions to import discrete data, analyse it using various algorithms (a dodgy term, I know, but I couldn't think of a better one) and then create a report with the results. The main changes since the previous version are: * The ability to have graphs with edge labels. * More of a focus on applying changes to the overall information state of the data rather than just extracting the graph and applying a function to it. * Usage of the updated features in the graphviz library (http://hackage.haskell.org/package/graphviz) to visualise graphs. Changes to come: * Re-do the reporting framework to use more of a pretty-printing approach and make it more customisable. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From ivan.miljenovic at gmail.com Tue Sep 29 04:00:57 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Tue Sep 29 03:39:07 2009 Subject: [Haskell] ANNOUNCE: SourceGraph-0.5.0.0 Message-ID: <87eipqw56u.fsf@gmail.com> SourceGraph [1] is a tool to statically analyse your Haskell code by applying graph-theoretic techniques on the call graph. It utilised the Graphalyze [2] library to do so, both of which were originally written as part of my Honours thesis last year [3]. [1] http://hackage.haskell.org/package/SourceGraph [2] http://hackage.haskell.org/package/Graphalyze [3] http://ivanmiljenovic.wordpress.com/2008/11/03/graph-theoretic-analysis-of-relationships-within-discrete-data/ I have been meaning to update SourceGraph since last year, but was waiting for improvements to the graphviz [4] library first. Now that these are done and I have fewer excuses, I've started to improve upon it. [4] http://hackage.haskell.org/package/graphviz When I first released SourceGraph last year, several people (e.g. Gwern) wanted support for CPP and command-line options. Unfortunately, I haven't yet gotten around to that; what I have done is added support for type classes and data structures, something I originally said I wasn't going to do. This support isn't perfect, especially when dealing with type classes from outside the scope of the code base, but in most cases works (except that the virtual instance functions don't always get positioned in the correct spots for some reason). The produced graphs are now also much prettier, with various colours and shapes being used. The useful features that SourceGraph offers include: * Visualisation of each module, the relations between modules and the entire code base. * Finds functions that are exported from a module that isn't in exposed in the .cabal file. * Alternate module splits. Please note that SourceGraph is _not_ a refactoring tool: it is designed to give you the programmer more information about what is in your code. I'd appreciate it if people could give SourceGraph a whirl and at least check how well the conversion from Haskell code to the graph is, as I'm not that sure how well I've converted haskel-src-ext's [5] internal state to SourceGraph's state. Please note that there are already various aspects that I know don't work properly; these can be found in the ParsingProblems.txt file (KnownProblems.txt contains other non-parsing problems that I'm aware of). In particular, TH, etc. aren't supported. [5] http://hackage.haskell.org/package/haskell-src-exts-1.1.4 To use SourceGraph after it's been installed, at a prompt do the following: > SourceGraph path/to/project.cabal The resulting report will then be found in a directory called "SourceGraph" in the same directory as the cabal file. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From ivan.miljenovic at gmail.com Tue Sep 29 04:03:23 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Tue Sep 29 03:41:31 2009 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Graphalyze-0.7.0.0 In-Reply-To: <5e0214850909290056t20d97012m24869d6a0f32126f@mail.gmail.com> (Eugene Kirpichov's message of "Tue, 29 Sep 2009 11:56:58 +0400") References: <87iqf2w5vi.fsf@gmail.com> <5e0214850909290056t20d97012m24869d6a0f32126f@mail.gmail.com> Message-ID: <87ab0ew52s.fsf@gmail.com> Eugene Kirpichov writes: > Ivan, could you please mention some examples of things you can do with > the library here in the mailing list? I am intrigued by the idea. Couldn't you wait until you read my announcement email for SourceGraph? :p Other ideas I had for this kind of analysis: * Examine the internal structure of a company/department/etc. in terms of the employee hierarchy. * Who-knows-who: analyse address books (whether it's traditional, email, Facebook, etc.); this is related to the six-degree problem. > > 2009/9/29 Ivan Lazar Miljenovic : >> Graphalyze [1] is a library for using graph-theoretic techniques to >> analyse the relationships inherent within discrete data. ?It was >> originally written for my Honours thesis [2] last year, and I have now >> started updating it. >> >> [1] http://hackage.haskell.org/package/Graphalyze >> [2] http://ivanmiljenovic.wordpress.com/2008/11/03/graph-theoretic-analysis-of-relationships-within-discrete-data/ >> >> Graphalyze provides helper functions to import discrete data, analyse it >> using various algorithms (a dodgy term, I know, but I couldn't think of >> a better one) and then create a report with the results. >> >> The main changes since the previous version are: >> >> * The ability to have graphs with edge labels. >> >> * More of a focus on applying changes to the overall information state >> ?of the data rather than just extracting the graph and applying a >> ?function to it. >> >> * Usage of the updated features in the graphviz library >> ?(http://hackage.haskell.org/package/graphviz) to visualise graphs. >> >> Changes to come: >> >> * Re-do the reporting framework to use more of a pretty-printing >> ?approach and make it more customisable. >> >> -- >> Ivan Lazar Miljenovic >> Ivan.Miljenovic@gmail.com >> IvanMiljenovic.wordpress.com >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe@haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From colin at colina.demon.co.uk Tue Sep 29 05:32:09 2009 From: colin at colina.demon.co.uk (Colin Paul Adams) Date: Tue Sep 29 05:10:16 2009 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: SourceGraph-0.5.0.0 In-Reply-To: <87eipqw56u.fsf@gmail.com> (Ivan Lazar Miljenovic's message of "Tue\, 29 Sep 2009 18\:00\:57 +1000") References: <87eipqw56u.fsf@gmail.com> Message-ID: >>>>> "Ivan" == Ivan Lazar Miljenovic writes: Ivan> I'd appreciate it if people could give SourceGraph a whirl Fails to install (Linux x86_64): Data/Graph/Analysis/Utils.hs:207:43: Ambiguous occurrence `dotizeGraph' It could refer to either `Data.Graph.Analysis.Utils.dotizeGraph', defined at Data/Graph/Analysis/Utils.hs:199:0 or `Data.GraphViz.dotizeGraph', imported from Data.GraphViz at Data/Graph/Analysis/Utils.hs:81:0-19 Data/Graph/Analysis/Utils.hs:220:18: Not in scope: data constructor `PointList' cabal: Error: some packages failed to install: Graphalyze-0.5 failed during the building phase. The exception was: exit: ExitFailure 1 SourceGraph-0.3 depends on Graphalyze-0.5 which failed to install. -- Colin Adams Preston Lancashire From ivan.miljenovic at gmail.com Tue Sep 29 06:18:48 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Tue Sep 29 05:56:58 2009 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: SourceGraph-0.5.0.0 In-Reply-To: (Colin Paul Adams's message of "Tue, 29 Sep 2009 10:32:09 +0100") References: <87eipqw56u.fsf@gmail.com> Message-ID: <87ljjyuk8n.fsf@gmail.com> Colin Paul Adams writes: Compare the version in the subject to the version you're trying to install... >>>>>> "Ivan" == Ivan Lazar Miljenovic writes: > > Ivan> I'd appreciate it if people could give SourceGraph a whirl > > Fails to install (Linux x86_64): > > Data/Graph/Analysis/Utils.hs:207:43: > Ambiguous occurrence `dotizeGraph' > It could refer to either `Data.Graph.Analysis.Utils.dotizeGraph', defined at Data/Graph/Analysis/Utils.hs:199:0 > or `Data.GraphViz.dotizeGraph', imported from Data.GraphViz at Data/Graph/Analysis/Utils.hs:81:0-19 > > Data/Graph/Analysis/Utils.hs:220:18: > Not in scope: data constructor `PointList' > cabal: Error: some packages failed to install: > Graphalyze-0.5 failed during the building phase. The exception was: > exit: ExitFailure 1 > SourceGraph-0.3 depends on Graphalyze-0.5 which failed to install. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From colin at colina.demon.co.uk Tue Sep 29 06:45:48 2009 From: colin at colina.demon.co.uk (Colin Paul Adams) Date: Tue Sep 29 06:23:56 2009 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: SourceGraph-0.5.0.0 In-Reply-To: <87ljjyuk8n.fsf@gmail.com> (Ivan Lazar Miljenovic's message of "Tue\, 29 Sep 2009 20\:18\:48 +1000") References: <87eipqw56u.fsf@gmail.com> <87ljjyuk8n.fsf@gmail.com> Message-ID: >>>>> "Ivan" == Ivan Lazar Miljenovic writes: Ivan> Colin Paul Adams writes: Compare Ivan> the version in the subject to the version you're trying to Ivan> install... You are right. i forgot to do a cabal update first. -- Colin Adams Preston Lancashire From drcygnus at gmail.com Wed Sep 30 00:35:31 2009 From: drcygnus at gmail.com (Jonathan Daugherty) Date: Wed Sep 30 00:13:35 2009 Subject: [Haskell] ANNOUNCE: vty-ui 0.1 Message-ID: <20090930043530.GA31155@janrain.com> vty-ui is: An extensible library of user interface widgets for composing and laying out Vty user interfaces. This library provides a collection of widgets and a type class for rendering widgets to Vty Images. Get it from Hackage: http://hackage.haskell.org/package/vty-ui Or get the source with darcs: http://repos.codevine.org/vty-ui This package is motivated by the desire to create terminal user interfaces easily without having to worry about doing all of the structural book-keeping that so often comes with such an approach. Future releases will probably include more widget composition tools, more interesting widgets, and helper code for building interesting things. For now, the library contains some basic widgets (including horizontal and vertical box layout) and a List widget. See the vty-ui-demo program and source for an interactive demonstration of the available widgets. Future releases may also address performance, as I honestly don't have a very clear idea of how well my approach is going to scale for non-trivial interfaces. Please don't hesitate to send patches, feedback, and criticism directly to me at drcygnus AT gmail DOT com. Lastly, thanks a ton to the authors of Vty. It's a pleasure to use. Enjoy! -- Jonathan Daugherty From kmatsu at ipl.t.u-tokyo.ac.jp Wed Sep 30 23:06:38 2009 From: kmatsu at ipl.t.u-tokyo.ac.jp (Kiminori Matsuzaki) Date: Wed Sep 30 22:44:52 2009 Subject: [Haskell] (Deadline extended to October 5th) APLAS 2009 Call for Posters Message-ID: <4AC41CBE.7010109@ipl.t.u-tokyo.ac.jp> CALL FOR POSTER PRESENTATIONS The Seventh ASIAN Symposium on Programming Languages and Systems (APLAS 2009) December 14 - 16, 2009 Seoul National University, Seoul, Korea http://ropas.snu.ac.kr/aplas09/ FYI: The list of accepted papers is now on the webpage. FYI: APLAS 2009 will be co-located with the 13th Annual Asian Computing Science Conference (ASIAN 2009). APLAS 2009 will include a poster session during the conference. The session aims to give students and researchers an opportunity to present their research to the community, and to get responses from other researchers. SCOPE: Poster presentations describing research advances or experience with non-trivial systems are sought in all areas of programming languages and systems, including (but not limited to): - 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 FORMAT: A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. If you need more space, contact the poster chair (kmatsu AT ipl.t.u-tokyo.ac.jp). To prepare a good poster, search the Web for "poster presentation" and you will find many useful resources. SUBMISSION: Each presenter should e-mail a 1-2 page abstract in PDF or PostScript to the poster chair (Kiminori Matsuzaki; kmatsu AT ipl.t.u-tokyo.ac.jp) by October 5th 2009. The abstract should include the title, author(s), affiliation(s), and summary of the work, and a LaTeX-template will be available at "http://ropas.snu.ac.kr/aplas09/aplas_poster_template.tex". The program of the poster session will be announced by October 10th, 2009. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. IMPORTANT DATES: - 1-2 page abstract October 5th, 2009 (Extended) - Notification October 10, 2009 - Conference December 14 - 16, 2009 CONTACT: For questions or requests, please contact the APLAS 2009 poster chair, Kiminori Matsuzaki (kmatsu AT ipl.t.u-tokyo.ac.jp). -- Kiminori MATSUZAKI, Ph.D. Email: kmatsu@ipl.t.u-tokyo.ac.jp