From Axel.Simon at ens.fr Mon Nov 2 05:40:38 2009 From: Axel.Simon at ens.fr (Axel Simon) Date: Mon Nov 2 05:17:07 2009 Subject: [Haskell] two PhD positions in static analysis, Technical University Munich, Germany Message-ID: <1257158438.13845.24.camel@aconit> Dear all, The chair II for computer science at the Technical University Munich is offering two PhD positions in the area of program analysis. The first position ("low-level analysis") is centered around defining an implementing an analysis of x86 assembler code and, in particular, of concurrency constructs. The second position ("high-level analysis") is geared towards the analysis of data structures (aka shape analysis) using numeric invariants. The intention is to extend an existing analyzer that performs a forward-reachability analysis with the aim to prove the absence of memory management errors and other defects in legacy C software. This analyzer is written in Haskell. first position: low-level analysis ---------------------------------- Most program analysis tools operate on the source code, usually C, since information on variable types, data structures and basic blocks is not available in the executable. One problem with this approach is the definition of the exact semantics of C source code as many constructs commonly found in hand-written programs are ``implementation-dependent'' or even ``undefined'' according to the C standard. These uncertainties are exacerbated when analyzing programs that make use of concurrency constructs. The goal is therefore to directly analyze the resulting x86 machine code and to reconstruct the control flow graph and data structures on-the-fly. The analysis of concurrent programs moreover requires that (abstract) states are propagated between different threads. The challenge here lies in storing a minimum number of abstract states (to reduce the memory requirements) and to get away with a minimum amount of propagation between threads. ------------------------------------- second position: high-level analysis ----------------------------------- One recurring challenge in analysing programs is the precise summarization of data structures. This so-called shape analysis commonly uses logic formulae (e.g. separation logic) to describe a data structure contained in a memory region. In this approach, a predicate must be present that describes the invariant (e.g. "list(p)" might mean that p points to a memory region containing a singly-linked list). If no predicate is available that matches the data structure that is being built by a program, the logic formula must be discarded in order to ensure termination, thereby discarding both, the shape of a memory region and the information on how it is connected to other memory regions. The goal of this position is to find novel abstractions that infer the shape of a memory region and its connection to other memory regions separately. The connection to other memory regions are then annotated with numeric variables that denote how many memory regions are reachable via the connection. The values of these variables is then tracked separately, allowing a more graceful loss of precision. am only the numeric information needs to be relaxed since number of different shapes is fixed by the structure of the program. ------------------------------------- Both positions are fully funded for 4 years and do not come with any teaching duties. The PhD students may start as soon as January 1, 2010. The salary is TVL E13 (about 2900 EUR/1650 EUR per month). The positions are part of the Emmy Noether Programme "Verifying Legacy C Programs using Numeric Domains" which is headed by Axel Simon. This project, in turn, is located within the chair of Helmut Seidl. The PhD students will be supervised by Axel Simon. What you should provide: - Master (or equivalent) degree in Computer Science or Maths - good programming skills - an interest in compiler construction, program optimization and the like - not afraid of discrete maths, lattices etc. - good writing skills in English and Haskell - an electronic application including detailed CV by December 1 (later applications may not be considered) Contact: Please send applications and any enquiries to: Axel.Simon@ens.fr From pepeiborra at gmail.com Mon Nov 2 17:53:38 2009 From: pepeiborra at gmail.com (Jose Iborra) Date: Mon Nov 2 17:29:55 2009 Subject: [Haskell] ANNOUNCE: control-monad-exception 0.5 with monadic call traces Message-ID: Folks, I'm happy to announce a new release of control-monad-exception with monadic call traces, available in Hackage. Grab it now while it is still online! Monadic stack traces are described in detail in a blog post [1]. In short, what this means for your code is the ability to generate errors like this: 500 Internal Server Error The CGI server failed with the following error: DeleteException (BmPK 2009-10-26 19:39:51.031297 UTC "Testing RPO") in deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (186, 44) deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (186, 25) deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (184, 17) deleteBenchmarkFromPK, NarradarBenchmarkDB(src/ NarradarBenchmarkDB.hs): (180, 90) deleteTests, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (108, 3) deleteTests, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (106, 20) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (52, 33) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (52, 30) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (50, 9) cgiMain, NarradarBenchmarkCGI(src/NarradarBenchmarkCGI.hs): (46, 11) Currently a preprocessor is used to insert the source location information in the right places. The preprocessor is invoked by including the following pragma at the top of your Haskell source files: {-# OPTIONS_GHC -F -pgmF MonadLoc #-} In addition, you need to be in a monad which implements the Monadloc interface, currently the EMT monad from control-monad-exception being the only one, although it is trivial to enhance any error monad to implement this interface. In addition, support for monadic stack traces could be built into GHC and: 1. No preprocessor would be needed. 2. Eventually the IO monad could be enhanced to provide stack traces like this. Enjoy your monadic call traces ! Pepe Iborra [1] - http://pepeiborra.posterous.com/monadic-stack-traces-that-make-a-lot-of-sense From gjk.liu at gmail.com Tue Nov 3 03:07:23 2009 From: gjk.liu at gmail.com (Liu Jian) Date: Tue Nov 3 02:43:35 2009 Subject: [Haskell] about verification of haskell program Message-ID: <8c2dc7030911030007m3256525eu429cef9b3d2cb4ff@mail.gmail.com> Dear all, Is there any work about "model checking haskell program"? In my opinion, think the haskell as a specification language, then we can check it or transform it to other specification language (such as, promela), so can be analyzed. cheers, Liu Jian ---- email to: gjk.liu@gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091103/757c3d7e/attachment.html From emax at chalmers.se Tue Nov 3 22:39:55 2009 From: emax at chalmers.se (Emil Axelsson) Date: Tue Nov 3 22:16:10 2009 Subject: [Haskell] ANNOUNCE: feldspar-language Message-ID: <4AF0F78B.2090405@chalmers.se> I'm happy to announce the first release of Feldspar, which is an embedded domain-specific language with associated code generator mainly targeting DSP algorithms. The language is developed in cooperation by Ericsson, Chalmers University and E?tv?s Lor?nd University. Feldspar stands for *F*unctional *E*mbedded *L*anguage for *DSP* and *PAR*allelism. The language front-end is available on Hackage: http://hackage.haskell.org/package/feldspar-language The back-end C code generator will be uploaded and announced shortly. For more information, see: http://feldspar.sourceforge.net/ / Emil From niklas.broberg at gmail.com Wed Nov 4 09:05:09 2009 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Wed Nov 4 08:41:20 2009 Subject: [Haskell] ANN: haskell-src-exts-1.3.0 Message-ID: Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.3.0! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts Version 1.3.0 is a new major release, following the PVP, as it contains a few backwards-incompatible changes, making the 1.2.x branch a very short parenthesis in history. There are two main new things in 1.3.0: fixity application is now handled uniformly regardless of which AST you use, simple or annotated, and the parser now supports multiple modules in the same source file. haskell-src-exts-1.3.0: ==================== * The *.Fixity modules now export the same Fixity type (incidentally the one previously used by the simple un-annotated parsing) and the same helper functions. If you've done all your Fixity handling using the helper functions (infix_, infixl_, infixr_), or if you've only used fixities for the un-annotated AST, you're safe. Only if you've manually created values of the annotated Fixity type will you need to pay attention. * A new entry point in the parser allows multiple modules to be parsed from the same source file ( parseModules[With[Mode|Comments]] ). * SpecialCon is now an instance of Pretty (don't ask me why it wasn't before). * fromParseResult now displays the filename in case of a failed parse. * A few bug fixes to the exact-printer (that not many seem to be using just yet). Please help me test and report! Grab a darcs version, put your source files in the Test/examples dir, and go cabal test (in the top dir). Any failing cases not due to CPP or literate source files (for the exact-printer), please report to the trac: http://trac.haskell.org/haskell-src-exts Cheers, /Niklas From max.rabkin at gmail.com Wed Nov 4 14:02:03 2009 From: max.rabkin at gmail.com (Max Rabkin) Date: Wed Nov 4 13:38:35 2009 Subject: [Haskell] ANN: fdo-notify 0.1, a client for the Desktop Notifications protocol Message-ID: Haskellers, I present to you fdo-notify, a client library for FreeDesktop.org's Desktop Notifications protocol. This is the DBUS protocol served by NotifyOSD and other notifications systems, which allows a wide variety of applications to present notifications to the user in a uniform way. The library should not require knowledge of DBus or the Desktop Notifications protocol itself, at least once fully documented (there should be enough haddocumentation for basic use already). Hackage: http://hackage.haskell.org/package/fdo-notify Mercurial: http://bitbucket.org/taejo/fdo-notify/ Basic notifications and updated/replacement notifications are supported. Images are not yet supported (adding support should be easy, but which Image type? Is there a de facto standard imaging library like the Python Imaging Library?) and nor are signals. Signals allow an application to be informed when some action is taken on the notification (NotifyOSD doesn't support actions, but other implementations might). The library is released under the 3-clause BSD license, but depends on the dbus-core and dbus-client libraries which are GPLed. I hope you find this library useful. Regards, Max From emax at chalmers.se Thu Nov 5 06:58:14 2009 From: emax at chalmers.se (Emil Axelsson) Date: Thu Nov 5 06:34:38 2009 Subject: [Haskell] ANNOUNCE: feldspar-compiler Message-ID: <4AF2BDD6.10902@chalmers.se> On behalf of my project colleagues at ELTE University, I'm happy to announce the release of feldspar-compiler: http://hackage.haskell.org/package/feldspar-compiler This package contains the C code back-end for the Feldspar EDSL, announced yesterday: http://hackage.haskell.org/package/feldspar-language For more information, see http://feldspar.sourceforge.net/ / Emil From johan.tibell at gmail.com Fri Nov 6 08:36:16 2009 From: johan.tibell at gmail.com (Johan Tibell) Date: Fri Nov 6 08:12:39 2009 Subject: [Haskell] ANN: ZuriHac: Haskell hackathon in Zurich, March 19-21 Message-ID: <90889fe70911060536g61368cf6v372be96d029f7a1@mail.gmail.com> Hi all! I am very pleased to officially announce ZuriHac, a Haskell hackathon/get-together to be held March 19-21 at the Google Office in Zurich, Switzerland. Thanks to everyone who has already expressed interest in attending. I want to stress that everyone is welcome---you do not have to be a Haskell guru to attend! Helping hack on someone else's project could be a great way to increase your Haskell-fu. If you plan on coming, please officially register [1], even if you already put your name on the wiki. Registration, travel, lodging and many other details will soon be available on the ZuriHac wiki [2]. WHEN Friday March 19 2:30pm to 6:30pm Saturday March 20 10am to 6pm Sunday March 21 10am to 6pm WHERE We will be in the TechTalk area of the Google Office at Brandschenkestrasse 110. Please see the wiki [3] for directions. ORGANIZERS Johan Tibell Christophe Poucet Hope to see you in Zurich! - The ZuriHac team [1] http://haskell.org/haskellwiki/ZuriHac/Register [2] http://haskell.org/haskellwiki/ZuriHac [3] http://haskell.org/haskellwiki/ZuriHac#Getting_to_the_Google_Office From marlowsd at gmail.com Fri Nov 6 09:32:32 2009 From: marlowsd at gmail.com (Simon Marlow) Date: Fri Nov 6 09:08:40 2009 Subject: [Haskell] Fun in the Afternoon, Cambridge, 26 November Message-ID: <4AF43380.2030608@gmail.com> "Fun in the Afternoon" is a termly seminar on functional programming and related topics, and the next one will be held at Microsoft Research, Cambridge (U.K.) on 26 November (that's just under three weeks away). We have a great set of talks lined up - see program and abstracts below. If you'd like to come along, please email msrcevnt@microsoft.com with your name and afilliation, preferably by 20 November. Cheers, Simon ------------------------------------------ Fun in Cambridge, 26 November 2009 12:00 Lunch: Various local options 13:00 Andreas Rossberg, "F-ing Modules" 13:30 Ondrej Rypacek, "Distributive Laws in Programming Structures" 14:00 Break 14:30 Thorsten Altenkirch, "??: Dependent Types Without the Sugar" 15:00 Robin Adams, "Canonical Logical Frameworks" 15:30 Break 16:00 Matthew Naylor, "Dynamic analysis in the Reduceron" 16:30 Thomas Schilling, "Slicing It" 17:30 Pub 18:30 Dinner ----------------------------------------------------------------------------- Andreas Rossberg F-ing Modules Andreas Rossberg, Claudio Russo, Derek Dreyer Abstract: ML modules are a powerful language mechanism for decomposing programs into reusable components. They also have a reputation for being complex, and dependent on fancy type theory that is mostly opaque to non-experts. While this reputation is certainly understandable, we aim here to demonstrate that it is undeserved. To do so, we give a very simple elaboration semantics for a full-featured, higher-order ML- like module language. Our elaboration defines the meaning of module expressions by a straightforward, compositional translation into vanilla System F (the polymorphic lambda-calculus), under plain F typing contexts. We thereby show that modules are merely a particular mode of use of System F. Our module language supports the usual second-class modules, with SML- style generative functors and local modules. To demonstrate the versatility of our approach, we further extend the language with the ability to package modules as first-class values -- an almost trivial extension, as it turns out. (Our approach also scales to handle OCaml- style applicative functor semantics, but the details are significantly more subtle, so we will not present them here.) Lastly, we report on our experience using the "locally nameless" approach in order to mechanize the soundness of our elaboration semantics in Coq. ----------------------------------------------------------------------------- Ondrej Rypacek Title: Distributive Laws in Programming Structures Abstract: Distributive laws in Computer Science are in general rules governing the transformation of one programming structure into another. In functional programming, they are parametrically polymorphic functions with a characteristic type "swapping the order of two parameterized-type constructors". Their importance has been noted but to date documented only in several isolated cases and by diverse formal approaches such as Backouhse & Hoogendijk's zips, Meertens' functor pullers or McBride's idiomatic functors. In this talk, a formal approach to distributive laws in programming structures will be presented, which discloses their simple nature, a uniform approach to elementary constructions on them and their precise relationship to similar notions elsewhere in Category Theory. Although the approach rests formally on deep results from 2-Category Theory, the presentation will be geometrical as much as possible, making use of the wonderful three dimensional nature of 2-categories. ----------------------------------------------------------------------------- Thorsten Altenkirch ??: Dependent Types Without the Sugar (Based on joint work with Nils Anders Danielsson, Andres L?h and Nicolas Oury) The recent success of languages like Agda and Coq demonstrates the potential of using dependent types for programming. These systems rely on many high level features like datatype definitions, pattern matching and implicit arguments to facilitate the use of the language. However, these features complicate the metatheoretical study and are a potential source of bugs. To address these issues we introduce ??, a dependently typed core language. It is small enough for metatheoretical study and the typechecker is small enough to be formally verified. In this language there is only one mechanism for recursion---used for types, functions and infinite objects---and an explicit mechanism to control unfolding, based on lifted types. Furthermore structural equality is used consistently for values and types; this is achieved by a new notion of ?-equality for recursive definitions. We show, by translating several high-level constructions, that ?? is suitable as a core language for dependently typed programming. We also provide a formal description of the language and its typing rules. See also: our recent paper (with the same title) http://www.cs.nott.ac.uk/~txa/publ/pisigma-new.pdf or/and download pisigma from hackage. ----------------------------------------------------------------------------- Robin Adams Title: Canonical Logical Frameworks Abstract: A canonical logical framework, or lambda-free logical framework, is a logical framework that deals only with objects in beta-normal, eta-long form. The concept has been invented independently three times over the last 15 years or so: by Aczel, with the Type Framework TF; by Watkins et al, with the Canonical Logical Framework, and by Plotkin, with DMBEL. I shall show how all these frameworks can be fitted into a hierarchy such that they extend one another conservatively. I shall also demonstrate the main selling point of canonical LFs: certain results can be proven more easily in a canonical LF, then 'lifted' - that is, the same result proven for a traditional LF as an immediate corollary. ----------------------------------------------------------------------------- Matthew Naylor Title: Dynamic analysis in the Reduceron The Reduceron is a graph-reduction machine implemented on a field-programmable gate array (FPGA). Last year, we reviewed the machine and set out to improve its runtime performance by a factor of six. If achieved, the performance of leading PC and FPGA implementations of graph-reduction would be on a par for a common class of programs --- an unusual and intriguing state of affairs for such a general-purpose processor. In this talk, I will present our progress towards this goal, beginning with an overview, and then focusing on two recently added features: update avoidance and speculative evaluation of primitive redexes. Both enjoy the accuracy and simplicity of dynamic analysis without incurring the runtime overhead that often makes static analysis perferable in a conventional setting. This talk represents joint work-in-progress with Colin Runciman. ----------------------------------------------------------------------------- Thomas Schilling Title: Slicing It Abstract: Haskell's type error messages are often not as helpful as they could be. One fundamental problem is that they blame a single location while several other locations may fix the error as well. A type error slice does not blame a single location, but a fragment of the failing program. Previous work on type error slices requires reformulating type checking as a constraint solving problem. This makes it very difficult to integrate support for type error slices into existing compilers. In this talk I present how we can overcome this limitation by requiring only a very basic interface to the type checker. From haskell at colquitt.org Fri Nov 6 16:35:49 2009 From: haskell at colquitt.org (John Dorsey) Date: Fri Nov 6 16:11:50 2009 Subject: [Haskell] ANNOUNCE: NetSNMP-0.1.6 Message-ID: <20091106213549.GB23495@colquitt.org> I'm pleased to annonce the release of NetSNMP-0.1.6, a partial (but useful) binding to the net-snmp library.[1] NetSNMP is a simple and self-contained client interface for doing basic SNMP GET, NEXT, and WALK operations. As far as I know it should work with any version of the C library (net-snmp) from version 5. This release improves threaded performance, and the management of foreign memory objects. I've been using it successfully in a threaded polling daemon which I'm running on 32-bit and 64-bit Linux systems. If you try out NetSNMP, or if you decide it doesn't meet your need, please drop me a line! Regards, John Dorsey From jfredett at gmail.com Sat Nov 7 01:04:45 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sat Nov 7 00:40:50 2009 Subject: [Haskell] Haskell Weekly News: Issue 138 - November 07, 2009 Message-ID: <4af50dfd.9653f10a.68f4.2d64@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091107 Issue 138 - November 07, 2009 --------------------------------------------------------------------------- Welcome to issue 138 of HWN, a newsletter covering developments in the [1]Haskell community. Lots of discussion about [2]Clean this week. As well there was a new DSL, feldspar, announced. It deals with digital signal processing applications. Announcements MonadRandom-0.1.4. Brent Yorgey [3]announced a new version of MonadRandom which adds applicative instances for Rand and RantT, so you can write your code in applicative style. Criterion 0.2, an improved Haskell benchmarking library. Bryan O'Sullivan [4]announced a new version of Criterion, all the details of this release are available on his [5]blog feldspar-language. Emil Axelsson [6]announced feldspar, a DSL for digital signal processing. feldspar-compiler. Emil Axelsson [7]announced the C code backend for the `feldspar` language. fdo-notify 0.1, a client for the Desktop Notifications protocol. Max Rabkin [8]announced a library for FreeDesktop.org's Desktop Notifications Protocol. language-python version 0.2 now available. Bernie Pope [9]announced a new version of the language-python package, which provides an AST and parser for Python 2.x-3.x (previously, only 3.x was supported). timeplot. Eugene Kirpichov [10]announced timeplot, which is useful visualizing log files. Singapore FP Users Group First Meeting. Max Cantor [11]announced the first meeting of the Singapore FP Users Group, it will be Monday, November 2nd at 6pm. Advgame 0.1.1. Tim Wawrzynczak [12]announced his port of Conrad Barski's 'Casting SPELs in Lisp' to Haskell. BlogLiterately-0.2. Robert Greayer [13]announced version 0.2 of BlogLiterately, a simple tool for uploading posts written in markdown and Literate Haskell to blogs. haskell-mode 2.6. Svein Ove Aas [14]announced a bugfix release of the Emac's Haskell mode. Discussion A Problem Defining a Monad instance. Petr Pudlak [15]asked about how to defined an instance of the Monad class for a monad whose argument is restricted by another typeclass. Point Free Case Expressions. Sebastiaan Visser [16]suggested that a new syntax be added for 'point-free' case expressions. Master's thesis topic sought. Matus Tejiscak [17]asked for suggestions for possible Master's Thesis topics. What's the deal with Clean? Deniz Dogan [18]asked about the recent discussion on the -cafe list about Clean, another Pure, Lazy, Strictly Typed language. 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! * Neil Brown: [21]Text.Printf and monad transformers. * Bryan O'Sullivan: [22]Criterion 0.2, an improved Haskell benchmarking library. * Galois, Inc: [23]Tech Talk: Hoare-Logic â fiddly details and small print. * Gtk2HS: [24]Writing concurrent programs.. * Tom Schrijvers: [25]Postdoc/PhD Positions on the Monadic Constraint Programming project. * Darcs: [26]darcs weekly news #45. * Tom Schrijvers: [27]Haskell Type Constraints unleashed. * Luke Plant: [28]Building GHC is fun.... * Manuel M T Chakravarty: [29]Status Update of the Glasgow Haskell Compiler, October 2009. * Chris Smith: [30]Monads from Two Perspectives. * Neil Brown: [31]Concurrent Testing and Tracing: Useful Output for Test Failures. * Dan Piponi (sigfpe): [32]Buffon's Needle, the Easy Way. Buffon's needle is a popular probability problem. Rule lines on the floor a distance d apart and toss a needle of length l Quotes of the Week * blackdog: [About Hubris] I tell the Ruby guys that Haskell will help them speed up their Ruby code and keep their apps going, and I tell Haskell guys that it'll Trojan Horse those poor unsuspecting rubyists... * lispy: Great, I leave the channel for a few hours and suddenly Haskell has a new found work ethic. * roconnor: ivanm: I will keep the fail in the code * lament: just remember to ask, 'What are your questions', as opposed to 'Do you have any questions' * mauke: @unpl const (flip const) lambdabot: (\ _ c d -> d) About the Haskell Weekly News New editions are posted to [33]the Haskell mailing list as well as to [34]the Haskell Sequence and [35]Planet Haskell. [36]RSS is also available, and headlines appear on [37]haskell.org. To help create new editions of this newsletter, please see the information on [38]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [39]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://en.wikipedia.org/wiki/Clean_(programming_language) 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65844 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65813 5. http://www.serpentine.com/blog/2009/11/06/criterion-0-2-an-improved-haskell-benchmarking-library/ 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65617 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65741 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65686 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65656 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65575 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65471 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65462 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65567 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65487 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65834 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65750 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65706 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65589 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://chplib.wordpress.com/2009/11/06/text-printf-and-monad-transformers/ 22. http://www.serpentine.com/blog/2009/11/06/criterion-0-2-an-improved-haskell-benchmarking-library/ 23. http://www.galois.com/blog/2009/11/04/chapman-hoare/ 24. http://haskell.org/gtk2hs/archives/2009/11/04/writing-concurrent-programs/ 25. http://tomschrijvers.blogspot.com/2009/11/postdocphd-positions-on-monadic.html 26. http://blog.darcs.net/2009/11/darcs-weekly-news-45.html 27. http://tomschrijvers.blogspot.com/2009/11/haskell-type-constraints-unleashed.html 28. http://lukeplant.me.uk/blog.php?id=1107301703 29. http://justtesting.org/post/232566357 30. http://cdsmith.wordpress.com/2009/11/02/monads-from-two-perspectives/ 31. http://chplib.wordpress.com/2009/11/02/concurrent-testing-and-tracing-useful-output-for-test-failures/ 32. http://blog.sigfpe.com/2009/10/buffons-needle-easy-way.html 33. http://www.haskell.org/mailman/listinfo/haskell 34. http://sequence.complete.org/ 35. http://planet.haskell.org/ 36. http://sequence.complete.org/node/feed 37. http://haskell.org/ 38. http://haskell.org/haskellwiki/HWN 39. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From petersen at haskell.org Sat Nov 7 20:05:12 2009 From: petersen at haskell.org (Jens Petersen) Date: Sat Nov 7 19:41:10 2009 Subject: [Haskell] ANNOUNCE: qtHaskell-1.1.3 In-Reply-To: References: Message-ID: <9436bffe0911071705o524113fh30ec12b641cb3943@mail.gmail.com> 2009/10/22 David Harley : > A new release of qtHaskell (version 1.1.3) is available at > http://qthaskell.berlios.de Thank you If I parsed right this is for qt3 - any plans for qt4? :-) Jens From petersen at haskell.org Sun Nov 8 08:12:00 2009 From: petersen at haskell.org (Jens Petersen) Date: Sun Nov 8 07:47:56 2009 Subject: [Haskell] ANNOUNCE: qtHaskell-1.1.3 In-Reply-To: References: <9436bffe0911071705o524113fh30ec12b641cb3943@mail.gmail.com> Message-ID: <9436bffe0911080512q3f96c915s94be19f6ae8afc21@mail.gmail.com> >> If I parsed right this is for qt3 - any plans for qt4? :-) > > actually the version number of qtHaskell has nothing to do with the version > of Qt it works with. QtHaskell has always worked with Qt version 4 (and > never with Qt version 3). See the UserGuide for details. > > With Best Wishes from > David Harley Thank you - guess I was getting confused with the references to qmake: today ./build seems to work just fine for me on Fedore 12-prerelease. From icfp.publicity at googlemail.com Tue Nov 10 16:22:52 2009 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue Nov 10 15:58:42 2009 Subject: [Haskell] ICFP 2010: Call for papers Message-ID: <53ff55480911101322g37f6358aj4e12a27519ab3168@mail.gmail.com> ===================================================================== Call for Papers ICFP 2010: International Conference on Functional Programming Baltimore, Maryland, 27 -- 29 September 2010 http://www.icfpconference.org/icfp2010 ===================================================================== Important Dates (at 14:00 UTC) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Submission: 2 April 2010 Author response: 24 -- 25 May 2010 Notification: 7 June 2010 Final papers due: 12 July 2010 Scope ~~~~~ ICFP 2010 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects or concurrency. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to object-oriented or logic programming; interoperability * Implementation: abstract machines; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proof * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming The conference also solicits Experience Reports, which are short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ By 2 April 2010, 14:00 UTC, submit an abstract of at most 300 words and a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadline will be strictly enforced and papers exceeding the page limits will be summarily rejected. Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. A submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LATEX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm. Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on 24 May 2010, to read and respond to reviews. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2010. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Organization ~~~~~~~~~~~~ Conference Chair Paul Hudak, Yale University Program Chair Stephanie Weirich, University of Pennsylvania Program Committee: Umut Acar, Max Planck Institute for Software Systems Zena Ariola, University of Oregon James Cheney, University of Edinburgh Peter Dybjer, Chalmers University of Technology Robert Bruce Findler, Northwestern University Andy Gill, Kansas University Fritz Henglein, University of Copenhagen Michael Hicks, University of Maryland, College Park Patricia Johann, University of Strathclyde Andres L?h, Utrecht University Simon L. Peyton Jones, Microsoft Research Didier R?my, INRIA Paris-Rocquencourt John Reppy, University of Chicago Manuel Serrano, INRIA Sophia-Antipolis Matthieu Sozeau, Harvard University From hectorg87 at gmail.com Wed Nov 11 17:48:10 2009 From: hectorg87 at gmail.com (Hector Guilarte) Date: Wed Nov 11 17:25:05 2009 Subject: [Haskell] Tabla de calculo de dolares viajero CADIVI In-Reply-To: References: <5B72DF7006066246958A68F83D29AF1A301121@mail.iesa.edu.ve> Message-ID: <69630b260911111448tce51ef0r51c87f0719c6588a@mail.gmail.com> Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: image/jpeg Size: 103427 bytes Desc: not available Url : http://www.haskell.org/pipermail/haskell/attachments/20091111/ad4a9bdc/attachment-0001.jpe From jmillikin at gmail.com Wed Nov 11 23:57:43 2009 From: jmillikin at gmail.com (John Millikin) Date: Wed Nov 11 23:33:34 2009 Subject: [Haskell] ANNOUNCE: dbus-core 0.6 and dbus-client 0.2 Message-ID: <3283f7fe0911112057r7f18567bk536627046b6865ca@mail.gmail.com> This is the second public release of my D-Bus implementation. dbus-core is an implementation of the D-Bus protocol, and dbus-client is a set of wrappers and utility computations to simplify writing basic clients. Interesting changes to dbus-core ================================ * Performance improvements: sending and receiving large structures should now be significantly faster. My thanks and appreciation go to Bryan O'Sullivan, whose excellent Criterion library made benchmarking the serialisation code much easier than it had any right to be. * Better support for byte arrays: byte strings (strict and lazy) are now directly supported types, with special cases to avoid most conversion overhead. * Implemented the TCP/IP transport, though it's untested because I can't figure out how to make the server listen on a socket. If anybody cares about remote D-Bus, and this doesn't work, drop me a mail with your configuration and I'll find out why. * Added module to represent "match rules", required for full signal support. * Added module for name reservations -- this is really just moving the bulk of the code from dbus-client into dbus-core, where it belongs. * Fixed possible concurrency issue when receiving messages from a connection in multiple threads. This is still a really bad idea, and it will never work correctly, but at least now it won't corrupt the connection state. Interesting changes to dbus-client ================================== * Fixed dumb signature to mkClient (thanks, Max). Its purpose should now be more obvious. * Shifted around some of the method call APIs -- it's now possible to send method calls without a proxy. * Uses the new MatchRule work to fully support receiving signals. Documentation ============= PDFs of the source; these are the most useful and complete documentation currently available: https://dl.dropbox.com/u/1947532/dbus-core_0.6.pdf https://dl.dropbox.com/u/1947532/dbus-client_0.2.pdf An API listing is also available, good for a quick overview: https://dl.dropbox.com/u/1947532/dbus-core_0.6/index.html https://dl.dropbox.com/u/1947532/dbus-client_0.2/index.html Hackage is currently experiencing some dependency conflicts with the "bytestring" library[1], so it's not generating its own documentation. I'll keep the dropbox pages up until Hackage is in a more usable state. Downloads ========= Available from the usual places: http://hackage.haskell.org/packages/archive/dbus-core/0.6/dbus-core-0.6.tar.gz http://hackage.haskell.org/packages/archive/dbus-client/0.2/dbus-client-0.2.tar.gz [1] "binary" uses bytestring-0.9.1.4, "text" uses bytestring-0.9.1.5, kaboom From pirelo at googlemail.com Fri Nov 13 06:39:42 2009 From: pirelo at googlemail.com (Pablo Nogueira) Date: Fri Nov 13 06:15:29 2009 Subject: [Haskell] Final CFP: WFLP 2010. Deadlines extended: Abstract due Nov 18; Full paper due Nov 25 (LNCS) Message-ID: [Deadlines extended: Abstract due Nov 18; Full paper due Nov 25] ******************************************************************** Final Call For Papers 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Abstract Submission: November 18, 2009 **extended** Full Paper Submission: November 25, 2009 **extended** Acceptance Notification: December 20, 2009 Preliminary Proceedings: January 7, 2010 Workshop: January 17, 2010 SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. The previous WFLP editions are: WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). LOCATION WFLP 2010 will be held on January 17, 2010 in Madrid, Spain, colocated with the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010). WFLP 2010 solicits papers in all areas of functional and (constraint) logic programming, including but not limited to: * Foundations: formal semantics, logic variables, binding and abstract syntax, rewriting and narrowing, unification, constraint solving, dynamics, type theory, meta-theory, effects, etc. * Language Design: security, services, modules, type systems, multi-paradigm languages, concurrency and distribution, objects, libraries, generic programming, interoperability, etc. * Implementation: abstract machines, parallelism, compile-time and run-time optimizations, foreign-language interfaces, memory management, multi-threading, exploiting parallel hardware, etc. * Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, program calculation, program proof, meta-programming, generative programming, etc. * Software Development: algorithms, data structures, design patterns, components and composition, specification, proof assistants, verification and validation, model checking, debugging, testing, profiling, tracing, etc. * Paradigm Integration: integration of declarative programming with other paradigms or features such as imperative, object-oriented, aspect-oriented, concurrent, real-time programming, event-driven architectures, etc. * Applications: education, industry, commercial uses, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, XML processing, artificial intelligence, knowledge representation and machine learning, deductive databases, advanced programming environments and tools, etc. SUBMISSIONS and PROCEEDINGS Authors are invited to submit papers presenting original unpublished work. Papers must be at most 15 pages long. Exceptionally, authors may surpass the page limit by providing well-marked appendices intended as reviewing aids. Appendices will not appear in the final publication. Submission categories include regular research papers, system descriptions, and short papers describing on-going work (at most 8 pages). Submissions must be formatted in Lecture Notes in Computer Science (LNCS) style. This requirement needs not apply to appendices. Papers should be submitted in pdf format electronically via the web-based submission site http://www.easychair.org/conferences/?conf=wflp2010 Preliminary proceedings will be available at the workshop. Selected authors will be invited to submit a full version of their papers after the workshop. Contributions accepted for the post-workshop proceedings will be published in Springer's Lecture Notes in Computer Science series. INVITED SPEAKER Mariangiola Dezani (University of Torino, Italy) PROGRAM CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAM COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Bernd Brassel (CAU Kiel, Germany) Olaf Chitil (Univ. of Kent, UK) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (Univ. of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada) -------------- next part -------------- [Deadlines extended: Abstract due Nov 18; Full paper due Nov 25] ******************************************************************** Final Call For Papers 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Abstract Submission: November 18, 2009 **extended** Full Paper Submission: November 25, 2009 **extended** Acceptance Notification: December 20, 2009 Preliminary Proceedings: January 7, 2010 Workshop: January 17, 2010 SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. The previous WFLP editions are: WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). LOCATION WFLP 2010 will be held on January 17, 2010 in Madrid, Spain, colocated with the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010). WFLP 2010 solicits papers in all areas of functional and (constraint) logic programming, including but not limited to: * Foundations: formal semantics, logic variables, binding and abstract syntax, rewriting and narrowing, unification, constraint solving, dynamics, type theory, meta-theory, effects, etc. * Language Design: security, services, modules, type systems, multi-paradigm languages, concurrency and distribution, objects, libraries, generic programming, interoperability, etc. * Implementation: abstract machines, parallelism, compile-time and run-time optimizations, foreign-language interfaces, memory management, multi-threading, exploiting parallel hardware, etc. * Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, program calculation, program proof, meta-programming, generative programming, etc. * Software Development: algorithms, data structures, design patterns, components and composition, specification, proof assistants, verification and validation, model checking, debugging, testing, profiling, tracing, etc. * Paradigm Integration: integration of declarative programming with other paradigms or features such as imperative, object-oriented, aspect-oriented, concurrent, real-time programming, event-driven architectures, etc. * Applications: education, industry, commercial uses, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, XML processing, artificial intelligence, knowledge representation and machine learning, deductive databases, advanced programming environments and tools, etc. SUBMISSIONS and PROCEEDINGS Authors are invited to submit papers presenting original unpublished work. Papers must be at most 15 pages long. Exceptionally, authors may surpass the page limit by providing well-marked appendices intended as reviewing aids. Appendices will not appear in the final publication. Submission categories include regular research papers, system descriptions, and short papers describing on-going work (at most 8 pages). Submissions must be formatted in Lecture Notes in Computer Science (LNCS) style. This requirement needs not apply to appendices. Papers should be submitted in pdf format electronically via the web-based submission site http://www.easychair.org/conferences/?conf=wflp2010 Preliminary proceedings will be available at the workshop. Selected authors will be invited to submit a full version of their papers after the workshop. Contributions accepted for the post-workshop proceedings will be published in Springer's Lecture Notes in Computer Science series. INVITED SPEAKER Mariangiola Dezani (University of Torino, Italy) PROGRAM CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAM COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Bernd Brassel (CAU Kiel, Germany) Olaf Chitil (Univ. of Kent, UK) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (Univ. of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada) From jfredett at gmail.com Sat Nov 14 01:31:27 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sat Nov 14 01:07:08 2009 Subject: [Haskell] Haskell Weekly News: Issue 139 - November 14, 2009 Message-ID: <4afe4ebf.9553f10a.3358.1fb0@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091114 Issue 139 - November 14, 2009 --------------------------------------------------------------------------- Welcome to issue 139 of HWN, a newsletter covering developments in the [1]Haskell community. Lots of good discussion this week about everything from Monoids to Memory Leaks, Parsers (for Token Streams) and pushing Haskell onto Medical devices! I could go on some long rant rife with really righteous alliteration or a touch of timely consonance, but instead I'll leave you all, my fellow Haskellers, to read your Haskell Weekly News! Announcements Two Open PhD positions at the Technical University Munich. Axel Simon [2]announced two PhD positions are open in Low-level and High-level analysis, see the post for details. (ED: Apologies for being so late in this announcment, it slipped under my radar! ) Final CFP: WFLP 2010. Deadlines extended: Abstract due Nov 18; Full paper due Nov 25 (LNCS). Pablo Nogueira [3]announced a deadline extension for the WLFP 2010 conference, abstracts are now due November 18, and full papers by the 25th. hesql. Christoph Bauer [4]announced hesql, a preprocessor for writing SQL statements in pure haskell. dbus-core 0.6 and dbus-client 0.2. John Millikin [5]announced the second release of his dbus libraries. Changes include performance improvments, better support for byte arrays, and TCP/IP transport (though this remains untested). simple-observer-0.0.1, a simple implementation of the observer design pattern. Andy Gimblett [6]announced an implementation of the Observer pattern in Haskell ICFP 2010: Call for papers. Wouter Swierstra [7]announced a call for papers for ICFP 2010. Calling all Haskellers in Huntsville, Alabama, or surrounding areas! Jake McArthur [8]announced the formation of a new Haskell User Group in Alabama. (ED: Apparently, Shae is the Johnny Appleseed for the Haskell Community, #haskell, BAHUG, now AHUG... when will it end? ) acme-dont. Gracjan Polak [9]announced the acme-dont package, providing a vital missed feature to our language -- a don't monad. See the post for all the revolutionary details. Discussion Could someone teach me why we use Data.Monoid? Magicloud Magiclouds [10]1fa7 gmane.comp.lang.haskell.cafe/66223 asked why we use monoids so much in Haskell. Least common supertype. Sean Leather [11]posed an interesting question about 'antiunification' -- finding a common supertype of two types which is 'most-constrained'. Long running Haskell program. David Leimbach [12]asked about managing memory leaks in long running programs. Parsec - separating Parsing from Lexing. Fernando Henrique Sanches [13]asked about using Parsec to parse a Token Stream. Help Haskell driving Medical Instruments. Philippos Apolinarius [14]talked about using Haskell to drive medical instruments. Blog noise [15]Haskell news from the [16]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Brown: [17]The Observer Pattern using a Broadcast Channel. * Martijn van Steenbergen: [18]GADTs in Haskell 98. * Mikael Vejdemo Johansson (Syzygy-): [19][MATH198] Multiple lectures posted. * Andy Gill: [20]LAMBDA this week â ChalkBoard. * London Haskell Users Group: [21]Functional Programming Exchange. * Neil Brown: [22]The Observer Pattern using a Message-Passing Process. * Luke Plant: [23]Is static type checking a redundant testing mechanism?. * Twan van Laarhoven: [24]Four ways to fold an array. * Martin Sulzmann: [25]Tag-free Combinators for Binding-Time Polymorphic Program Generation. * Luke Palmer: [26]Collision Detection with Enneatrees. * Dan Piponi (sigfpe): [27]Memoizing Polymorphic Functions with High School Algebra and Quantifiers. * Luke Plant: [28]Haskell blog software. Quotes of the Week * c2.com: If you can program anything in HappS you actually already learned Haskell * Cale: Chew new Lasty ST Gum! It lasts until _|_! * danderson: [using unsafeFreeze for an ST action] that sounds like a way to shoot myself in the foot with high efficiency, given my knowledge of haskell. * BONUS: C++ is saner than something? imo C++ is like the guy that goes around shouting "I am napoleon!!!" * kmc:: (): worst monoid ever * DanWeston: Bottom has only one value, not two. Otherwise bottom would have been called buttocks. About the Haskell Weekly News New editions are posted to [29]the Haskell mailing list as well as to [30]the Haskell Sequence and [31]Planet Haskell. [32]RSS is also available, and headlines appear on [33]haskell.org. To help create new editions of this newsletter, please see the information on [34]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [35]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://www.mail-archive.com/haskell@haskell.org/msg22432.html 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66215 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66184 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66110 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66103 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66021 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66018 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/65958 10. http://thread.gmane.org/ 11. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66080 12. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66056 13. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66012 14. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/65996 15. http://planet.haskell.org/ 16. http://haskell.org/haskellwiki/Blog_articles 17. http://chplib.wordpress.com/2009/11/12/the-observer-pattern-using-a-broadcast-channel/ 18. http://martijn.van.steenbergen.nl/journal/2009/11/12/gadts-in-haskell-98/ 19. http://blog.mikael.johanssons.org/archive/2009/11/math198-multiple-lectures-posted/ 20. http://www.ittc.ku.edu/csdlblog/?p=16 21. http://www.londonhug.net/2009/11/10/functional-programming-exchange/ 22. http://chplib.wordpress.com/2009/11/10/the-observer-pattern-using-a-message-passing-process/ 23. http://lukeplant.me.uk/blog/posts/is-static-type-checking-a-redundant-testing-mechanism/ 24. http://twan.home.fmf.nl/blog/haskell/four-ways-to-fold.details 25. http://sulzmann.blogspot.com/2009/11/tag-free-combinators-for-binding-time.html 26. http://lukepalmer.wordpress.com/2009/11/08/collision-detection-with-enneatrees/ 27. http://blog.sigfpe.com/2009/11/memoizing-polymorphic-functions-with.html 28. http://lukeplant.me.uk/blog/posts/haskell-blog-software/ 29. http://www.haskell.org/mailman/listinfo/haskell 30. http://sequence.complete.org/ 31. http://planet.haskell.org/ 32. http://sequence.complete.org/node/feed 33. http://haskell.org/ 34. http://haskell.org/haskellwiki/HWN 35. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From duncan at well-typed.com Mon Nov 16 11:20:42 2009 From: duncan at well-typed.com (Duncan Coutts) Date: Mon Nov 16 10:56:20 2009 Subject: [Haskell] ANNOUNCE: New Industrial Haskell Group membership options Message-ID: <1258388442.4896.3546.camel@localhost> The Industrial Haskell Group (IHG) is an organisation to support the needs of commercial users of the Haskell programming language. The second round of the IHG's collaborative development scheme will be running for 6 months from January. We are now inviting additional companies to take part. This scheme is ideal for companies that make significant use of Haskell and wish to fund specific projects. Additionally, there are new associate and academic membership options. These enable companies and academic groups to support the general health of the Haskell development platform, but with a lower financial commitment. For more details on all of the above, please see http://industry.haskell.org/ If your company or group is interested in joining then please e-mail info@industry.haskell.org -- Duncan Coutts, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/ From jmillikin at gmail.com Mon Nov 16 21:38:42 2009 From: jmillikin at gmail.com (John Millikin) Date: Mon Nov 16 21:14:16 2009 Subject: [Haskell] ANNOUNCE: gnome-keyring 0.1 (bindings to libgnome-keyring) Message-ID: <3283f7fe0911161838s2c6d0485l4dc08f494f505a8d@mail.gmail.com> The GNOME Keyring is a service for securely storing per-user secret information, such as passwords and encryption keys, on the GNOME desktop. This library is a binding to the libgnome-keyring C library. The API is still a bit too slave-ish to the original for my taste, some modules will be changing/merging in the next version. The innards are an absolute horror -- don't look too close if you're one of those people who faint at rampant unsafe casting. That said, it works surprisingly well for a first-release FFI binding -- mostly due to the excellent design of libgnome-keyring and c2hs. So if any Linux/BSD/OpenSolaris/etc users have needed secure password storage in Haskell, please try it out and let me know if you encounter any problems. Download: http://hackage.haskell.org/package/gnome-keyring/ API docs (copy of original library docs): https://dl.dropbox.com/u/1947532/gnome-keyring_0.1/index.html From conor at strictlypositive.org Tue Nov 17 05:14:54 2009 From: conor at strictlypositive.org (Conor McBride) Date: Tue Nov 17 04:51:22 2009 Subject: [Haskell] Scottish Category Theory Seminar Message-ID: ******************************************************************** *** Scottish Category Theory Seminar *** First Meeting *** Friday 27 November 2009, 2pm *** University of Glasgow, Scotland ******************************************************************** Dear All, We are pleased to announce the first meeting of the Scottish Category Theory Seminar which will be a forum for discussion of all aspects of category they, be they straight category theory or applications to computer science or physics etc. We envisage meeting for an afternoon once every few months, at some congenial location in Scotland. Talks by Scots and by visitors are welcome. Please contact us if you would like to host a meeting or give a talk. Meetings are open, and all are welcome to attend. The first meeting will take on Friday 27 November at the University of Glasgow at 2pm. At the first meeting, we are pleased to announce the following invited speakers * Martin Hyland, Universty of Cambridge * Nicola Gambino, University of Palermo * Alexander Kurz, University of Leicester * Willem Bernard Heijltjes, University of Edinburgh This meeting will receive financial support from the Complex Systems Engineering theme of SICSA, the Scottish Informatics and Computer Science Alliance and from the Department of Mathematics at the University of Glasgow. More details can be found at http://personal.cis.strath.ac.uk/~ng/sct.html If you wish to attend, or want more information about the Scottish Category Theory Seminar, please email scotcats@cis.strath.ac.uk Neil Ghani Tom Leinster Alex Simpson From g9ks157k at acme.softbase.org Tue Nov 17 10:15:01 2009 From: g9ks157k at acme.softbase.org (Wolfgang Jeltsch) Date: Tue Nov 17 09:50:31 2009 Subject: [Haskell] job at the University of Technology in Cottbus Message-ID: <200911171615.02108.g9ks157k@acme.softbase.org> Hello, the Programming Languages and Compiler Construction Group at the University of Technology in Cottbus, Germany is seeking for a research and teaching assistent. Our focus is on declarative programming languages, so people with a strong background in functional programming might be especially interested in this position. The full announcement (in German) is at . Best wishes, Wolfgang From icfp.publicity at googlemail.com Wed Nov 18 06:14:26 2009 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Wed Nov 18 05:49:52 2009 Subject: [Haskell] ICFP '10: Second call for workshop proposals Message-ID: <53ff55480911180314o945ec09s339891eab34014c5@mail.gmail.com> CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2010 15th ACM SIGPLAN International Conference on Functional Programming September 27 - 29, 2010 Baltimore, Maryland http://www.icfpconference.org/icfp2010 The 15th ACM SIGPLAN International Conference on Functional Programming will be held in Baltimore, Maryland on September 27-29, 2010. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2010 and sponsored by SIGPLAN. These events should be more informal and focused than ICFP itself, include sessions that enable interaction among the attendees, and be fairly low-cost. The preference is for one-day events, but other schedules can also be considered. ---------------------------------------------------------------------- Submission details Deadline for submission: November 20, 2009 Notification of acceptance: December 18, 2009 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2010 workshop co-chairs (Derek Dreyer and Chris Stone), via email to icfp10-workshops at mpi-sws.org by November 20, 2009. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 18, 2009, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2010/icfp10-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2010 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Derek Dreyer (MPI-SWS) Workshop Co-Chair: Chris Stone (Harvey Mudd College) General Chair: Paul Hudak (Yale University) Program Chair: Stephanie Weirich (University of Pennsylvania) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Derek Dreyer and Chris Stone), via email to icfp10-workshops at mpi-sws.org. From simonmar at microsoft.com Wed Nov 18 09:49:53 2009 From: simonmar at microsoft.com (Simon Marlow) Date: Wed Nov 18 09:25:20 2009 Subject: [Haskell] Reminder: Fun in the afternoon, MSR Cambridge, 26 Nov Message-ID: <472265593EF643479DF319711BD8F6CC03D5F7@DB3EX14MBXC313.europe.corp.microsoft.com> One final reminder: Fun in the Afternoon is being held at MSR Cambridge on 26 November (a week on Thursday). Details are on the web http://sneezy.cs.nott.ac.uk/fun/ If you want to come and haven't signed up yet, please email msrcevnt@microsoft.com with your name and affiliation. Directions can be found here: http://research.microsoft.com/en-us/labs/cambridge/visit.aspx Parking is available: please use the car park at the rear of the building. Feel free to turn up any time from 12 onwards, there are various options for getting lunch locally, and there is space to hang out near the lecture room until we start at 1pm. Cheers, Simon From voigt at tcs.inf.tu-dresden.de Wed Nov 18 12:27:05 2009 From: voigt at tcs.inf.tu-dresden.de (voigt@tcs.inf.tu-dresden.de) Date: Wed Nov 18 12:02:30 2009 Subject: [Haskell] Call for Participation - PEPM'10 (co-located with POPL'10) Message-ID: <0877e5ba779077dbb2cd5a05e8b140a5.squirrel@mail.tcs.inf.tu-dresden.de> =============================================================== CALL FOR PARTICIPATION 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 =============================================================== Abstracts of all papers and presentations are available from the above web site. INVITED TALKS: * Lennart Augustsson (Standard Chartered Bank, UK) Title: O, Partial Evaluator, Where Art Thou? * Jeremy Siek (University of Colorado at Boulder, USA) Title: General Purpose Languages Should be Metalanguages. CONTRIBUTED TALKS: * Nabil el Boustani and Jurriaan Hage. Corrective Hints for Type Incorrect Generic Java Programs. * Johannes Rudolph and Peter Thiemann. Mnemonics: Type-safe Bytecode Generation at Run Time. * Elvira Albert, Miguel Gomez-Zamalloa and German Puebla. PET: A Partial Evaluation-based Test Case Generation Tool for Java Bytecode. * Martin Hofmann. Igor2 - an Analytical Inductive Functional Programming System. * Jos? Pedro Magalh?es, Stefan Holdermans, Johan Jeuring and Andres L?h. Optimizing Generics Is Easy! * Michele Baggi, Mar?a Alpuente, Demis Ballis and Moreno Falaschi. A Fold/Unfold Transformation Framework for Rewrite Theories extended to CCT. * Hugh Anderson and Siau-Cheng KHOO. Regular Approximation and Bounded Domains for Size-Change Termination. * ?velyne Contejean, Pierre Courtieu, Julien Forest, Andrei Paskevich, Olivier Pons and Xavier Urbain. A3PAT, an Approach for Certified Automated Termination Proofs. * Fritz Henglein. Optimizing Relational Algebra Operations Using Generic Equivalence Discriminators and Lazy Products. * Adrian Riesco and Juan Rodriguez-Hortala. Programming with Singular and Plural Non-deterministic Functions. * Martin Hofmann and Emanuel Kitzelmann. I/O Guided Detection of List Catamorphisms. * Andrew Moss and Dan Page. Bridging the Gap Between Symbolic and Efficient AES Implementations. * Christopher Brown and Simon Thompson. Clone Detection and Elimination for Haskell. * Stefan Holdermans and Jurriaan Hage. Making Stricterness More Relevant. * Arun Lakhotia, Davidson Boccardo, Anshuman Singh and Aleardo Manacero J?nior. Context-Sensitive Analysis of Obfuscated x86 Executables. * Xin Li and Mizuhito Ogawa. Conditional Weighted Pushdown Systems and Applications. * Ivan Lazar Miljenovic. The SourceGraph Program. * Florian Haftmann. From Higher-Order Logic to Haskell: There and Back Again. SPECIAL FEATURE: * Andy Gill, Garrin Kimmell and Kevin Matlage. Capturing Functions and Catching Satellites. IMPORTANT DATES: * Early registration deadline: December 22, 2009 * Hotel registration deadline: December 28, 2009 From petersen at haskell.org Thu Nov 19 08:54:45 2009 From: petersen at haskell.org (Jens Petersen) Date: Thu Nov 19 08:30:08 2009 Subject: [Haskell] ANNOUNCE: qtHaskell-1.1.3 In-Reply-To: <9436bffe0911080512q3f96c915s94be19f6ae8afc21@mail.gmail.com> References: <9436bffe0911071705o524113fh30ec12b641cb3943@mail.gmail.com> <9436bffe0911080512q3f96c915s94be19f6ae8afc21@mail.gmail.com> Message-ID: <9436bffe0911190554k2989a90dmbb757c82580c8b5a@mail.gmail.com> Hi again David, > Thank you - guess I was getting confused with > the references to qmake: today ./build seems to > work just fine for me on Fedore A few more questions and thank you for qthaskell!! :-) - any plans to cleanup the buildsystem? (requiring sudo to complete building is a bit of a no-no) - Any idea how much ram is needed to build on Linux? I thought I built it once but the other night i left bin/hbuild running over night and it was still swapping/running at [399 of 640] Compiling Qtc.Gui.QListWidget ( Qtc/Gui/QListWidget.hs, dist/build/Qtc/Gui/QListWidget.o ) the next morning - (this humble 32bit P4 only has 1.5GB of ram - I'll try another bigger box later). Thanks, Jens ps I would to package it up for fedora. :) From jmillikin at gmail.com Thu Nov 19 21:49:30 2009 From: jmillikin at gmail.com (John Millikin) Date: Thu Nov 19 21:25:01 2009 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: gnome-keyring 0.1 (bindings to libgnome-keyring) In-Reply-To: References: <3283f7fe0911161838s2c6d0485l4dc08f494f505a8d@mail.gmail.com> Message-ID: <3283f7fe0911191849q7ad884aap876458e56e0f376@mail.gmail.com> For those interested, I've just released 0.2 -- no new features, but it's got a slightly cleaner API. Fewer modules, proper datetime types, and a few more documentation entries. And the innards are sane now. https://dl.dropbox.com/u/1947532/gnome-keyring_0.2/index.html http://hackage.haskell.org/package/gnome-keyring From tfpc at cs.ou.edu Thu Nov 19 22:44:18 2009 From: tfpc at cs.ou.edu (TFP 2010) Date: Thu Nov 19 22:19:37 2009 Subject: [Haskell] TFP 2010 - Call for Papers Message-ID: TFP 2010: 11th SYMPOSIUM ON TRENDS IN FUNCTIONAL PROGRAMMING May 17-19, 2010 University of Oklahoma http://www.cs.ou.edu/tfp2010/ The Program Committee for TFP 2010 seeks papers on trends in functional programming. The symposium is an international forum for researchers with interests in all aspects of functional programming. It embraces a broad view of current and future trends in functional programming and aspires to be a lively environment for presenting the latest research results. TFP considers both full papers and extended abstracts for presentation at the symposium. A formal refereeing process after the symposium selects the best presentations for publication in a high-profile volume. IMPORTANT DATES ??? * Apr 2: Submission of papers and abstracts ??? * Apr 14: Notification of acceptance ??? * May 7: Camera-ready, full papers for draft proceedings ??? * May 17-19: TFP Symposium SCOPE OF THE SYMPOSIUM Articles must be original and not submitted to any other forum for publication. They may consider any aspect of functional programming. Theory, implementation, experience, applications, and the use of functional programming methods in other languages all lie within the scope of the symposium. Articles may fall in any of the following categories: ??? * Research: leading-edge, previously unpublished research ??? * Position: advocating or critiquing new trends ??? * Project: descriptions of new or recently initiated projects ??? * Evaluation: lessons drawn from completed projects ??? * Overview: summaries of trendy work A list of suggested topics and other details concerning submissions can be found on the symposium website: http://www.cs.ou.edu/tfp2010/call.html#topics The suggested topics are extensive but by no means exhaustive. Please contact the program chair, Rex Page, tfp2010@cs.ou.edu, if you are in doubt about whether your topic is within the TFP scope. BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research conducted by students, acknowledging that students commonly develop new subject trends. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Full papers (up to 15 pages) and extended abstracts (3 to 6 pages, to be expanded to full papers if accepted) submitted for presentation at the symposium are screened by the program committee. A draft proceedings available at the conference will contain all accepted papers and all accepted abstracts that have been expanded to full papers. Each submission must declare its category (research, position, project, evaluation, or overview). Authors who are students should so indicate when they submit their article. The Program Committee will provide extra feedback for student papers to help compensate for differences between students and other researchers in experience with the publication process. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the draft symposium proceedings, we intend to continue the TFP tradition of publishing a high-quality volume containing the best papers from the symposium. All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards, and the best papers will be selected for publication. Papers will be judged on their contributions with appropriate criteria applied to each category of paper. Rex Page, University of Oklahoma, Program Chair Vikt?ria Zs?k and Zolt?n Horvath, E?tv?s Lor?nd University, Symposium Co-Chairs Program Committee Peter Achten, Radboud University Nijmegen, NL Emil Axelsson, Chalmers University of Technology, SE Francesco Cesarini, Erlang Training and Consulting Ltd, UK John Clements, California Polytechnic State University, USA Daniel Cooke, Texas Tech University, USA Nils Anders Danielsson, University of Nottingham, UK Jared Davis, Centaur Technology, USA Martin Erwig, Oregon State University, USA Ruben Gamboa, University of Wyoming, USA Jurriaan Hage, Utrecht University, NL Kevin Hammond, University of St Andrews, UK Michael Hanus, Christian Albrechts University zu Kiel, DE Zolt?n Horvath, E?tv?s Lor?nd University, HU Garrin Kimmell, University of Kansas, USA Pieter Koopman, Radboud University Nijmegen, NL Hans-Wolfgang Loidl, Ludwig Maximilians University M?nchen, DE Rita Loogen, Philipps University Marburg, DE Jay McCarthy, Brigham Young University, USA Greg Michaelson, Heriot-Watt University, UK Marco T. Moraz?n, Seton Hall University, USA Rodney Oldehoeft, Krell Institute, USA Walid Taha, Rice University, USA Sam Tobin-Hochstadt, Northeastern University, USA Simon Thompson, University of Kent, UK Phil Trinder, Heriot-Watt University, UK Marko van Eekelen, Radboud University Nijmegen, NL Vikt?ria Zs?k, E?tv?s Lor?nd University, HU SPONSORS The University of Oklahoma Erlang Training and Consulting From voigt at tcs.inf.tu-dresden.de Fri Nov 20 07:17:59 2009 From: voigt at tcs.inf.tu-dresden.de (voigt@tcs.inf.tu-dresden.de) Date: Fri Nov 20 06:53:19 2009 Subject: [Haskell] ANNOUNCE: Haskell Communities and Activities Report (17th ed., November 2009) Message-ID: On behalf of the many, many contributors, I am pleased to announce that the Haskell Communities and Activities Report (17th edition, November 2009) http://www.haskell.org/communities/ is now available from the Haskell Communities home page in PDF and HTML formats. Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. I hope you will find it as interesting a read as I did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline ;-) to the call. The editor collects all the contributions into a single report and feeds that back to the community. When I try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ---------------------------------------- End of April 2010: target deadline for contributions to the May 2010 edition of the HC&A Report ---------------------------------------- Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editor for a simple e-mail reminder in October (you could point me to them as well, and I can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Janis Voigtlaender From simonpj at microsoft.com Fri Nov 20 08:39:36 2009 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Fri Nov 20 08:14:59 2009 Subject: [Haskell] ANNOUNCE: Haskell Communities and Activities Report (17th ed., November 2009) In-Reply-To: References: Message-ID: <59543203684B2244980D7E4057D5FBC1084FD9E4@DB3EX14MBXC310.europe.corp.microsoft.com> Brilliant. Thank you Janis! | | On behalf of the many, many contributors, I am pleased to announce | that the | | Haskell Communities and Activities Report | (17th edition, November 2009) | | http://www.haskell.org/communities/ | | is now available from the Haskell Communities home page in PDF and | HTML formats. From jfredett at gmail.com Sat Nov 21 15:14:29 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sat Nov 21 14:49:51 2009 Subject: [Haskell] Haskell Weekly News: Issue 140 - November 22, 2009 Message-ID: <4b084a25.9753f10a.610e.ffff8332@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091122 Issue 140 - November 22, 2009 --------------------------------------------------------------------------- Welcome to issue 140 of HWN, a newsletter covering developments in the [1]Haskell community. Apologies for the somewhat late edition, I got back late from the NES/MAA conference yesterday in Springfield, MA, and was generally too exhausted from all the math competing and giving of talks that HWN could not compete with the appeal of sleeping... This week there was a new edition of the HCAR, plenty of good discussion about Iteratee's and the Type Directed Name Resolution proposal, altogether a busy week. So here it is, your Haskell Weekly News! Announcements [BostonHaskell] Next meeting: November 24th at MIT (32-G882). Ravi Nanavati [2]announced the next meeting of BAHUG. Haskell Communities and Activities Report (17th ed., November 2009). Janis Voigtlaender [3]announced the new edition of the Haskell Communities and Activities Report. Call for Participation - PEPM'10 (co-located with POPL'10). Janis Voigtlaender [4]announced a call for participation for PEPM 2010. LambdaCube engine and Bullet physics binding. Csaba Hruska [5]announced a binding to the LambdaCube and Bullet engines. ICFP '10: Second call for workshop proposals. Wouter Swierstra [6]announced a second call for workshop proposals for ICFP 2010. deepseq-1.0.0.0. Simon Marlow [7]announced version 1.0.0.0 of `deepseq` wcwidth-0.0.1. Jason Dusek [8]announced a small package which provides binding to wchar.h, which assigns a column width to unicode characters. gnome-keyring 0.1 (bindings to libgnome-keyring). John Millikin [9]announced a set of bindings to the GNOME keyring libraries. attempt. Michael Snoyman [10]announced a new release of the `attempt` package. control-monad-failure and safe-failure. Michael Snoyman [11]also announced a new version of `control-monad-failure` and `safe-failure`. Announcing the GHC Bug Sweep. Simon Marlow [12]announced the GHC bug sweep, to help weed out the GHC Trac of old bugs, and also to get warm fuzzy feelings from helping everyone's favorite compiler devs. New Industrial Haskell Group membership options. Duncan Coutts [13]announced some new membership options for the the Industrial Haskell Group (IHG) bindings-SDL 1.0.2, the domain specific language for FFI description. Mauricio Antunes [14]announced a new version of the bindings-SDL package. wxHaskell 0.12.1.2. Jeremy O'Donoghue [15]announced a release of the wxHaskell package, including new improved support for installation via cabal on any system, with only a minor caveat on Windows. TFP 2010 - Call for Papers. TFP 2010 [16]announced a call for papers for TFP 2010, the 11th symposium on Trends in Functional Programming. Reminder: Fun in the afternoon, MSR Cambridge, 26 Nov. Simon Marlow [17]announced a final reminder for the `Fun in the Afternoon` meeting, which will be at MSR Cambridge on the 26th of November (ED: Thanksgiving for us Americans, if only there were some way to combine turkey-oriented gluttony with Functional programming...). Job at the University of Technology in Cottbus. Wolfgang Jeltsch [18]announced a job opening at the University of Technology in Cottbus. Scottish Category Theory Seminar. Conor McBride [19]announced the first meeting of Scottish Category Theory Seminar, a forum for discussion of all aspects of Category Theory, be they pure or applied. (ED: I am fighting very hard to not make some sort of Braveheart Joke...) Discussion Iteratee question. Valery V. Vorotyntsev [20]asked about using iteratee's in his binary data parser code. Haskell as an alternative to Java. Philippos Apolinarius [21]wondered whether Haskell would make for a good Java alternative. Status of TypeDirectedNameResolution proposal? Levi Greenspan [22]asked about the status of the TDNR proposal. Typef*ck: Brainf*ck in the type system. Johnny Morrice [23]showed us his implementation of everyone's favorite profane programming language... in the type system. Could someone teach me why we use Data.Monoid? Magicloud Magiclouds [24]requested some insight to why we use monoids so much in Haskell, leading to a fantastic discussion of all the myriad places Monoids pop up in both Haskell and in Math in general. Blog noise [25]Haskell news from the [26]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Brown: [27]The Operators and Monoids of CHP. * Philip Wadler: [28]A list is an odd creature, take 2. * Darcs: [29]darcs hacking sprint 3 report. * Mikael Vejdemo Johansson (Syzygy-): [30][MATH198] Lecture 9 posted and lectured. * Gergely Patai: [31]LambdaCube and Bullet on Hackage at last. * David Amos: [32]Three new modules in HaskellForMaths. * Darcs: [33]darcs weekly news #46. * Christophe Poucet (vincenz): [34]Setting up iptables to throttle incoming ssh. * Ivan Lazar Miljenovic: [35]Waddaya know, testing WORKS!. * Neil Mitchell: [36]Reviewing View Patterns. * Neil Brown: [37]An Introduction to Communicating Sequential Processes. * Joachim Breitner: [38]Darcs Hacking Sprint: Mission Complete. * Ivan Lazar Miljenovic: [39]Past, Present and PEPM. * Erik de Castro Lopo: [40]Hacking DDC.. * Dan Piponi (sigfpe): [41]Haskell Monoids and their Uses. * Joachim Breitner: [42]Arrived at the Darcs hacking sprint. Quotes of the Week * Apocalisp: You can't have your baby and eat it too * tensorpudding: so you boil lisp for an hour to sift out the parentheses and impurities, make a whitespace sauce with liberal syntactic sugar, and you have haskell a la mode * ddarius: I'm not aware of anything (including C++) that can seamlessly talk to C++ code. * ksf: is Data.Data.Data some kind of reference to swedish chefs? * IceDane: [on escaping an imperative mindset]: i recommend heavy drinking I've tried that. I just have fun and wake up and feel like shit the day after. but still think in loops. * jpet: Ok, after studying the generated core a bit, I can conclude that generated core is somewhat hard to follow. * Adamant: [on the update complexity of Data.Map] I read that as 'Oleg(n)' * skorpan: I did not have impure relations with that language About the Haskell Weekly News New editions are posted to [43]the Haskell mailing list as well as to [44]the Haskell Sequence and [45]Planet Haskell. [46]RSS is also available, and headlines appear on [47]haskell.org. To help create new editions of this newsletter, please see the information on [48]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [49]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66609 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66594 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66530 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66523 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66510 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66445 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66441 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66440 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66413 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66408 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66396 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66395 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66383 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66279 16. http://thread.gmane.org/gmane.comp.lang.haskell.general/17631 17. http://article.gmane.org/gmane.comp.lang.haskell.general/17627 18. http://article.gmane.org/gmane.comp.lang.haskell.general/17625 19. http://article.gmane.org/gmane.comp.lang.haskell.general/17623 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66601 21. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66511 22. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66431 23. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66398 24. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66223 25. http://planet.haskell.org/ 26. http://haskell.org/haskellwiki/Blog_articles 27. http://chplib.wordpress.com/2009/11/20/the-operators-and-monoids-of-chp/ 28. http://wadler.blogspot.com/2009/11/list-is-odd-creature-take-2.html 29. http://blog.darcs.net/2009/11/darcs-hacking-sprint-3-report.html 30. http://blog.mikael.johanssons.org/archive/2009/11/math198-lecture-9-posted-and-lectured/ 31. http://just-bottom.blogspot.com/2009/11/lambdacube-and-bullet-on-hackage-at.html 32. http://haskellformaths.blogspot.com/2009/11/three-new-modules-in-haskellformaths.html 33. http://blog.darcs.net/2009/11/darcs-weekly-news-46.html 34. http://blog.poucet.org/2009/11/setting-up-iptables-to-throttle-incoming-ssh/ 35. http://ivanmiljenovic.wordpress.com/2009/11/17/waddaya-know-testing-works/ 36. http://neilmitchell.blogspot.com/2009/11/reviewing-view-patterns.html 37. http://chplib.wordpress.com/2009/11/16/an-introduction-to-communicating-sequential-processes/ 38. https://www.joachim-breitner.de/blog/archives/350-Darcs-Hacking-Sprint-Mission-Complete.html 39. http://ivanmiljenovic.wordpress.com/2009/11/15/past-present-and-pepm/ 40. http://www.mega-nerd.com/erikd/Blog/CodeHacking/DDC/hacking_ddc.html 41. http://blog.sigfpe.com/2009/01/haskell-monoids-and-their-uses.html 42. https://www.joachim-breitner.de/blog/archives/349-Arrived-at-the-Darcs-hacking-sprint.html 43. http://www.haskell.org/mailman/listinfo/haskell 44. http://sequence.complete.org/ 45. http://planet.haskell.org/ 46. http://sequence.complete.org/node/feed 47. http://haskell.org/ 48. http://haskell.org/haskellwiki/HWN 49. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From tobias_bexelius at hotmail.com Sun Nov 22 07:22:59 2009 From: tobias_bexelius at hotmail.com (Tobias Bexelius) Date: Sun Nov 22 06:58:13 2009 Subject: [Haskell] ANN: GPipe-1.1.0 with greatly improved performance Message-ID: Hi, GPipe 1.1.0 is now available on Hackage. This update includes the following: * BIG performance increase: The previous shader cache keys grew exponential in size in relation to the GPipe program. This is now fixed with a completely new shader generator so the cache key sizes are linear relative to the program. In addition, the cache now uses patricia trees instead of an ordinary map, which will be a big performance win in programs with many shaders. In the simple example on http://www.haskell.org/haskellwiki/GPipe I got an performance increase of factor 2.7(!), and expect it to be even larger for more complex programs. * Other minor fixes: Fixed so min, max, abs and sign no longer works on Vertex Int and Fragment Int types, since its not supported in GLSL 1.20. Reexport of Vec-Boolean instances so you dont need to import that package on its own any more. Added IfB instances for the associated type Color. Cheers Tobias _________________________________________________________________ Nya Windows 7 g?r allt lite enklare. Hitta en dator som passar dig! http://windows.microsoft.com/shop -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091122/55bee07d/attachment.html From ggrov at staffmail.ed.ac.uk Mon Nov 23 05:33:57 2009 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Mon Nov 23 05:09:12 2009 Subject: [Haskell] VSTTE 2010: Verified Software -- Second Call for Papers Message-ID: <8ACFD889-A1C6-417E-9176-0780EF2F0681@staffmail.ed.ac.uk> (Apologies if you receive multiple copies of this announcement) ***************************************************************** Third International Conference on Verified Software: Theories, Tools, and Experiments Call for Conference & Workshop Papers Edinburgh, Scotland August 16th-19th, 2010 http://www.macs.hw.ac.uk/vstte10 SPONSORS National Science Foundation (NSF) EPSRC Microsoft Research Scottish Informatics & Computer Science Alliance (SICSA) To become a sponsor see: http://www.macs.hw.ac.uk/vstte10/Sponsors.html ****************************************************************** The Third International Conference on Verified Software: Theories, Tools, and Experiments follows a successful inaugural working conference at Zurich (2005) and a successful conference in Toronto (2008). This conference is part of the Verified Software Initiative (VSI), a fifteen-year, cooperative, international project directed at the scientific challenges of large-scale software verification. VSI also includes UKCRC's Grand Challenge 6, i.e. Dependable Systems Evolution. VSTTE is open to anyone who is interested in participating actively in the VSI effort. SCOPE The goal of this conference is to advance the state of the art in the science and technology of software verification through the interaction of theory development, tool evolution, and experimental validation. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Topics of interest include requirements modeling specification languages specification/verification case-studies formal calculi programming languages language semantics software design methods software testing automatic code generation refinement methodologies type systems computer security verification tools (static analysis, dynamic analysis, model checking, theorem proving, satisfiability) tool integration benchmarks challenge problems integrated verification environments We also encourage researchers to submit challenges in theory, formalization, systems verification, code verification, and applications. Contributions relating to existing challenges will also be welcomed, i.e. * POPLMark (http://tinyurl.com/poplmark) * Tokeneer (http://www.adacore.com/home/products/sparkpro/tokeneer) * POSIX file system (http://tinyurl.com/qyzqk9) * medical devices (http://tinyurl.com/pnztqb) VENUE VSTTE 2010 is being hosted by Heriot-Watt University in Edinburgh. The conference dates coincide with the 2010 Edinburgh International Festival and the Edinburgh Festival Fringe -- collectively the largest annual arts festival on the planet! The technical programme will take place in the Edinburgh Conference Centre (Riccarton campus), where accommodation will be available at very competitive rates for festival time. Social events will be arranged within the city centre, making VSTTE an unique cultural and scholarly event for 2010! INVITED SPEAKERS * Tom Ball (Microsoft Research, Redmond) * Gerwin Klein (National ICT Australia) * Matthew Parkinson (University of Cambridge) SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Submissions of theoretical, practical, and experimental contributions are equally encouraged, including those that focus on specific problems or problem domains. Papers can be submitted at https://www.easychair.org/login.cgi?conf=vstte10. Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2010 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. The use of LaTeX and the Springer llncs class files, obtainable from http://www.springer.de/comp/lncs/authors.html , is strongly encouraged. WORKSHOPS In addition to the main conference, VSTTE will host two workshops on August 19th -- a workshop on Theory chaired by David Naumann and Hongseok Yang and a workshop on Tools & Experiments chaired by Tiziana Margaria and Rajeev Joshi. The workshops will provide a forum to present new, possibly unfinished work and will also give the opportunity to propose research challenges, which will help form a research agenda for the Verified Software Initiative. IMPORTANT DATES March 29 2010: Conference paper submission deadline May 10 2010: Decisions on papers May 21 2010: Workshop paper submission June 1 2010 Final conference paper versions due June 23 2010: Final workshop paper version August 16-18 2010: Main conference August 19 2010: Workshops CONFERENCE CHAIR Andrew Ireland (Heriot-Watt University; A.Ireland@hw.ac.uk) PROGRAM CHAIRS Peter O'Hearn (Queen Mary, University of London; ohearn@dcs.qmul.ac.uk) Gary T. Leavens (University of Central Florida; leavens@eecs.ucf.edu) Sriram Rajamani (Microsoft Research; sriram@microsoft.com) WORKSHOP GENERAL CHAIR Peter Mueller (ETH Zurich; peter.mueller@inf.ethz.ch) THEORY WORKSHOP CHAIRS David Naumann (Stevens Institute of Technology; dnaumann@stevens.edu) Hongseok Yang (Queen Mary, University of London; hyang@dcs.qmul.ac.uk) TOOLS & EXPERIMENTS WORKSHOP CHAIRS Rajeev Joshi (NASA JPL; rajeev.joshi@jpl.nasa.gov) Tiziana Margaria (Universit??t Potsdam; margaria@cs.uni-potsdam.de) PUBLICITY CHAIR Gudmund Grov (Edinburgh University; ggrov@inf.ed.ac.uk) LOCAL ARRANGEMENT CHAIR Ewen Maclean (Heriot-Watt University; E.A.H.Maclean@hw.ac.uk) CONFERENCE PROGRAM COMMITTEE Ahmed Bouajjani Leo Freitas Philippa Gardner John Hatcliff Ranjit Jhala Joseph Kiniry Rustan Leino Xavier Leroy David Naumann Matthew Parkinson Wolfgang Paul Shaz Qadeer Andrey Rybalchenko Augusto Sampaio Zhong Shao Aaron Stump Serdar Tasiran Willem Visser Chin Wei-Ngan Stephanie Weirich Greta Yorsh STEERING COMMITTEE Tony Hoare Jay Misra Natarajan Shankar Jim Woodcock From demis at dimi.uniud.it Mon Nov 23 06:49:47 2009 From: demis at dimi.uniud.it (demis@dimi.uniud.it) Date: Mon Nov 23 06:25:53 2009 Subject: [Haskell] Deadline Extension: JSC Special Issue on Automated Specification and Verification of Web Systems Message-ID: <20091123114947.D980B3FC119@sole.dimi.uniud.it> Skipped content of type multipart/alternative From marlowsd at gmail.com Tue Nov 24 05:50:49 2009 From: marlowsd at gmail.com (Simon Marlow) Date: Tue Nov 24 05:26:03 2009 Subject: [Haskell] Announcing Haskell 2010 Message-ID: <4B0BBA89.2000904@gmail.com> I'm very proud to announce a new revision of the Haskell language, Haskell 2010. Over the last couple of months the committee has been making final decisions about which extensions should be a part of this revision. The final list is: DoAndIfThenElse HierarchicalModules EmptyDataDeclarations FixityResolution ForeignFunctionInterface LineCommentSyntax PatternGuards RelaxedDependencyAnalysis LanguagePragma NoNPlusKPatterns You can read more about each one, including rationale for and against, on its relevant wiki page, which are linked from the tickets: http://hackage.haskell.org/trac/haskell-prime/query?status=new&status=assigned&status=reopened&state=accepted&milestone=Haskell+2010&order=priority Haskell 2010 is a small but significant step on the road that was started by the Haskell' committee 4 years ago, The process has not been a smooth one, and there have been several changes of direction, but the current process is actually producing concrete results that let us move the language forward in positive steps, so I feel we're on the right track. We all owe the current committee a big thank-you for sticking with the process this long: most of them didn't realise the magnitude of what they were signing up for at the beginning. The short list of changes above tells only a small part of the story, there is a wealth of wiki content and mailing-list discussion that future language revisions can draw on. So what now? * We will produce a revised version of the Haskell language report incorporating these changes. That will happen over the next few months. * Compilers can start implementing the changes, and flags to select the Haskell 2010 revision. In GHC we expect to have support in the next major release, i.e. 6.14.1. * Right now, we will start forming a Haskell 2011 committee to mange the process of deciding on changes for next year's revision. The current committee is still discussing how to go about finding a new committee (the plan is to at least have open nominations) but I expect to be able to announce more details very soon. * Everyone can participate in the Haskell 2011 process, by discussing and refining proposals. Information about how to do that is on the Haskell Prime wiki: http://hackage.haskell.org/trac/haskell-prime/wiki Remember: this is a community effort. The changes that get adopted in each revision are drawn from the pool of fully-specified proposals, and those proposals can be written by anyone. Thanks, Simon, on behalf of the Haskell 2010 committee From malcolm.wallace at cs.york.ac.uk Tue Nov 24 06:06:17 2009 From: malcolm.wallace at cs.york.ac.uk (Malcolm Wallace) Date: Tue Nov 24 05:41:51 2009 Subject: [Haskell] Announcing Haskell 2010 In-Reply-To: <4B0BBA89.2000904@gmail.com> References: <4B0BBA89.2000904@gmail.com> Message-ID: <3B4AAB31-1681-4E3E-B053-2809D7C19A63@cs.york.ac.uk> On 24 Nov 2009, at 10:50, Simon Marlow wrote: > I'm very proud to announce a new revision of the Haskell language, > Haskell 2010. Hurrah! > * Compilers can start implementing the changes, and flags to > select the Haskell 2010 revision. In GHC we expect to have > support in the next major release, i.e. 6.14.1. Just to note that 6.14.1 will be the next-plus-one, since 6.12.1 has not yet been released... Regards, Malcolm From leimy2k at gmail.com Tue Nov 24 10:19:23 2009 From: leimy2k at gmail.com (David Leimbach) Date: Tue Nov 24 09:54:32 2009 Subject: [Haskell] Announcing Haskell 2010 In-Reply-To: <4B0BBA89.2000904@gmail.com> References: <4B0BBA89.2000904@gmail.com> Message-ID: <3e1162e60911240719y2a3b5eewfff2a8c88f07bcb@mail.gmail.com> First off congratulations everyone! Second, Oh shit! Graham Hutton's excellent Haskell introduction book is now not valid Haskell 2010 due to N+K patterns? I loaned that book to my boss and he's really enjoyed it. I guess I'll have to buy a revised copy. Can we get an update to it? :-) I realize N+K was considered dangerous On Tue, Nov 24, 2009 at 2:50 AM, Simon Marlow wrote: > I'm very proud to announce a new revision of the Haskell language, Haskell > 2010. Over the last couple of months the committee has been making final > decisions about which extensions should be a part of this revision. The > final list is: > > DoAndIfThenElse > HierarchicalModules > EmptyDataDeclarations > FixityResolution > ForeignFunctionInterface > LineCommentSyntax > PatternGuards > RelaxedDependencyAnalysis > LanguagePragma > NoNPlusKPatterns > > You can read more about each one, including rationale for and against, on > its relevant wiki page, which are linked from the tickets: > > > http://hackage.haskell.org/trac/haskell-prime/query?status=new&status=assigned&status=reopened&state=accepted&milestone=Haskell+2010&order=priority > > Haskell 2010 is a small but significant step on the road that was started > by the Haskell' committee 4 years ago, The process has not been a smooth > one, and there have been several changes of direction, but the current > process is actually producing concrete results that let us move the language > forward in positive steps, so I feel we're on the right track. > > We all owe the current committee a big thank-you for sticking with the > process this long: most of them didn't realise the magnitude of what they > were signing up for at the beginning. The short list of changes above tells > only a small part of the story, there is a wealth of wiki content and > mailing-list discussion that future language revisions can draw on. > > So what now? > > * We will produce a revised version of the Haskell language report > incorporating these changes. That will happen over the next few > months. > > * Compilers can start implementing the changes, and flags to > select the Haskell 2010 revision. In GHC we expect to have > support in the next major release, i.e. 6.14.1. > > * Right now, we will start forming a Haskell 2011 committee to > mange the process of deciding on changes for next year's revision. > The current committee is still discussing how to go about > finding a new committee (the plan is to at least have open > nominations) but I expect to be able to announce more details > very soon. > > * Everyone can participate in the Haskell 2011 process, by discussing > and refining proposals. Information about how to do that is on > the Haskell Prime wiki: > http://hackage.haskell.org/trac/haskell-prime/wiki > > Remember: this is a community effort. The changes that get > adopted in each revision are drawn from the pool of fully-specified > proposals, and those proposals can be written by anyone. > > Thanks, > > Simon, on behalf of the Haskell 2010 committee > > _______________________________________________ > 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/20091124/e1bcc9d9/attachment.html From nr at cs.tufts.edu Tue Nov 24 13:34:13 2009 From: nr at cs.tufts.edu (Norman Ramsey) Date: Tue Nov 24 13:09:21 2009 Subject: [Haskell] Announcing Haskell 2010 In-Reply-To: <4B0BBA89.2000904@gmail.com> (sfid-H-20091124-055204-+55.99-1@multi.osbf.lua) References: <4B0BBA89.2000904@gmail.com> (sfid-H-20091124-055204-+55.99-1@multi.osbf.lua) Message-ID: <20091124183413.EC5A36018CF01@labrador.cs.tufts.edu> > I'm very proud to announce a new revision of the Haskell language, > Haskell 2010. I stand up and cheer. It's great to see fruit from so many years of effort, and I am very grateful to the Haskell-prime committee for all this work, and for the improvements. I look forward to using the new standard! Norman From ppk at cse.iitk.ac.in Wed Nov 25 00:50:47 2009 From: ppk at cse.iitk.ac.in (Piyush P Kurur) Date: Wed Nov 25 00:20:45 2009 Subject: [Haskell] inline assembly a la gcc Message-ID: <20091125055047.GC1616@quantum.cse.iitk.ac.in> Is there a way in which I can interface GHC with assembly language ? Of course I can create a stub C function which using inline assembly, compile it with GCC, and crankin the FFI of GHC. But is there a more direct way ? I would like to try coding, (or steal from some open source implementation) up some crypto hash functions in assembly and compare it with a direct GHC implementation. I will be happy if there is a way of avoiding assembly all together and work with GHC internals like Int# etc. which gives me almost assembly speed. Regards ppk From dons at galois.com Wed Nov 25 01:32:29 2009 From: dons at galois.com (Don Stewart) Date: Wed Nov 25 01:10:22 2009 Subject: [Haskell] inline assembly a la gcc In-Reply-To: <20091125055047.GC1616@quantum.cse.iitk.ac.in> References: <20091125055047.GC1616@quantum.cse.iitk.ac.in> Message-ID: <20091125063229.GB4011@whirlpool.galois.com> ppk: > Is there a way in which I can interface GHC with assembly language ? > Of course I can create a stub C function which using inline assembly, > compile it with GCC, and crankin the FFI of GHC. But is there a more > direct way ? > > I would like to try coding, (or steal from some open source > implementation) up some crypto hash functions in assembly and compare > it with a direct GHC implementation. > > I will be happy if there is a way of avoiding assembly all together > and work with GHC internals like Int# etc. which gives me almost > assembly speed. Via the harpy or llvm packages? From akenn at microsoft.com Wed Nov 25 10:25:15 2009 From: akenn at microsoft.com (Andrew Kennedy) Date: Wed Nov 25 10:00:25 2009 Subject: [Haskell] Call for Participation: TLDI'10 Message-ID: <39B4CD0B764E1B44AEA3DAA2F0385D5406D68EE1@DB3EX14MBXC306.europe.corp.microsoft.com> ********************************************************************* CALL FOR PARTICIPATION TLDI 2010 ACM SIGPLAN Workshop on Types in Language Design and Implementation 23 January 2010 Madrid, Spain To be held in conjunction with POPL 2010 http://research.microsoft.com/~akenn/tldi2010/ ********************************************************************* IMPORTANT DATES Hotel reservation deadline: December 28, 2009 (Monday) VENUE TLDI'10 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid. REGISTRATION To register for TLDI'10, follow the link from the POPL 2010 page, at http://www.cse.psu.edu/popl/10/ SCOPE 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. INVITED SPEAKER Matthias Felleisen, Northeastern University, Boston PRELIMINARY PROGRAM ---------------------- Opening remarks: 9:20-9:30 Invited talk 9:30-10:30 *** Adding Types to Untyped Languages Matthias Felleisen, Northeastern University, Boston ---------------------- ** Session I 11:00-12:30 *** Effects for Cooperable and Serializable Threads Jaeheon Yi and Cormac Flanagan *** Race-free and Memory-safe Multithreading: Design and Implementation in Cyclone Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas *** Distributed programming with distributed authorization Kumar Avijit, Anupam Datta and Robert Harper ---------------------- ** Session II 2:30-4:00 *** let should not be generalized Dimitrios Vytiniotis, Simon Peyton Jones and Tom Schrijvers *** Pointwise Generalized Algebraic Data Types Chuan-kai Lin and Tim Sheard *** Verifying Event-Driven Programs using Ramified Frame Properties Neelakantan Krishnaswami, Lars Birkedal and Jonathan Aldrich ---------------------- ** Session III 4:30-5:30 *** Lightweight Linear Types in System F^o Karl Mazurak, Jianzhou Zhao and Steve Zdancewic *** F-ing Modules Andreas Rossberg, Claudio Russo and Derek Dreyer ---------------------- GENERAL CHAIR Andrew Kennedy, Microsoft Research, Cambridge PROGRAM CHAIR Nick Benton, Microsoft Research, Cambridge 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 From bruno at ropas.snu.ac.kr Wed Nov 25 22:12:21 2009 From: bruno at ropas.snu.ac.kr (Bruno Oliveira) Date: Wed Nov 25 21:47:40 2009 Subject: [Haskell] GPCE'10 First Call for Papers Message-ID: <639A42DA-6E41-4F06-AC13-195EC1EE8F49@ropas.snu.ac.kr> Hi all, Haskell is a great language for developing generative programming tools and developing highly expressible and reusable components (think of all the cool uses of type classes, type families or GADTs). The GPCE conference is interested to hear about cutting-edge techniques of generative and component-based software. You can show what Haskell can do in this area by submitting a research paper or a tool demonstration to GPCE! ------------------------------------------------------------------------ CALL FOR PAPERS Ninth International Conference on Generative Programming and Component Engineering (GPCE 2010) October 10-13, 2010 Eindhoven, The Netherlands (co-located with SLE 2010) http://www.gpce.org ------------------------------------------------------------------------ IMPORTANT DATES * Submission of abstracts: May 17, 2010 * Submission of papers: May 24, 2010 * Author notification: Jul 5, 2010 SCOPE Generative and component approaches are revolutionizing software development similar to how automation and components revolutionized manufacturing. Generative Programming (concerning programs that synthesize other programs), Component Engineering (concerning modularity in application design), and Domain-Specific Languages (DSLs) (concerning compact domain-specific notations for expressing programs) are key technologies for automating program development. The International Conference on Generative Programming and Component Engineering is a venue for researchers and practitioners interested in techniques that, through deploying components and program generation, increase programmer productivity, improve software quality, and shorten the time-to-market of software products. In addition to exploring cutting-edge techniques of generative and component-based software, our goal is to foster further cross-fertilization between the software engineering and the programming languages research communities. SUBMISSIONS Research papers: 10 pages in SIGPLAN proceedings style (sigplanconf.cls) reporting original research results that contribute to scientific knowledge in the areas listed below (the PC chair can advise on appropriateness). Tool demonstrations: Tool demonstrations should present tools that implement novel generative and component-based software engineering techniques, and are available for use. Any of the GPCE'10 topics of interest are appropriate areas for research demonstrations. Purely commercial tool demonstrations will not be accepted. Submissions should contain a tool description of 4 pages in SIGPLAN proceedings style (sigplanconf.cls) and a demonstration outline of up to 2 pages text plus 2 pages screen shots. The four page description will, if the demonstration is accepted, be published in the proceedings. The 2+2 page demonstration outline will only be used by the PC for evaluating the submission. TOPICS GPCE seeks contributions in software engineering and in programming languages related (but not limited) to: * Generative programming o Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, step-wise refinement, generic programming o Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, program transformation o Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection * Generative techniques for o Product-line architectures o Distributed, real-time and embedded systems o Model-driven development and architecture o Resource bounded/safety critical systems. * Component-based software engineering o Reuse, distributed platforms and middleware, distributed systems, evolution, patterns, development methods, deployment and configuration techniques, formal methods * Integration of generative and component-based approaches * Domain engineering and domain analysis o Domain-specific languages including visual and UML-based DSLs * Separation of concerns o Aspect-oriented and feature-oriented programming, o Intentional programming and multi-dimensional separation of concerns * Industrial applications of the above Submissions must adhere to SIGPLAN's republication policy. Please contact the program chair if you have any questions about how this policy applies to your paper (chairs@gpce.org). ORGANIZATION General Chair: Eelco Visser (Delft University of Technology, The Netherlands) Program Chair: Jaakko J?rvi (Texas A&M University, USA) Publicity Chair: Giorgios Economopoulos (University of Southampton, UK) Program Committee * Sven Apel (University of Passau, Germany) * Don Batory (University of Texas, USA) * Martin Bravenboer (LogicBlox, USA) * Krzysztof Czarnecki (University of Waterloo, Canada) * Charles Consel (INRIA / LaBRI, France) * Gabriel Dos Reis (Texas A&M University, USA) * Ewen Denney (RIACS/NASA Ames, USA) * Ronald Garcia (Carnegie Mellon University, USA) * Magne Haveraaen (University of Bergen, Norway) * Johan Lilius (?bo Akademi University, Finland) * Andres L?h (Utrecht University, The Netherlands) * Mat Marcus (Canyonlands Software Design, USA) * Marjan Mernik (University of Maribor, Slovenia) * Klaus Ostermann (University of Marburg, Germany) * Bruno C. d. S. Oliveira (Seoul National University, Korea) * Hridesh Rajan (Iowa State University, USA) * Sukyoung Ryu (Korea Advanced Institute of Science and Technology) * Jo?o Saraiva (Minho University, Portugal) * Sibylle Schupp (Hamburg University of Technology, Germany) * Kwang Yi (Seoul National University, Korea) * Mirko Viroli (University of Bologna, Italy) * Alessandro Warth (Viewpoints Research Institute, USA) * Edwin Westbrook (Rice University, USA) * Jeremiah Willcock (Indiana University, USA) From xana at di.uminho.pt Thu Nov 26 07:50:47 2009 From: xana at di.uminho.pt (Alexandra Silva) Date: Thu Nov 26 07:25:48 2009 Subject: [Haskell] CMCS 2010: First call for papers Message-ID: <4B0E79A7.1050107@di.uminho.pt> ------------------------------------------------------------------------------ CMCS 2010 First call for papers ------------------------------------------------------------------------------ The Tenth International Workshop on Coalgebraic Methods in Computer Science 26-28 March 2010, Paphos, Cyprus (co-located with ETAPS 2010) http://event.cwi.nl/cmcs10/ Aims and scope ------------------ The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. Over the last two decades, coalgebra has developed into a field of its own, presenting a mathematical foundation for various kinds of dynamical systems, infinite data structures, and logics. Coalgebra has an ever growing range of applications in and interactions with other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). An anniversary: the 10th CMCS ---------------------------------------- CMCS took place for the first time when ETAPS started, in 1998. Since then, it has always been collocated with ETAPS, becoming bi-annual since the start of CALCO (Conference on Algebra and Coalgebra) in 2005. In 2010, we will celebrate the 10th edition of CMCS, by inviting a number of specialists in the field to present overviews of both obtained results and future challenges. Invited Speakers --------------------- At this tenth meeting the following invited speakers will present overviews of important subareas. * Venanzio Capretta: Coalgebra in functional programming and type theory * Bartek Klin: Operational semantics coalgebraically * Dirk Pattinson: Logic and coalgebra * Ana Sokolova: Probabilistic systems coalgebraically Submissions -------------- There are two types of submissions possible: (a) Papers to be evaluated by the PC for publication in the proceedings: They must have a length no greater than 20 pages. They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Accepted papers will appear in ENTCS (style files can be found in http://www.entcs.org/). The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=cmcs10). After the event, a special journal issue of selected papers will be considered. (b) Short contributions: These will not be published in the proceedings but will be bundled in a CWI technical report. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. For short submissions, the style file easychair.cls should be used (http://www.easychair.org/coolnews.cgi). The submission (pdf file) is via email: cmcs10@cwi.nl. Important dates ------------------- * 8 January 2010: strict submission deadline regular papers * 13 February 2010: notification regular papers * 15 February 2010: deadline early registration * 20 February 2010: final version * 27 February 2010: strict submission deadline short contributions * 6 March 2010: notification short contributions * 26-28 March 2010: the workshop Programme Committee ------------------------ Jiri Adamek (Braunschweig) Alexandru Baltag (Oxford) Luis Barbosa (Braga) Marcello Bonsangue (Leiden) Corina Cirstea (Southampton) Robin Cockett (Calgary) Andrea Corradini (Pisa) Neil Ghani (Glasgow) Peter Gumm (Marburg) Furio Honsell (Udine) Bart Jacobs (Nijmegen, co-chair) Bartek Klin (Cambridge) Clemens Kupke (London) Alexander Kurz (Leicester) Marina Lenisa (Udine) Stefan Milius (Braunschweig) Ugo Montanari (Pisa) Larry Moss (Bloomington) Milad Niqui (Amsterdam) Dirk Pattinson (London) Dusko Pavlovic (Oxford) John Power (Edinburgh) Horst Reichel (Dresden) Grigore Rosu (Urbana) Jan Rutten (Amsterdam, co-chair) Davide Sangiorgi (Bologna) Lutz Schroeder (Bremen) Alexandra Silva (Amsterdam) Hendrik Tews (Nijmegen) Tarmo Uustalu (Tallinn) Yde Venema (Amsterdam) Hiroshi Watanabe (Osaka) James Worrell (Oxford) Organising Committee -------------------------- Bart Jacobs, Milad Niqui (co-chair, CWI), Jan Rutten, Alexandra Silva (co-chair, CWI). Contact ---------- cmcs10@cwi.nl . From rl at cse.unsw.edu.au Thu Nov 26 10:31:10 2009 From: rl at cse.unsw.edu.au (Roman Leshchinskiy) Date: Thu Nov 26 10:06:13 2009 Subject: [Haskell] ANN: NoSlow - Microbenchmarks for array libraries Message-ID: I'm pleased to announce NoSlow, a nascent benchmark suite for various array (and list) libraries with particular emphasis on finding out how well they fuse things. At the moment, it knows about * standard lists * primitive DPH arrays (dph-prim-seq) * uvector * vector * storablevector It compiles and runs (using Brian's criterion) a fairly random collection of very small loop kernels for each of those and produces a lot of data which it then uses to generate ugly HTML tables. In the future, it will have more benchmarks, more complex benchmarks and much prettier tables. You can get more information (including the ugly tables) from my blog http://unlines.wordpress.com/2009/11/27/noslow and NoSlow itself from Hackage http://hackage.haskell.org/package/NoSlow Any help would be highly appreciated as I don't have a lot of time to work on it. Roman From gtener at gmail.com Thu Nov 26 21:43:50 2009 From: gtener at gmail.com (=?UTF-8?Q?Krzysztof_Skrz=C4=99tnicki?=) Date: Thu Nov 26 21:18:57 2009 Subject: [Haskell] ANN: package-vt-0.1.3.3, Haskell Package Versioning Tool Message-ID: <220e47b40911261843g58a33d96mca9c264f2430154d@mail.gmail.com> Hi! I'm pleased to announce the first release of my program package-vt. It's role is to detect changes between two versions of package that should cause version bump. Recommended versioning policy for Haskell packages is on the wiki [1]. The ultimate goal is to get as good approximation of the algorithm specified there as possible. Currently the tool is far from being complete: it only detects changes to exports in .cabal and module files, but doesn't take any types into consideration, not to mention other possible heuristics. This tool is not meant as a replacement for developer's own brain. It can only detect a subset of changes, and there will always be some important changes it won't catch, like adding such line: head (_:y:_) = y However, it can be used for some quality checks. Thing that needs improving is user interface. No options are currently accepted. This, and a lot more, will change in future versions. You can find a Git repo here [2]. The repo contains 'tests' directory with two useful scripts. You can use them to run package-vt on anything from Hackage. Here are a few random usage examples: 1) Detect small change within module package-vt packages/HCL/1.1/HCL-1.1/HCL.cabal packages/HCL/1.2/HCL-1.2/HCL.cabal Single changes: ChangeABC : Entity added to module ModuleName "HCL" --- EVar (UnQual (Ident "prompt1")) --- Biggest change comes from: ChangeABC : Entity added to module ModuleName "HCL" --- EVar (UnQual (Ident "prompt1")) 2) Detect new module added to .cabal package-vt 0.2.0/AERN-Net-0.2.0/AERN-Net.cabal 0.2.1/AERN-Net-0.2.1/AERN-Net.cabal Single changes: ChangeABC : Entity added to module ModuleName "Control.ERNet.Foundations.Process" --- EThingAll (UnQual (Ident "ERProcessAction")) ---ChangeABC : Module(s) added.(Consider AB change if new modules are likely to cause name collisions) --- "Control/ERNet/Blocks/Real/LFT" --- Biggest change comes from: ChangeABC : Module(s) added.(Consider AB change if new modules are likely to cause name collisions) --- "Control/ERNet/Blocks/Real/LFT" --- 3) Using testing script: package-vt correctly detects that AERN-RnToRM-0.4.9 should rather be 0.5.0 because the module Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Field has been removed. ./test-on-package.lhs AERN-RnToRm --cut-- >>> Testing package-vt on AERN-RnToRm-0.4.2 and AERN-RnToRm-0.4.9 Parse error: VarSym "#" : SrcLoc {srcFilename = "0.4.2/AERN-RnToRm-0.4.2/src/Data/Number/ER/RnToRm/Approx/DomTransl.hs", srcLine = 174, srcColumn = 1} Single changes: ChangeABC : Entity added to module ModuleName "Data.Number.ER.RnToRm.Approx" --- EVar (UnQual (Ident "keyPointsConsistencyCheck")) EVar (UnQual (Ident "keyPointsPointwiseConsistencyCheck")) ---ChangeABC : Entity added to module ModuleName "Data.Number.ER.RnToRm.UnitDom.Approx" --- EVar (UnQual (Ident "keyPointsConsistencyCheck")) EVar (UnQual (Ident "keyPointsPointwiseConsistencyCheck")) ---ChangeAB : Module(s) removed/renamed. --- "Data/Number/ER/RnToRm/UnitDom/ChebyshevBase/Polynom/Field" --- Biggest change comes from: ChangeAB : Module(s) removed/renamed. --- "Data/Number/ER/RnToRm/UnitDom/ChebyshevBase/Polynom/Field" --- ExitSuccess --cut-- In case of any trouble please email me or report an issue here [3]. In the near future I'll post more specific plans about development on my blog [4]. I hope you will find it useful. Best regards, Krzysztof Skrz?tnicki [1] http://www.haskell.org/haskellwiki/Package_versioning_policy [2] http://github.com/Tener/haskell-package-vt [3] http://github.com/Tener/haskell-package-vt/issues [4] http://mostlycode.wordpress.com -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091126/7c1f3380/attachment-0001.html From rjmh at chalmers.se Fri Nov 27 15:30:48 2009 From: rjmh at chalmers.se (John Hughes) Date: Fri Nov 27 15:06:13 2009 Subject: [Haskell] Interesting experiences of test automation in Haskell? Automation of Software Test 2010 Message-ID: <727FFF824663494EBF5DF9E7E2B25764@HALL> This is a "heads up" about a workshop on test automation that I just joined the programme committee of. Automation of Software Test will be co-located with ICSE in Cape Town in May--the workshop home page is here: http://www.cs.allegheny.edu/ast2010/ Tools like QuickCheck, SmallCheck and HUnit fit the call for papers perfectly. So if you're doing some interesting automated testing in Haskell, why not submit a paper about it, and show a new audience what the Haskell community is up to? Both research papers and case studies are welcome, and the latter can even be in the form of a presentation of up to 15 slides--so there's no excuse for not putting something together! So how about it? It would be great to see some Haskell papers at the workshop! Deadline 20 January. John Hughes PS Check out the ICSE web site for information on the location: http://www.sbs.co.za/ICSE2010/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091127/dd8f2a69/attachment.html From bos at serpentine.com Fri Nov 27 20:19:57 2009 From: bos at serpentine.com (Bryan O'Sullivan) Date: Fri Nov 27 19:55:01 2009 Subject: [Haskell] Re: [Haskell-cafe] ANN: package-vt-0.1.3.3, Haskell Package Versioning Tool In-Reply-To: <220e47b40911261843g58a33d96mca9c264f2430154d@mail.gmail.com> References: <220e47b40911261843g58a33d96mca9c264f2430154d@mail.gmail.com> Message-ID: 2009/11/26 Krzysztof Skrz?tnicki > > I'm pleased to announce the first release of my program package-vt. It's > role is to detect changes between two versions of package that should cause > version bump. Oh wow. I was wishing for exactly this just a few hours ago! Thanks, this will be very useful. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091127/1785a1bf/attachment.html From jfredett at gmail.com Sat Nov 28 09:52:45 2009 From: jfredett at gmail.com (Joe Fredette) Date: Sat Nov 28 09:27:47 2009 Subject: [Haskell] HWN This week Message-ID: Hey folks, I'm at home this weekend, and the internet is somewhat dodgey, so I'm going to delay the special Thanksgiving episode of the HWN till sunday afternoon... I suppose the Turkey-coma isn't helping either, but I'll never admit it... /Joe From arsenm2 at rpi.edu Sat Nov 28 23:18:00 2009 From: arsenm2 at rpi.edu (Matt Arsenault) Date: Sat Nov 28 22:52:56 2009 Subject: [Haskell] ANNOUNCE: Clutterhs 0.1 Message-ID: <1259468280.21437.151.camel@wanda> Clutterhs 0.1 This is a very early announcement for an initial release of bindings for Clutter 1.0, now on Hackage,http://hackage.haskell.org/package/clutterhs What is Clutter? ------------------ See http://www.clutter-project.org/ Clutter is a GObject based library for creating 2.5D interfaces using OpenGL. It's currently being used in projects such as Intel's Moblin platform and GNOME Shell. Clutterhs ---------------- It uses c2hs, and depends on gtk2hs from darcs for the glib/gobject bindings. Overall, its usage should be similar to gtk2hs. Most of the core Clutter components are mostly bound. Currently missing are relatively low level pieces, and some backend specific stuff, ClutterListModel, ClutterUnits, and a few random pieces scattered around. There is some documentation, but that is also currently incomplete. More examples and a tutorial are planned. Right now for examples, I suggest people look at the simple demos in the git repository. The best example to look at for usage would be http://jayne.hortont.com/git/cgit.cgi/clutterhs.git/tree/clutter/demo/ClutterGame.hs This is my first Haskell project, and suggestions on the API, bug reports, etc. are appreciated. Special thanks to Sean O'Sullivan and Rensselaer Center for Open Source for their generous support. Related: Clutter: http://www.clutter-project.org/ gtk2hs: http://www.haskell.org/gtk2hs/ - Matt Arsenault From mwotton at gmail.com Sun Nov 29 19:39:04 2009 From: mwotton at gmail.com (Mark Wotton) Date: Sun Nov 29 19:13:59 2009 Subject: [Haskell] ANNOUNCE: Hubris 0.0.2, the Ruby-Haskell bridge Message-ID: The first vaguely usable version of Hubris is out on Hackage now. New stuff * now capable of building dynamic libs so that you don't need to have GHC installed on the production server. * extensible marshalling through a pair of typeclasses * automatically generated interface to Haskell from Ruby rather than the hacked-up manual packing/unpacking solution the first version had. For example: strings.rb: ---------------------- require 'hubris' class HsString hubris :module => 'Data.ByteString', :packages => ['bytestring'] end HsString.new.reverse("abcd") => "dcba" ------------------------ It requires the ghc 6.12 release candidate, and if you're on Mac, you'll need to apply the cabal patch at http://hackage.haskell.org/trac/hackage/ticket/591 and the ghc patch at http://hackage.haskell.org/trac/ghc/ticket/3550 You'll need to follow the installation instructions at http://github.com/mwotton/Hubris , as it needs a little extra info about ruby headers etc. Let me know if it works, if it breaks, if I've missed an obvious better way, if it's at all useful to you... Cheers Mark From jfredett at gmail.com Sun Nov 29 19:55:09 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sun Nov 29 19:30:10 2009 Subject: [Haskell] Haskell Weekly News: Issue 141 - November 29, 2009 Message-ID: <4b1317ed.9453f10a.1e2d.ffffb373@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091129 Issue 141 - November 29, 2009 --------------------------------------------------------------------------- Welcome to issue 141 of HWN, a newsletter covering developments in the [1]Haskell community. Firstly, sorry for the late HWN, a turkey coma is equal parts gift and curse. This week, we have some very exciting news, a new Haskell standard -- Haskell 2010 -- was announced, including several small changes. Also, we have lots of new packages, a possible Boston-area Hackathon coming up soon, and some great discussion. I won't hold you back from skipping all that and just reading the funny quotes! Haskellers, your (belated) Haskell Weekly News! Announcements Haskell 2010. Simon Marlow [2]announced the new revision of Haskell, Haskell 2010. Part of the new, less monolithic Haskell Prime process, Haskell 2010 includes several changes to the Haskell Language, including support for nonstandard if-then-else syntax (particularly wrt `do` notation and indentation), pattern guards, and several other changes. See the post for details. Clutterhs 0.1. Matt Arsenault [3]announced Clutterhs, version 0.1. A set of bindings for Clutter, a GObject based library for creating 2.5D interfaces using OpenGL. Interesting experiences of test automation in Haskell? Automation of Software Test 2010. John Hughes [4]announced a 'heads up' for the Automation af Software Test 2010 workshop NoSlow - Microbenchmarks for array libraries. Roman Leshchinskiy [5]announced his benchmark suite for various array and list libraries. CMCS 2010: First call for papers. Alexandra Silva [6]announced a first call for papers for the Tenth International Workshop on Coalgebraic Methods in Computer Science, taking place 26-28 March 2010, in Paphos, Cyprus. GPCE'10 First Call for Papers. Bruno Oliveira [7]announced a first call for papers for the Ninth International Conference on Generative Programming and Component Engineering. GPCE 2010 October 10-13, in Eindhoven, The Netherlands. Call for Participation: TLDI'10. Andrew Kennedy [8]announced a call for participation in the 2010 ACM SIGPLAN Workshop on Types in Language Design and Implementation Deadline Extension: JSC Special Issue on Automated Specification and Verification of Web Systems. demis [9]announced an extension to the paper deadline for the JSC Special Issue on Automated Specification and Verification of Web Systems. VSTTE 2010: Verified Software -- Second Call for Papers. Gudmund Grov [10]announced the second call for papers for the Third International Conference on Verified Software: Theories, Tools, and Experiments GPipe-1.1.0 with greatly improved performance. Tobias Bexelius [11]announced a new version of the GPipe package, now with greatly improved performance. wumpus-core. Stephen T [12]announced a new version of the wumpus-core package, a library for drawing 2D vector pictures, supporting output to SVG and postscript. package-vt-0.1.3.3, Haskell Package Versioning Tool. Krzysztof Skrzetnicki [13]announced the first release of his automatic version tracking tool, package-vt. Elerea 1.1. Patai Gergely [14]announced a new version of Elerea, a simple pull-based FRP library. Elerea (and FRP in general) allow for stream oriented programming, typically done in a applicative style. mecha-0.0.4. Tom Hawkins [15]announced a new version of Mecha, a little constructive solid modeling language intended for doing 3D CAD. atom-0.1.2. Tom Hawkins [16]announced a new release of Atom, a DSL for designing hard realtime embedded software with Haskell. This release adds guarded division operations, a new scheduling constraint, and a new rule scheduling algorithm. Managing Cabal Dependencies using Nix and Hack-nix. Marc Weber [17]announced a package for dealing with Cabal dependencies on the Nix OS platform. Discussion haskell in online contests. vishnu [18]asked about using Haskell in online contests, and particularly dealing with the SPOJ tool for judging programs. Namespaces for values, types, and classes. Sebastian Fischer [19]suggested allowing a namespace separation between class-names and other language elements. I miss OO. Michael Mossey [20]lamented his desire for Object-oriented features in Haskell, this led to a interesting discussion about name punning and typeclasses. Haskell Hackathon in Boston January 29th-31st? Ravi Nanavati [21]proposed a potential Hackathon in this editor's favorite city, to be held the 29th to the 31st. Blog noise [22]Haskell news from the [23]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Dan Piponi (sigfpe): [24]Programming with impossible functions, or how to get along without monads.. * Neil Brown: [25]Graph Layout with Software Transactional Memory and Barriers (plus video!). * Ivan Lazar Miljenovic: [26]If wishes were tests, code would be perfect. * Adam Jones: [27]Lambda Calculus compiler, Part II: Wading in with arithmetic. * FP Lunch: [28]Implementing a Correct Type-Checker for the Simply Typed Lambda Calculus. * Manuel M T Chakravarty: [29]Haskell 2010. * Holumbus: [30]hayoo.info. * Paul Chiusano: [31]Perfect strictness analysis (Part 2). * Paul Chiusano: [32]Perfect strictness analysis (Part 1). * Paul Chiusano: [33]Optional laziness doesn't quite cut it. * Neil Brown: [34]Force-Directed Graph Layout with Barriers and Shared Channels. * Neil Mitchell: [35]Reviewing View Patterns. * JP Moresmau: [36]EclipseFP 1.109.0 is out!. * CS Design Lab, University of Kansas: [37]Special LAMBDA meeting. * Joachim Breitner: [38]arbtt now in Debian. * Neil Mitchell: [39]Haskell DLL's on Windows. * Conal Elliott: [40]Thoughts on semantics for 3D graphics. Quotes of the Week * command: lambdabot will say 'it is forever etched into my memory' and then forget the quote by tomorrow. * copumpkin: orbitz makes [##C++] especially brutal to make people appreciate #haskell more * mtnviewmark: [on the State monad] "If I had a sta-ate, I'd compute it in the morning.... I'd compute it in the evening.... All over this la-and!" * monochrom: dynamic type is poor man's dependent type, they are so poor they can't buy a theorem prover. * Veinor: just remember: you can't spell fundeps without fun. * Botje: i think it's too early to be sticking things into other things .. * Berengal: Haskell is made of sugar and spice and everything nice, plus the mysterious compound X * sproingie: sproingie enables IncoherentInstances and ends up with Sarah Palin in his living room About the Haskell Weekly News New editions are posted to [41]the Haskell mailing list as well as to [42]the Haskell Sequence and [43]Planet Haskell. [44]RSS is also available, and headlines appear on [45]haskell.org. To help create new editions of this newsletter, please see the information on [46]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [47]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17638 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17652 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17649 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17647 6. http://article.gmane.org/gmane.comp.lang.haskell.general/17646 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17645 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17644 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17637 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17636 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17635 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66796 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66770 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66751 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66726 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66722 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66693 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66810 19. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66777 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66723 21. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66616 22. http://planet.haskell.org/ 23. http://haskell.org/haskellwiki/Blog_articles 24. http://blog.sigfpe.com/2009/11/programming-with-impossible-functions.html 25. http://chplib.wordpress.com/2009/11/26/graph-layout-with-software-transactional-memory-and-barriers/ 26. http://ivanmiljenovic.wordpress.com/2009/11/26/if-wishes-were-tests-code-would-be-perfect/ 27. http://blog.finiteimprobability.com/2009/11/25/lambda-calculus-compiler-part-ii-wading-in-with-arithmetic/ 28. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=291 29. http://justtesting.org/post/256283708 30. http://holumbus.fh-wedel.de/blog/?p=27 31. http://pchiusano.blogspot.com/2009/06/perfect-strictness-analysis-part-2.html 32. http://pchiusano.blogspot.com/2009/06/perfect-strictness-analysis-part-1.html 33. http://pchiusano.blogspot.com/2009/05/optional-laziness-doesnt-quite-cut-it.html 34. http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-barriers-and-shared-channels/ 35. http://neilmitchell.blogspot.com/2009/11/reviewing-view-patterns.html 36. http://jpmoresmau.blogspot.com/2009/11/eclipsefp-11090-is-out.html 37. http://www.ittc.ku.edu/csdlblog/?p=20 38. https://www.joachim-breitner.de/blog/archives/352-arbtt-now-in-Debian.html 39. http://neilmitchell.blogspot.com/2009/11/haskell-dlls-on-windows.html 40. http://conal.net/blog/posts/thoughts-on-semantics-for-3d-graphics/ 41. http://www.haskell.org/mailman/listinfo/haskell 42. http://sequence.complete.org/ 43. http://planet.haskell.org/ 44. http://sequence.complete.org/node/feed 45. http://haskell.org/ 46. http://haskell.org/haskellwiki/HWN 47. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From ivan.miljenovic at gmail.com Mon Nov 30 09:15:06 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Mon Nov 30 08:50:12 2009 Subject: [Haskell] ANNOUNCE: graphviz-2999.7.0.0 Message-ID: <873a3wcd5h.fsf@gmail.com> I'm pleased to announce the latest version of my Haskell bindings to the Graphviz [1] suite of tools for visualising graphs. As usual, it is available from Hackage [2]. [1] http://graphviz.org/ [2] http://hackage.haskell.org/package/graphviz Changes in this release include: * Updated and extended functions to interact with the Graphviz tools. This now includes: - a better listing of available output types; - distinguishing file outputs from canvas outputs; - ability to automatically add the correct file extension to file outputs - Return any errors if calling Graphviz failed rather than just printing them to stderr * Improved Color support: - fixed ColorScheme values - explicitly named X11 colors - conversion to/from values from the colour library * Removed OrientationGraph; problems with distinguishing it when parsing from node-based Orientation values; its functionality is duplicated by Rotate. * By default, the generated Dot code is now no longer indented; you can now use the prettyPrint functions in Data.GraphViz to produce readable Dot code. * Added a testsuite; this is buildable by building with --flags=test. Numerous printing and parsing bugs were picked up with this. Plans for the next release: * Determine how to deal with encodings, since Graphviz uses UTF-8 by default; the hSetEncoding function in GHC-6.12 would be ideal, but backwards-incompatible. * Add a generic version of the types in Data.GraphViz.Types that would let people have more fine-grained control over the layout of their graphs by removing the ordering restriction used. Note that this will _not_ be the default, just an option for those that want it. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com