From henglein at diku.dk Wed Dec 2 05:52:56 2009 From: henglein at diku.dk (Fritz Henglein) Date: Wed Dec 2 05:27:42 2009 Subject: [Haskell] 3 full professor positions at DIKU Message-ID: <20091202105256.8B8C4E53F@tyr.diku.dk> The Department of Computer Science at the University of Copenhagen (DIKU, http://www.diku.dk) has openings for up to 3 full professor positions in programming languages and systems (1 or 2 appointments), respectively software development (1 appointment), starting May 2010. For detailed information, including application procedures, please see the full position announcements: Professor in programming languages and systems: http://www.diku.dk/ominstituttet/ledige_stillinger/professorinsoftware/ Professor in software development: http://www.diku.dk/ominstituttet/ledige_stillinger/professorinprogramming/ Please note that the software development position is open to outstanding candidates with a technically-oriented research record and ambitions to bridge to user-oriented aspects. Enquiries about the positions can be made to department head Martin Zachariasen---see the announcements for contact information. Deadline for application: December 17th, 2009, 12 noon (CET). From byorgey at seas.upenn.edu Wed Dec 2 22:10:11 2009 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Wed Dec 2 21:44:55 2009 Subject: [Haskell] Second Call for Copy: Monad.Reader Issue 15 Message-ID: <20091203031010.GA31664@seas.upenn.edu> It's not too late to write something for Issue 15 of the Monad.Reader! Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 15 is **Friday, January 8, 2010** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki-page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. I am also happy to provide feedback on draft versions before the submission deadline. Please submit articles for the next issue to me by e-mail (byorgey at cis.upenn.edu). Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll sort something out. From tomahawkins at gmail.com Thu Dec 3 03:02:19 2009 From: tomahawkins at gmail.com (Tom Hawkins) Date: Thu Dec 3 02:37:02 2009 Subject: [Haskell] Interesting experiences of test automation in Haskell? Automation of Software Test 2010 In-Reply-To: <727FFF824663494EBF5DF9E7E2B25764@HALL> References: <727FFF824663494EBF5DF9E7E2B25764@HALL> Message-ID: <594c1e830912030002x7458cc16tc75bc668fcd5140@mail.gmail.com> On Fri, Nov 27, 2009 at 9:30 PM, John Hughes wrote: > 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! Recently we added a unit testing framework to Atom: a haskell DSL for hard realtime embedded applications. The framework hooks into Atom's assertion and functional coverage statements and provides some basic randomization utilities for automatic test generation. We've used this framework to test the embedded software of Eaton's parallel hydraulic hybrid application (HLA). One nice feature we've incorporated for our application is in the event of an assertion violation, simulation data is formated such that we can use the same analysis and debug tools that we use for real vehicle telemetry. I don't think we can make it to Cape Town, but I'll see if one of us can write up a case study. (Shruti, Tejas, Jake, any interest?) Here's an example test log from Language.Atom.Unit: pass: processTest1 cycles = 1000 pass: dualProcessTest cycles = 1000 pass: processNoDeactivationGuard cycles = 1000 pass: processNoActivationGuard cycles = 1000 pass: processDuelingProcesses cycles = 1000 pass: arbiterTest1 cycles = 1000 pass: arbiterTest2 cycles = 1000 pass: arbiterTest3 cycles = 1000 pass: arbiterTest8 cycles = 1000 pass: arbiterTest10 cycles = 1000 pass: absDisengagementTest cycles = 35000 pass: cruiseControlDisengagementTest cycles = 35000 pass: engineSpeedDisengagementTest cycles = 35000 pass: pumpSpeedDisengagementTest cycles = 35000 pass: ignitionDisengagementTest cycles = 35000 pass: selectedGearDisengagementTest cycles = 35000 pass: currentGearDisengagementTest cycles = 35000 pass: modeDisengagementTest cycles = 35000 pass: commissioningProcessDisengagementTest cycles = 35000 pass: canEEC1DisengagementTest cycles = 35000 pass: canEEC2DisengagementTest cycles = 35000 pass: canETC1DisengagementTest cycles = 35000 pass: canETC2DisengagementTest cycles = 35000 pass: canEBCDisengagementTest cycles = 35000 pass: canECCDisengagementTest cycles = 35000 pass: driverisolationFaultDisengagementTest cycles = 35000 pass: drivermodeDrainFaultDisengagementTest cycles = 35000 pass: drivermodeFillFaultDisengagementTest cycles = 35000 pass: drivermainBypassFaultDisengagementTest cycles = 35000 pass: driverchargeBypassFaultDisengagementTest cycles = 35000 pass: driverclutch1FaultDisengagementTest cycles = 35000 pass: driverclutch2FaultDisengagementTest cycles = 35000 pass: driverclutch3FaultDisengagementTest cycles = 35000 pass: driverpumpFaultDisengagementTest cycles = 35000 pass: drivermotorFaultDisengagementTest cycles = 35000 pass: coolerFanOnOffTest cycles = 40000 pass: stateTransitionTest cycles = 75000 pass: swashCmdInBootstrapTest cycles = 40000 pass: brakePressureAboveRangeAndTxSpeedDisengagementTest cycles = 35000 pass: brakePressureAboveRangeDisengagementTest cycles = 35000 pass: accumulatorPressureBelowRangeDisengagementTest cycles = 35000 pass: accumulatorPressureAboveRangeDisengagementTest cycles = 35000 pass: sawsh1BelowRangeDisengagementTest cycles = 35000 pass: swash1AboveRangeDisengagementTest cycles = 35000 pass: swash2BelowRangeDisengagementTest cycles = 35000 pass: swash2AboveRangeDisengagementTest cycles = 35000 pass: swashDiffOnBoundaryDisengagementTest cycles = 35000 pass: swashDiffAboveRangeDisengagementTest cycles = 35000 pass: pumpCaseOilTempCAboveRangeDisengagementTest cycles = 35000 pass: pumpCaseOilTempCBelowRangeDisengagementTest cycles = 35000 pass: pumpCaseOilTempCBoundaryDisengagementTest cycles = 35000 pass: reservoirOilTempCAboveRangeDisengagementTest cycles = 35000 pass: reservoirOilTempCBelowRangeDisengagementTest cycles = 35000 pass: reservoirOilTempCBoundaryDisengagementTest cycles = 35000 pass: tempSensorMiscompareAboveRangeDisengagementTest cycles = 35000 pass: tempSensorMiscompareBoundaryDisengagementTest cycles = 35000 pass: reservoirOilTempCTooExtremeDisengagementTest cycles = 35000 pass: reservoirOilTempCTooExtremeBoundaryDisengagementTest cycles = 35000 pass: reservoirOilLevelGalLDisengagementTest cycles = 35000 pass: reservoirOilLevelGalHDisengagementTest cycles = 35000 pass: pumpSpeedAboveRangeLDisengagementTest cycles = 35000 pass: pumpSpeedAboveRangeHDisengagementTest cycles = 35000 pass: accumOverPressureBoundaryDisengagementTest cycles = 35000 pass: accumOverPressureAboveRangeDisengagementTest cycles = 35000 pass: filterPressureBelowRangeDisengagementTest cycles = 35000 pass: filterPressureAboveRangeDisengagementTest cycles = 35000 pass: 5VSupplyBelowRangeDisengagementTest cycles = 35000 pass: 5VSupplyAboveRangeDisengagementTest cycles = 35000 pass: 12VSupplyBelowRangeDisengagementTest cycles = 35000 pass: 12VSupplyAboveRangeDisengagementTest cycles = 35000 pass: stuckEngagedDisengagementTest cycles = 35000 pass: stuckOilLevelDisengagementTest cycles = 35000 pass: clutchdisengagementFaultTest cycles = 40000 pass: clutchSensorMiscompareFault cycles = 40000 pass: clutchSensorMiscompareFaultAbovePumpSpeedandabsRangeTest cycles = 40000 pass: clutchSensorMiscompareFaultAbovePumpSpeedandBelowabsRangeTest cycles = 40000 pass: clutchSensorMiscompareFaultBoundaryTest cycles = 40000 pass: clutchSensorMiscompareFaultAboveRangeTest cycles = 40000 pass: unexpectedDisengagementTest cycles = 40000 pass: failedEngagementAttemptsTest cycles = 40000 pass: fanOffTest cycles = 30000 pass: evuTest cycles = 30000 pass: swashCalTest cycles = 40000 pass: seedKey32Test1 cycles = 100 pass: seedKey32Test2 cycles = 100 pass: seedKey32Test3 cycles = 100 pass: seedKey32Test4 cycles = 100 pass: seedKey32Test5 cycles = 100 pass: seedKey32Test6 cycles = 100 pass: seedKey32Test7 cycles = 100 Total Passing Tests : 90 / 90 Total Simulation Cycles : 2650700 Total Function Coverage : 102 / 102 GREEN LIGHT > > 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/ > > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell > > From gmh at Cs.Nott.AC.UK Thu Dec 3 05:58:01 2009 From: gmh at Cs.Nott.AC.UK (Graham Hutton) Date: Thu Dec 3 05:38:28 2009 Subject: [Haskell] PhD studentships in Nottingham Message-ID: <23013.1259837881@cs.nott.ac.uk> Dear all, The School of Computer Science at the University of Nottingham is advertising 3 PhD studentships, with functional programming being one of the target areas. Further information about the functional programming lab within the School is available from: http://fp.cs.nott.ac.uk/ If you would like to apply, please following the instructions in the advert below. The deadline is 8th January 2010. Best wishes, Graham Hutton +-----------------------------------------------------------------+ The School of Computer Science of the University of Nottingham invites applications for 3 PhD studentships. The studentships are for 3.5 years and include 13,290 per year maintenance grant and UK/EU tuition fees. The applicants need to apply through the University postgraduate admissions system http://pgstudy.nottingham.ac.uk/apply-for-postgraduate-courses.aspx The deadline for applications is the 8th of January 2010. The applications are invited in the areas listed below. Please contact the academics listed for the research area first if you are interested in applying for a PhD in their area. Functional Programming (contact Henrik Nilsson, Graham Hutton, Thorsten Altenkirch, Venanzio Capretta: {nhn, gmh, txa, vxc} at cs.nott.ac.uk) Computational Photography and Content-based Image Retrieval (contact Guoping Qiu, qiu at cs.nott.ac.uk) Computer Vision and Graphics (contact Bai Li, bai at cs.nott.ac.uk) Computational Finance (contact Rong Qu, rxq at cs.nott.ac.uk) Adaptive and Learning Systems (contact Jon Garibaldi, jmg at cs.nott.ac.uk) Intelligent Agents (contact Brian Logan and Natasha Alechina, {bsl, nza} at cs.nott.ac.uk) Computational Systems and Synthetic Biology (contact Natalio Krasnogor, nxk at cs.nott.ac.uk) Simulation of Complex Systems and Computational Modelling and Data Mining (contact Uwe Aickelin, uxa at cs.nott.ac.uk) Data mining (contact Jaume Bacardit, jqb at cs.nott.ac.uk) Document Engineering (contact Steven Bagley, srb at cs.nott.ac.uk) Opportunistic networking (contact Milena Radenkovic, mvr at cs.nott.ac.uk) Reactive Environments (contact Holger Schnadelbach, Dave Kirk: hms,dsk at cs.nott.ac.uk) Intelligent Multilevel Search Methodologies (contact Ender Ozcan, exo at cs.nott.ac.uk) +-----------------------------------------------------------------+ | Dr Graham Hutton Email : gmh@cs.nott.ac.uk | | Functional Programming Lab | | School of Computer Science Web : www.cs.nott.ac.uk/~gmh | | University of Nottingham | | Jubilee Campus, Wollaton Road Phone : +44 (0)115 951 4220 | | Nottingham NG8 1BB, UK | +-----------------------------------------------------------------+ From c.grelck at uva.nl Thu Dec 3 07:10:30 2009 From: c.grelck at uva.nl (Clemens Grelck) Date: Thu Dec 3 06:45:17 2009 Subject: [Haskell] Call for papers: PAPP 2010, 7th International Workshop on Practical Aspects of High-level Parallel Programming Message-ID: <4B17AAB6.6030800@uva.nl> --------------------------------------------------------------------- Please accept our apologies if you have received multiple copies. Please feel free to distribute it to those who might be interested. --------------------------------------------------------------------- ---------------------------------------------------------- CALL FOR PAPERS PAPP 2010 Seventh International Workshop on Practical Aspects of High-level Parallel Programming http://lacl.univ-paris12.fr/gava/PAPP2010/ part of ICCS 2010 The International Conference on Computational Science May 31- June 2, 2010, University of Amsterdam, The Netherlands. ---------------------------------------------------------- AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Bill McColl's post "Sequential Computing Considered Harmful" is an excellent summary of today's situation. Sequential computing cannot go further. Major companies in the computing industry now recognizes the urgency of reorienting an entire industry towards massively parallel computing (Think Parallel or Perish). Parallel and grid computing are solutions to the increasing need for computing power. The trend is towards the increase of cores in processors, the number of processors and the need for scalable computing everywhere. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Thus high-level approaches should play a key role in the shift to scalable computing in every computer. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Also, high level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimization of high-level programming languages, semantics of parallel languages, formal verification, design or certification of libraries, middlewares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hotspot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), application of proof assistants to parallel applications, applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications (safety, expressivity, efficiency, etc.). Thus the Seventh PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. TOPICS We welcome submission of original, unpublished papers in English on topics including: * applications in all fields of high-performance computing and visualisation (using high-level tools) * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * Program verification and Formal verification of parallel applications/ libraries/languages or parallel computing in computer-assisted reasoning * high-level parallel language design, implementation and optimisation * modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * benchmarks and experiments using such languages and tools * industrial uses of a high-level parallel language PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the conference proceedings published by Elsevier Science in the open-access Procedia Computer Science series, as part of the ICCS proceedings. Submission must be done through the ICCS website: http://www.iccs-meeting.org/iccs2010/papers/upload.php We invite you to submit a full paper of 10 pages formatted according to the rules of Procedia Computer Science (see http://www.elsevier.com/wps/find/journaldescription.cws_home/719435/description#description), describing new and original results, no later than January 11, 2010 -HARD DEADLINE. Submission implies the willingness of at least one of the authors to register and present the paper. An early email to "gava at univ-paris12.fr" with your intention to submit a paper would be greatly appreciated (especially if you have doubts about the relevance of your paper). Accepted papers should be presented at the workshop and extended and revised versions could be published in a special issue of Scalable Computing: Practice and Experience, provided revisions suggested by the referees are made. IMPORTANT DATES * January 11, 2010 - Full paper due (HARD DEADLINE) * February 15, 2010 - Notification * March 1, 2010 - Camera-ready paper due * September, 2010 - Journal version due PROGRAM COMMITTEE * Marco Aldinucci (University of Torino, Italy) * Anne Benoit (ENS Lyon, France) * Umit V. Catalyurek (The Ohio State University, USA) * Emmanuel Chailloux (University of Paris 6, France) * Fr?d?ric Dabrowski (University of Orl?ans, France) * Fr?d?ric Gava (University Paris-East (Paris 12), France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (University of Amsterdam, Netherlands) * Hideya Iwasaki (The University of Electro-communications, Japan) * Christoph Kessler (Linkopings Universitet, Sweden) * Rita Loogen (University of Marburg, Germany) * Kiminori Matsuzaki (Kochi University of Technology, Japan) * Samuel Midkiff (Purdue University, USA) * Susanna Pelagatti (University of Pisa, Italy) * Bruno Raffin (INRIA, France) * Casiano Rodriguez-Leon (University La Laguna, Spain) ORGANIZERS Dr. Anne BENOIT Laboratoire d'Informatique du Parall?lisme Ecole Normale Sup?rieure de Lyon 46 All?e d'Italie 69364 Lyon Cedex 07 - France Dr. Fr?d?ric GAVA Laboratoire d'algorithmique, complexit? et logique Universit? de Paris-Est (Paris 12) 61 avenue du G?n?ral de Gaulle 94010 Cr?teil cedex - France -- Dr Clemens Grelck University of Amsterdam University of Hertfordshire http://www.sac-home.org/~cg From c.grelck at uva.nl Thu Dec 3 15:07:38 2009 From: c.grelck at uva.nl (Clemens Grelck) Date: Thu Dec 3 14:42:20 2009 Subject: [Haskell] SaC Tutorial at PPoPP 2010 Message-ID: <4B181A8A.3050607@uva.nl> --------------------------------------------------------------------- Please accept our apologies if you have received multiple copies. Please feel free to distribute it to those who might be interested. --------------------------------------------------------------------- ********************************************************************* * * * Call for Participation * * * * TUTORIAL * * on * * SAC AND ITS AUTO-PARALLELISING COMPILER SAC2C * * * * January 9, 2010 * * Bangalore, India * * * * 15th ACM SIGPLAN Annual Symposium on * * Principles and Practice of Parallel Programming * * (PPoPP 2010) * * * * http://events.sac-home.org/ppopp/ * * * ********************************************************************* Background and Content The non-deterministic semantics of concurrent execution of main-stream languages, combined with the difficulties in debugging concurrency-specific bugs like race conditions, render software engineering for concurrent architectures challenging and time consuming. The data-parallel approach towards concurrent programming with its deterministic semantics and simple synchronisation seems to be a good fit to solve these problems. With the availability of commercial frameworks for data-parallel and stream computation like CUDA and Intel's Ct, data-parallel programming seems to be ready for the main-stream. However, given the number of "interesting" architectures available, using a hardware bound implementation language cannot be the solution. In this tutorial we present a completely implicit, architecture neutral approach for programming modern multi- and many-core architectures. It is based on a high-level language featuring a data-parallel programming style. SaC (for Single Assignment C) is a functional array language which combines a C-like syntax with a purely functional semantics. This approach enables successful auto-parallelisation on various architectures including SMPs and GPGPUs. Over the last 15+ years, we have developed the auto-parallelising compiler sac2c. With more than 300,000 lines of code, it implements over 50 high-level program optimisations. The functional basis of SAC enables these optimisations to systematically transform high-level specifications into fine-tuned, target-architecture-specific code. The generated intermediate C-code can be compiled using any C99-compliant compiler. The runtime system of sac2c features, among other aspects, a micro-thread scheduler as well as a tailor-made, multi-threaded memory management for highly efficient concurrent execution. Organisation The tutorial consists of four parts: * an introduction into the concept of data-parallelism, i.e., tackling the question of what can be expressed in a data-parallel fashion and how, * a practical session where examples are being run in an interactive fashion, * an overview of the optimisations applied by sac2c to achieve excellent sequential and parallel runtime performance on various platforms, and * a practical session where several examples and their compilation process are being studied in an interactive fashion. Important dates * Early registration deadline: December 4, 2009 * Late registration deadline: walk in * Tutorial: January 9, 2010 * PPoPP: January 9-14, 2010 Organisers * Sven-Bodo Scholz, University of Hertfordshire, Hatfield, UK * Clemens Grelck, University of Amsterdam, Netherlands * Stephan Herhut, University of Hertfordshire, Hatfield, UK -- Dr Clemens Grelck University of Amsterdam University of Hertfordshire http://www.sac-home.org/~cg From jfredett at gmail.com Sat Dec 5 02:17:52 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sat Dec 5 01:52:29 2009 Subject: [Haskell] Haskell Weekly News: Issue 142 - December 05, 2009 Message-ID: <4b1a0920.9515f10a.0ea1.ffffe360@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091205 Issue 142 - December 05, 2009 --------------------------------------------------------------------------- Welcome to issue 142 of HWN, a newsletter covering developments in the [1]Haskell community. Occasionally, I have something silly or clever to say here. Usually I give a summary of the weeks news and end it with a bit of a cliche tagline, however, this is finals week, and as such, there is absolutely no brain cells left working to come up with any cleverness for here. I'll see you next week with (hopefully) more ability for humor. Until next week, the Haskell Weekly News! Announcements error-message. Gregory Crosswhite [2]announced a package for handling errors in haskell. To quote his message directly, 'If there is one thing that we really don't have enough of in Haskell, it is *ways to handle errors*!' atom-0.1.3. Tom Hawkins [3]announced a new version of the Atom DSL for designing hard realtime embedded software. Blueprint 0.1 -- PREVIEW. Gregory Crosswhite [4]announced a preview version of his 'Blueprint' configuration package. haskell-mode 2.7.0. Svein Ove Aas [5]announced another release of Haskell-mode for Emacs graphviz-2999.7.0.0. Ivan Lazar Miljenovic [6]announced a new version of his set of bindings to the graphviz tools for visualizing graphs. Haskell Job Openings (Pune, IN). Tom Hawkins [7]announced some job openings in Eaton's engineering center in Pune, India. SaC Tutorial at PPoPP 2010. Clemens Grelck [8]announced a tutorial to be held at PPoPP on SAC and it's auto-parallelizing compiler SAC2C. Call for papers: PAPP 2010, 7th International Workshop on Practical Aspects of High-level Parallel Programming. Clemens Grelck [9]announced a call for papers for the Seventh International Workshop on Practical Aspects of High-level Parallel Programming. PhD Studentships in Nottingham. Graham Hutton [10]announced some PhD openings at the University of Nottingham. Second Call for Copy: Monad.Reader Issue 15. Brent Yorgey [11]announced a second call for copy for the Monad.Reader. 3 full professor positions at DIKU. Fritz Henglein [12]announced three open professor positions at the the Department of Computer Science at the University of Copenhagen ([13]DIKU). Hubris 0.0.2, the Ruby-Haskell bridge. Mark Wotton [14]announced a new version of the Hubris package is now available on hackage. Discussion You are in a twisty maze of concurrency libraries, all different ... Patrick Caldon [15]asked about the 'right' concurrency package to use for his project. Greetings! 2D Graphics? M Xyz [16]asked (enthusiatically) about different ways to do 2-dimensional graphics in Haskell. Wikipedia article. Simon Marlow [17]rallied us all into fixing the (or at least starting to fix) wikipedia page for Haskell. Great Programs to Read? Michael Lesniak [18]asked about what programs were worth reading. 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! * Michael Snoyman: [21]String-like. * Claude Heiland-Allen: [22]Heist: dataflow algebra. * Adam Jones: [23]Lambda Calculus Compiler: Part III: First-Order Functions. * Holumbus: [24]Hayoo! Update ⦠Again. * Mikael Vejdemo Johansson (Syzygy-): [25][MATH198] Lecture 10 (last lecture) posted. * Neil Brown: [26]Automated Wiring of Message-Passing Processes. * Computer Systems Design Laboratory at the University of Kansas: [27]ChalkBoard Release. * Bryan O'Sullivan: [28]Dense? Dense, you say?. * Ivan Lazar Miljenovic: [29]Waddaya know, testing WORKS!. * Ivan Lazar Miljenovic: [30]If wishes were tests, code would be perfect. * Ivan Lazar Miljenovic: [31]The Problems with Graphviz. Quotes of the Week * Badger: one does not simply >>= into mordor * Apocalisp: data CanHaz a = Haz a | ButIEatedIt * Apocalisp: You can't have your baby and eat it too * Dave_Benjamin: please talk to your son or daughter about parametric polymorphism * Cale: Beginners are confusing to beginners. I move that we remove them from the language altogether. * monochrom: I am 17-ary, going on 18-ary, I can take curry of you * jmillikin: [the real world is] an implementation detail of IO, pay it no mind * monochrom,ezyang: The Principle Of Idiot Savant: any sufficiently misguided opinion is indistinguishable from deep insight * Cale: I swear that most of higher-dimensional category theory must have been arrived at by some guys sitting around in a room with a blackboard and saying "What if a drew a diagram like *THIS*!?" and drawing some insane scribble up on the blackboard, and then everyone tries to figure out how to turn it into meaningful mathematics. * jbe: Here I am, happy my code compiles, and the runtime is thumbing its nose at Turing. * Ferdirand: I was TA for a C++ programming course aimed at 1st year physics once. Some girl asked for help "i wrote pseudo-code but I cannot translate it to C++". Her pseudo-code was valid haskell. I cried. * mmorrow: [regarding excessive use of categorical recursion schemes] a morphasm? * copumpkin: I'm on a rollomorphism * dons: but rumours are remarkably common when it comes to haskell * monochrom: If you read a haskell book or an FP book, by chapter 5 it's already doing data structures. It's chapter 10 in imperative books. About the Haskell Weekly News New editions are posted to [32]the Haskell mailing list as well as to [33]the Haskell Sequence and [34]Planet Haskell. [35]RSS is also available, and headlines appear on [36]haskell.org. To help create new editions of this newsletter, please see the information on [37]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [38]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67149 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67090 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66924 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66923 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66920 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66904 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17661 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17660 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17659 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17657 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17656 13. http://www.diku.dk/ 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17653 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67211 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67184 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67158 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66917 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://snoyberg.wordpress.com/2009/12/04/string-like/ 22. http://claudiusmaximus.goto10.org/cm/2009-12-04_heist_dataflow_algebra.html 23. http://blog.finiteimprobability.com/2009/12/03/lambda-calculus-compiler-part-iii-first-order-functions/ 24. http://holumbus.fh-wedel.de/blog/?p=28 25. http://blog.mikael.johanssons.org/archive/2009/12/math198-lecture-10-last-lecture-posted/ 26. http://chplib.wordpress.com/2009/12/02/automated-wiring-of-message-passing-processes/ 27. http://www.ittc.ku.edu/csdlblog/?p=25 28. http://www.serpentine.com/blog/2009/12/01/dense-dense-you-say/ 29. http://ivanmiljenovic.wordpress.com/2009/11/17/waddaya-know-testing-works/ 30. http://ivanmiljenovic.wordpress.com/2009/11/26/if-wishes-were-tests-code-would-be-perfect/ 31. http://ivanmiljenovic.wordpress.com/2009/11/30/the-problems-with-graphviz/ 32. http://www.haskell.org/mailman/listinfo/haskell 33. http://sequence.complete.org/ 34. http://planet.haskell.org/ 35. http://sequence.complete.org/node/feed 36. http://haskell.org/ 37. http://haskell.org/haskellwiki/HWN 38. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From gtener at gmail.com Sat Dec 5 13:47:33 2009 From: gtener at gmail.com (=?UTF-8?Q?Krzysztof_Skrz=C4=99tnicki?=) Date: Sat Dec 5 13:22:10 2009 Subject: [Haskell] ANN: readline-statevar-1.0.1.0 Message-ID: <220e47b40912051047k2cfac6bbx50727f6827811597@mail.gmail.com> Hello I am happy to announce a release of small package called readline-statevar. It's a small wrapping library around readline, which in turn wraps libreadline. The reason I wrote it is because I wasn't happy with the API of readline. It was composed of tons of functions like setX/getX, where there could be just one StateVar instead, yielding OpenGL-kind API. This version aims to match readline-1.0.1.0. (Hence the version number chosen). I wrote it mostly manually, with a little help from my emacs-fu, so there is a chance I missed a thing or two. There is git repo available [1], along with issue tracker [2] and Hackage page [3]. Feel encouraged to: > cabal update > cabal install readline-statevar And give it a try! Best regards Krzysztof Skrz?tnicki [1] http://github.com/Tener/haskell-readline-statevar/ [2] http://github.com/Tener/haskell-readline-statevar/issues [3] http://hackage.haskell.org/package/readline-statevar -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091205/9f676cd2/attachment.html From jochem at functor.nl Sun Dec 6 14:01:35 2009 From: jochem at functor.nl (Jochem Berndsen) Date: Sun Dec 6 13:36:10 2009 Subject: [Haskell] ANN: readline-statevar-1.0.1.0 In-Reply-To: <220e47b40912051047k2cfac6bbx50727f6827811597@mail.gmail.com> References: <220e47b40912051047k2cfac6bbx50727f6827811597@mail.gmail.com> Message-ID: <4B1BFF8F.9050302@functor.nl> nerds From dons at galois.com Mon Dec 7 12:16:25 2009 From: dons at galois.com (Don Stewart) Date: Mon Dec 7 11:50:57 2009 Subject: [Haskell] The Haskell Web News: December 2009 Edition Message-ID: <20091207171625.GA5314@whirlpool.galois.com> The Haskell Web News is a monthly summary of the hottest news about the Haskell programming language, as found in our online communities. If you want to catch up with what?s been happening in Haskell, this might be the journal for you. http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ What?s been happening with the Haskell programming language for the past month, as voted by readers of The Haskell Reddit. This is the first edition of the Web News, so feedback on the content, schedule and goals is welcome. -- Don From deniz.a.m.dogan at gmail.com Mon Dec 7 12:25:46 2009 From: deniz.a.m.dogan at gmail.com (Deniz Dogan) Date: Mon Dec 7 12:00:35 2009 Subject: [Haskell] Re: [Haskell-cafe] The Haskell Web News: December 2009 Edition In-Reply-To: <20091207171625.GA5314@whirlpool.galois.com> References: <20091207171625.GA5314@whirlpool.galois.com> Message-ID: <7b501d5c0912070925t20723b90o7ce5b5eec87e1e33@mail.gmail.com> 2009/12/7 Don Stewart : > The Haskell Web News is a monthly summary of the hottest news about the > Haskell programming language, as found in our online communities. If you > want to catch up with what?s been happening in Haskell, this might be > the journal for you. > > ? ?http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ > > What?s been happening with the Haskell programming language for the past > month, as voted by readers of The Haskell Reddit. This is the first > edition of the Web News, so feedback on the content, schedule and goals > is welcome. > > -- Don > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > I think the correct URL should be: http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ Yours didn't work for me. -- Deniz Dogan From korpios at korpios.com Mon Dec 7 12:28:10 2009 From: korpios at korpios.com (Tom Tobin) Date: Mon Dec 7 12:02:44 2009 Subject: [Haskell] Re: [Haskell-cafe] The Haskell Web News: December 2009 Edition In-Reply-To: <7b501d5c0912070925t20723b90o7ce5b5eec87e1e33@mail.gmail.com> References: <20091207171625.GA5314@whirlpool.galois.com> <7b501d5c0912070925t20723b90o7ce5b5eec87e1e33@mail.gmail.com> Message-ID: On Mon, Dec 7, 2009 at 11:25 AM, Deniz Dogan wrote: > 2009/12/7 Don Stewart : >> The Haskell Web News is a monthly summary of the hottest news about the >> Haskell programming language, as found in our online communities. If you >> want to catch up with what?s been happening in Haskell, this might be >> the journal for you. >> >> ? ?http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ > > I think the correct URL should be: > http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ Actually, I think it's: http://haskellwebnews.wordpress.com/2009/12/06/whats-new-in-haskell-december-2009/ From dons at galois.com Mon Dec 7 12:29:09 2009 From: dons at galois.com (Don Stewart) Date: Mon Dec 7 12:03:38 2009 Subject: [Haskell] Re: [Haskell-cafe] The Haskell Web News: December 2009 Edition In-Reply-To: <7b501d5c0912070925t20723b90o7ce5b5eec87e1e33@mail.gmail.com> References: <20091207171625.GA5314@whirlpool.galois.com> <7b501d5c0912070925t20723b90o7ce5b5eec87e1e33@mail.gmail.com> Message-ID: <20091207172909.GC5314@whirlpool.galois.com> Deniz: > I think the correct URL should be: Oops, well spotted. The original link will work now. http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ From deniz.a.m.dogan at gmail.com Mon Dec 7 12:30:27 2009 From: deniz.a.m.dogan at gmail.com (Deniz Dogan) Date: Mon Dec 7 12:05:14 2009 Subject: [Haskell] Re: [Haskell-cafe] The Haskell Web News: December 2009 Edition In-Reply-To: References: <20091207171625.GA5314@whirlpool.galois.com> <7b501d5c0912070925t20723b90o7ce5b5eec87e1e33@mail.gmail.com> Message-ID: <7b501d5c0912070930i1fe4ac85rb33e09afe1b52782@mail.gmail.com> 2009/12/7 Tom Tobin : > On Mon, Dec 7, 2009 at 11:25 AM, Deniz Dogan wrote: >> 2009/12/7 Don Stewart : >>> The Haskell Web News is a monthly summary of the hottest news about the >>> Haskell programming language, as found in our online communities. If you >>> want to catch up with what?s been happening in Haskell, this might be >>> the journal for you. >>> >>> ? ?http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ >> >> I think the correct URL should be: >> http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ > > Actually, I think it's: > > http://haskellwebnews.wordpress.com/2009/12/06/whats-new-in-haskell-december-2009/ > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > Of course, that's what I meant. :) -- Deniz Dogan From bulat.ziganshin at gmail.com Mon Dec 7 12:31:16 2009 From: bulat.ziganshin at gmail.com (Bulat Ziganshin) Date: Mon Dec 7 12:05:55 2009 Subject: [Haskell] Re: [Haskell-cafe] The Haskell Web News: December 2009 Edition In-Reply-To: <20091207171625.GA5314@whirlpool.galois.com> References: <20091207171625.GA5314@whirlpool.galois.com> Message-ID: <1002344956.20091207203116@gmail.com> Hello Don, Monday, December 7, 2009, 8:16:25 PM, you wrote: > http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ can we make download counts for individual packages available? my own program (http://freearc.org) has about 10k downloads/month so i doubt what place it may have among all haskell applications :) -- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com From Jean-Christophe.Filliatre at lri.fr Mon Dec 7 15:56:46 2009 From: Jean-Christophe.Filliatre at lri.fr (=?UTF-8?B?SmVhbi1DaHJpc3RvcGhlIEZpbGxpw6J0cmU=?=) Date: Mon Dec 7 15:31:14 2009 Subject: [Haskell] Call for Participation: PLPV 2010 Message-ID: <4B1D6C0E.7060808@lri.fr> ********************************************************************* CALL FOR PARTICIPATION PLPV 2010 The Fourth ACM SIGPLAN Workshop on Programming Languages meets Program Verification 19 January 2010 Madrid, Spain To be held in conjunction with POPL 2010 http://slang.soe.ucsc.edu/plpv10/ ********************************************************************* IMPORTANT DATES Hotel reservation deadline: December 28, 2009 (Monday) VENUE PLPV'10 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid. REGISTRATION To register for PLPV'10, follow the link from the POPL 2010 page, at http://www.cse.psu.edu/popl/10/ SCOPE The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic and/or structural properties of the programming language. One example is dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications, possibly with programmer-provided proof terms. Another example is extended static checking systems like ESC/Java and Spec#, which incorporate pre- and postconditions along with a static verifier for these contracts. INVITED SPEAKER Gilles Barthe, Madrid Instutite for Advanced Studies PRELIMINARY PROGRAM ---------------------- Invited Talk (9:00 - 10:00) * CertiCrypt: Formal Certification of Code-Based Cryptographic Proofs Gilles Barthe, Madrid Instutite for Advanced Studies Session 1 (10:30 - 12:00) * Singleton types here, Singleton types there, Singleton types everywhere Stefan Monnier and David Haguenauer * Operating system development with ATS Matthew Danish and Hongwei Xi * Modular Reasoning about Invariants over Shared State with Interposed Data Members Stephanie Balzer and Thomas Gross Session 2 (2:00 - 3:00) * Resource Typing in Guru Aaron Stump and Evan Austin * Free Theorems for Functional Logic Programs Jan Christiansen, Daniel Seidel and Janis Voigtl??nder Discussion (3:00 - 3:30) * Status update and discussion of the Trellys Project Session 3 (4:00 - 5:00) * Arity-generic datatype-generic programming Stephanie Weirich and Chris Casinghino * Challenge Benchmarks for Veri???cation of Real-time Programs Tomas Kalibera, Gary Leavens and Jan Vitek ---------------------- PROGRAM CHAIRS * Cormac Flanagan (University of California, Santa Cruz) * Jean-Christophe Filli??tre (CNRS) PROGRAM COMMITTEE * Adam Chlipala (Harvard University) * Ranjit Jhala (University of California, San Diego) * Joseph Kiniry (University College Dublin) * Rustan Leino (Microsoft Research) * Xavier Leroy (INRIA Paris-Rocquencourt) * Conor McBride (University of Strathclyde) * Andrey Rybalchenko (Max Planck Institute for Software Systems) * Tim Sheard (Portland State University) * Stephanie Weirich (University of Pennsylvania) From jv at informatik.uni-bonn.de Tue Dec 8 01:05:50 2009 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Tue Dec 8 00:40:12 2009 Subject: [Haskell] Lots of Haskell at PEPM 2010 - Call for Participation Message-ID: <4B1DECBE.1030801@informatik.uni-bonn.de> Hi all, If you are planning to go to Madrid in January, for POPL, don't forget registering for PEPM as well! If you haven't yet been planning to go, maybe you want to reconsider, for PEPM if not for POPL. Why, you ask? Well, the PEPM program has *lots* of Haskell this year. Indeed, no fewer than 10 of the 21 presentations are directly related to Haskell. And the other papers are great, too, and many of them will be interesting to Haskell folk as well. Scan the speakers and titles below, and you will know why I think you won't want to miss out on that one. Best regards, Janis. =============================================================== 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 simon at joyful.com Sat Dec 12 03:41:37 2009 From: simon at joyful.com (Simon Michael) Date: Sat Dec 12 03:15:52 2009 Subject: [Haskell] hledger 0.7 released Message-ID: I'm pleased to announce hledger 0.7. Thanks to Marko Koci? who contributed many fixes for hlint warnings. To install/upgrade: cabal update && cabal install hledger [-fweb] [- fvty] Documentation: http://hledger.org Release notes: * price history support (first cut): P directives now work, though differently from c++ ledger. Each posting amount takes its fixed unit price from the price history (or @) when available. This is simple and useful for things like foreign currency expenses (but not investment tracking). Like ledger, balance and register don't show amount prices any more, and don't separate differently-priced amounts. Unlike ledger, print shows all amount prices, and supports -B. * --effective option, will use transactions' effective dates if any * convert: new rules file format, find/create rules file automatically, more robust parsing, more useful --debug output * print: always sort by date, fix long account name truncation, align amounts, show end of line comments, show all amounts for clarity (don't elide the final balancing amount) * ui: use vty 4, fixes non-ascii and gnome terminal problems (issues #3, #4) * web: allow data entry, react to data file changes, better layout, help links, remove histogram command and filter fields for now, fix bad localhost redirect, filter form did not work in eg firefox (issue #7), reset link did not work in all browsers * parsing: require whitespace between date and status code, allow (and ignore) a time in price records, better error messages, non-zero exit code on parse failure * display non-ascii error messages properly (issue #5) * fix an arithmetic bug that occasionally rejected valid transactions * fix a regex bug in showtree * don't break if HOME is undefined * --debug now implies --verbose * add functional tests like ledger's, use test-framework for speedy running, release shelltestrunner as a separate package * many hlint cleanups (Marko Koci?) * many site and documentation updates Stats: 2 contributors, 175 days since release, 182 commits, 3320 non-test code lines, 97 tests, 53% test coverage, performance: similar (http://hledger.org/profs/200912111852.bench) Best, -Simon From jfredett at gmail.com Sun Dec 13 18:45:29 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sun Dec 13 18:19:44 2009 Subject: [Haskell] Haskell Weekly News: Issue 142 - December 13, 2009 Message-ID: <4b257c99.9553f10a.126f.fffff617@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091213 Issue 142 - December 13, 2009 --------------------------------------------------------------------------- Welcome to issue 142 of HWN, a newsletter covering developments in the [1]Haskell community. First of all, apologies for the late edition, I've only one set of finals left, and then everything should return to a normal schedule (at least, that's the plan). This week brings lots of development on the various usb utilities, an edition of the Haskell Web News (which covers, in summary, the events of the previous month in the Haskell online community), and some really great discussion about why Haskell is Pure. Until next week, Haskeller's, your Haskell Weekly News! Announcements Next meeting: December 17th at MIT (32-G882). Ravi Nanavati [2]announced the next meeting of the Boston Area Haskell User Group. Ryan Newton will be talking about Intel Concurrent Collections for Haskell. PCLT-0.1 and PCLT-DB-0.1. Andrey Sisoyev [3]announced his first two packages he's developed in Haskell. Both of his new packages relate to localization of packages. Announcing a summer internship for a NASA-sponsored project. Lee Pike [4]announced a new summer internship sponsored by NASA and Galois, Inc. unicode-symbols-0.1.1. Roel van Dijk [5]announced the release of his package 'unicode-symbols'. This packages offers alternative symbols for a number of common function and operators from the base and container packages. ls-usb-0.1.0.2. Roel van Dijk [6]announced a minor update of ls-usb, his package for listing USB devices connected to your system. usb-safe-0.1. Bas van Dijk [7]announced the release of his package usb-safe, which provides an abstract interface to the bindings-libusb library. usb-0.3. Bas van Dijk [8]announced a new release of his 'usb' library for high-level communication with usb devices from Haskell. bindings-libusb-1.4.2. Bas van Dijk [9]announced a new version of bindings-libusb, a DSL based, low level binding to libusb The Haskell Web News: December 2009 Edition. Don Stewart [10]announced the Haskell Web News for December. new installment of failure framework. Michael Snoyman [11]announced the next installment of the Failure Framework. PortAudio Windows Tutorial and Binaries. M Xyz [12]announced a tutorial for setting up PortAudio on Windows readline-statevar-1.0.1.0. Krzysztof Skrzetnicki [13]announced a small wrapper for readline. hakyll-0.1. Jasper van der Jeugt [14]announced Hakyll, a simple static site generator written in Haskell. Discussion Why? John D. Earle [15]asked about what benefits of purity in Haskell. Type system speculation. Andrew Coppin [16]asked about why we Haskeller's (including himself) are so obsessed with the type system. To Hackage or not to Hackage. John Van Enk [17]asked about whether it was worth putting a package on Hackage. Hayoo and Hoogle (beginner question). drostin77 [18]asked our 'Hopefully Helpful Haskell Community' about the differences between Hoogle and Hayoo. 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! * Manuel M T Chakravarty: [21]Using DTrace to track scheduler events of GHC's runtime. * Darcs: [22]darcs weekly news #47. * Brent Yorgey: [23]Mgu's and universal properties. * Philip Wadler: [24]Computer Science Education Week. * Bryan O'Sullivan: [25]The performance of Data.Text. * Neil Brown: [26]Solving the Santa Claus Problem with Conjunction. * Douglas M. Auclair (geophf): [27]Don't know; don't care: Whatever. * Ivan Lazar Miljenovic: [28]Command Input/Output and blocking. * Galois, Inc: [29]Tech Talk: John Launchbury presents Conal Elliottâs âBeautiful Differentiationâ. * Well-Typed.Com: [30]Talk at the Functional Programming eXchange. * Neil Brown: [31]The Problem with Parallel Participants Professing Priority. * Sean Leather: [32]Draft: "Pull-Ups, Push-Downs, and Passing It Around: Exercises in Functional Incrementalization". * Mikael Vejdemo Johansson (Syzygy-): [33]Coordinatization with hom complexes. * Haskell Web News: [34]What's new in Haskell? December 2009. * Dan Piponi (sigfpe): [35]Where do monads come from?. * Michael Snoyman: [36]Two language extensions. Quotes of the Week * sproingie: | {-# LANGUAGE NoTypeChecking #-} * kmc: the usual structure for a Haskell program is a crunchy IO shell with a gooey chocolate pure function center * sproingie: if it makes Cale's brane asplode, i think there's no hope for me understanding it * Wikipedia: In topology, the long line (or Alexandroff line) is a topological space analogous to the real line, but much longer. * ray: a monad tutorial is like a sausage factory * TomTobin: ::facepalm:: I wrote "Foobar" as a placeholder as I was typing [for the author's name], and never replaced it [in my email]. * ski: > (let id :: (forall id. id -> id) -> id -> id; id id = id id in id) id 5 * dmwit: analogies are endofunctors in the category of bad explanations * knobo: I really like this :) I can see that haskell is really cool now. This i a "matrix moment" for me :) About the Haskell Weekly News New editions are posted to [37]the Haskell mailing list as well as to [38]the Haskell Sequence and [39]Planet Haskell. [40]RSS is also available, and headlines appear on [41]haskell.org. To help create new editions of this newsletter, please see the information on [42]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [43]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67829 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67818 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67637 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67628 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67624 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67623 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67622 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67621 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67455 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67417 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67407 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67328 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67312 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67702 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67658 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67551 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67412 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://justtesting.org/post/281294210 22. http://blog.darcs.net/2009/12/darcs-weekly-news-47.html 23. http://byorgey.wordpress.com/2009/12/11/mgus-and-universal-properties/ 24. http://wadler.blogspot.com/2009/12/computer-science-education-week.html 25. http://www.serpentine.com/blog/2009/12/10/the-performance-of-data-text/ 26. http://chplib.wordpress.com/2009/12/10/solving-the-santa-claus-problem-with-conjunction/ 27. http://logicaltypes.blogspot.com/2008/07/dont-know-dont-care-whatever.html 28. http://ivanmiljenovic.wordpress.com/2009/12/10/command-inputoutput-and-blocking/ 29. http://www.galois.com/blog/2009/12/09/tech-talk-john-launchbury-presents-conal-elliots-beautiful-differentiation/ 30. http://blog.well-typed.com/2009/12/talk-at-the-functional-programming-exchange/ 31. http://chplib.wordpress.com/2009/12/08/the-problem-with-parallel-participants-professing-priority/ 32. http://feedproxy.google.com/~r/splonderzoek/~3/vjibqjB5x04/draft-pull-ups-push-downs-and-passing.html 33. http://blog.mikael.johanssons.org/archive/2009/12/coordinatization-with-hom-complexes/ 34. http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-december-2009/ 35. http://blog.sigfpe.com/2009/12/where-do-monads-come-from.html 36. http://snoyberg.wordpress.com/2009/12/07/two-language-extensions/ 37. http://www.haskell.org/mailman/listinfo/haskell 38. http://sequence.complete.org/ 39. http://planet.haskell.org/ 40. http://sequence.complete.org/node/feed 41. http://haskell.org/ 42. http://haskell.org/haskellwiki/HWN 43. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From emilio at mcs.le.ac.uk Mon Dec 14 04:17:24 2009 From: emilio at mcs.le.ac.uk (Emilio Tuosto) Date: Mon Dec 14 03:51:43 2009 Subject: [Haskell] GT-VMT 2010: deadlines extended Message-ID: <200912140917.27294.emilio@mcs.le.ac.uk> [We apologize for multiple copies] ==================================================== Call for Papers 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010) http://www.cs.le.ac.uk/events/gtvmt10/ Satellite Event of ETAPS 2010, Cyprus -- March 20-21, 2010 =================================================== Due to several requests, we have decided to extend the deadlines as follows. * NEW DATES * December 23, 2009 Abstract Submission December 27, 2009 Paper Submission January 15, 2010 Notification of Acceptance January 22, 2010 Camera ready version March 20-21, 2010 Workshop * Submissions * The proceedings of GT-VMT10 will be published in the journal Electronic Communications of the EASST. A preliminary version of the proceedings will be available at the workshop. Papers should not exceed 12 pages. For preparing your manuscript, the EASST templates can be downloaded at http://eceasst.cs.tu-berlin.de/template/ The online submission and review system is available at http://www.easychair.org/GTVMT2010/ * Chairs * Jochen Kuester, IBM Zurich Research, JKU [at] zurich.ibm.com Emilio Tuosto, University of Leicester, emilio [at] mcs.le.ac.uk * Program Committee * Paolo Baldan (University of Padova, Italy) Artur Boronat (University of Leicester, UK) Andrea Corradini (University of Pisa, Italy) Claudia Ermel (TU Berlin, Germany) Gregor Engels (University of Paderborn, Germany) Reiko Heckel (University of Leicester, UK) Thomas Hildebrandt (IT University of Copenhagen, Denmark) Holger Giese (HPI Potsdam, Germany) Barbara Koenig (University of Duisburg-Essen) Jochen Kuester (IBM Research - Zurich) [co-chair] Alberto Lluch Lafuente (University of Pisa, Italy) Juan de Lara (Universidad Autonoma de Madrid, Spain) Mark Minas (Universitat der Bundeswehr Muenchen, Germany) Francesco Parisi-Presicce (University of Rome, Italy) Arend Rensink (University of Twente, Netherlands) Gabriele Taentzer (University of Marburg, Germany) Emilio Tuosto (University of Leicester) [co-chair] Daniel Varro (TU Budapest, Hungary) Erhard Weinell (RWTH Aachen University) Albert Zuendorf (University of Kassel, Germany) * Scope * GT-VMT 2010 is the ninth workshop of a series that serves as a forum for all researchers and practitioners interested in the use of graph-based notation, techniques, and tools for the specification, modeling, validation, manipulation and verification of complex systems. The aim of the workshop is to promote engineering approaches that provide effective sound tool support for visual modeling languages, enhancing formal reasoning at the semantic level (e.g., for model analysis, transformation, and consistency management) in different domains, such as UML, Petri nets, Graph Transformation or Business Process/Workflow Models. This year's workshop will have a special focus on visualization, simulation, and verification of concurrent and distributed systems. Concurrency and distribution are among the most vital concerns to nowadays computing due to the importance of interconnected systems and the increased diffusion of multi-core architectures. Nevertheless, concurrent and distributed systems are hard to specify, design, verify and implement. Visual and graph-based techniques may be exploited to cope with the complexity in engineering of and reasoning about concurrent and distributed systems. In fact, graph-based approaches have recently been successfully applied to represent several computational aspects of different classes of distributed systems ranging from mobile systems a-la pi-calculus, to coordination in service-oriented systems, to communication networks. The aim of the workshop is to promote graph- and visual-based approaches for modelling, designing, implementing and reasoning about concurrent and distributed systems. The general areas of interest range from non-functional aspects (e.g., security, quantitive aspects), to (semi)formal modelling frameworks, to visual techniques for distributed and concurrent systems. Besides the traditional topics of the GT-VMT series like - visual language definition (incl. metamodelling, grammars, graphical parsing, etc.) - syntax and semantics of visual languages (incl. OCL, graph patterns, simulation, animation, compilation, verification & validation, static analysis techniques, etc.) - model transformations - graph transformations and visual modeling techniques in engineering, biology, and medicine - case studies and novel application areas - tool support and efficient algorithms more focused topics of interest include but are not limited to - visual and graph-based languages for distributed systems - graph models of distributed computations - verification and validation of distributed systems with visual techniques - graphical static & dynamic analysis of distributed systems - graphs for architectural design languages for distributed systems - visual techniques for modeling process choreographies and distributed workflows - visual/graph-based approaches to distributed coordination mechanisms - graph-based semantics models of novel distributed architectures (e.g., service oriented, GRID, P2P computing, and context aware/adaptive distributed applications) - model transformations of graphical into textual formalisms for distributed systems - model transformations and their application in model-driven development of distributed and concurrent systems - relating models/visual tools for concurrency/distribution - ... *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 *************************************************************** -- *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 *************************************************************** From marlowsd at gmail.com Mon Dec 14 07:34:23 2009 From: marlowsd at gmail.com (Simon Marlow) Date: Mon Dec 14 07:08:47 2009 Subject: [Haskell] Nominations for the Haskell 2011 committee Message-ID: <4B2630CF.5040900@gmail.com> So that the Haskell 2011 cycle can get underway, we are soliciting nominations for new committee members. Since this is the first time we've done this, the procedure is still somewhat unsettled and things may yet change, but the current guidelines are written down here: http://hackage.haskell.org/trac/haskell-prime/wiki/Committee In particular, on the makeup of the commitee: The committee should represent each class of stakeholders with roughly equal weight. These classes are * Implementers (compiler/tool writers) * Commercial users * Non-commercial users (e.g. open source) * Academic users (using Haskell in research) * Teachers * Authors In addition, members of the committee should be long-standing users with a deep knowledge of Haskell, and preferably with experience of language design. The committee should contain at least some members with a comprehensive knowledge of the dark corners of the Haskell language design, who can offer perspective and rationale for existing choices and comment on the ramifications of making different choices. To nominate someone (which may be yourself), send a message to haskell-prime@haskell.org. Please give reasons for your nomination. The current committee will appoint new commitee members and editors starting in the new year, so the deadline for nominations is 31 December 2009. During discussion amongst the current commitee, we realised that the choice of committee should be informed not just by the criteria above, but also by the particular proposals that are expected to be under consideration during this cycle. With that in mind, we plan that following the nominations the current committee will choose a "core commitee" of up to 10 members, and further members may be appointed during the year based on expertise needed to consider particular proposals. Accordingly, now would be a good time to start discussing which proposals should be considered in the Haskell 2011 timeframe, as that may affect the choice of commitee members. More details on the current Haskell Prime process are here: http://hackage.haskell.org/trac/haskell-prime/wiki/Process Cheers, Simon From igloo at earth.li Mon Dec 14 08:36:14 2009 From: igloo at earth.li (Ian Lynagh) Date: Mon Dec 14 08:10:21 2009 Subject: [Haskell] ANNOUNCE: GHC version 6.12.1 Message-ID: <20091214133614.GA11826@matrix.chaos.earth.li> ============================================================== The (Interactive) Glasgow Haskell Compiler -- version 6.12.1 ============================================================== The GHC Team is pleased to announce a new major release of GHC. There have been a number of significant changes since the last major release, including: * Considerably improved support for parallel execution. GHC 6.10 would execute parallel Haskell programs, but performance was often not very good. Simon Marlow has done lots of performance tuning in 6.12, removing many of the accidental (and largely invisible) gotchas that made parallel programs run slowly. * As part of this parallel-performance tuning, Satnam Singh and Simon Marlow have developed ThreadScope, a GUI that lets you see what is going on inside your parallel program. It's a huge step forward from "It takes 4 seconds with 1 processor, and 3 seconds with 8 processors; now what?". ThreadScope will be released separately from GHC, but at more or less the same time as GHC 6.12. * Dynamic linking is now supported on Linux, and support for other platforms will follow. Thanks for this most recently go to the Industrial Haskell Group who pushed it into a fully-working state; dynamic linking is the culmination of the work of several people over recent years. One effect of dynamic linking is that binaries shrink dramatically, because the run-time system and libraries are shared. Perhaps more importantly, it is possible to make dynamic plugins from Haskell code that can be used from other applications. * The I/O libraries are now Unicode-aware, so your Haskell programs should now handle text files containing non-ascii characters, without special effort. * The package system has been made more robust, by associating each installed package with a unique identifier based on its exposed ABI. Now, cases where the user re-installs a package without recompiling packages that depend on it will be detected, and the packages with broken dependencies will be disabled. Previously, this would lead to obscure compilation errors, or worse, segfaulting programs. This change involved a lot of internal restructuring, but it paves the way for future improvements to the way packages are handled. For instance, in the future we expect to track profiled packages independently of non-profiled ones, and we hope to make it possible to upgrade a package in an ABI-compatible way, without recompiling the packages that depend on it. This latter facility will be especially important as we move towards using more shared libraries. * There are a variety of small language changes, including * Some improvements to data types: record punning, declaring constructors with class constraints, GADT syntax for type families etc. * You can omit the "$" in a top-level Template Haskell splice, which makes the TH call look more like an ordinary top-level declaration with a new keyword. * We're are deprecating mdo for recursive do-notation, in favour of the more expressive rec statement. * We've concluded that the implementation of impredicative polymorphism is unsustainably complicated, so we are re-trenching. It'll be deprecated in 6.12 (but will still work), and will be either removed or replaced with something simpler in 6.14. The full release notes are here: http://haskell.org/ghc/docs/6.12.1/html/users_guide/release-6-12-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language; the current language version is Haskell 98, agreed in December 1998 and revised December 2002. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug From v.dijk.bas at gmail.com Mon Dec 14 09:24:05 2009 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Mon Dec 14 08:58:13 2009 Subject: [Haskell] Re: ANNOUNCE: GHC version 6.12.1 In-Reply-To: <20091214133614.GA11826@matrix.chaos.earth.li> References: <20091214133614.GA11826@matrix.chaos.earth.li> Message-ID: There's a broken link to the Haskell Platform in: http://haskell.org/ghc/docs/6.12.1/html/users_guide/release-6-12-1.html#id2890234 Bas From dennis.walter at gmail.com Mon Dec 14 12:25:53 2009 From: dennis.walter at gmail.com (Dennis Walter) Date: Mon Dec 14 11:59:58 2009 Subject: [Haskell] ANNOUNCE: GHC version 6.12.1 In-Reply-To: <20091214133614.GA11826@matrix.chaos.earth.li> References: <20091214133614.GA11826@matrix.chaos.earth.li> Message-ID: <7a5c95d30912140925m43ff7037p9348769e2e394985@mail.gmail.com> Where has Control.Concurrent.STM gone? I cannot find it on http://www.haskell.org/ghc/docs/latest/html/libraries/ anymore! I hope that is not what you meant by "Considerably improved support for parallel execution" ;-) /Dennis On Mon, Dec 14, 2009 at 2:36 PM, Ian Lynagh wrote: > > ? ============================================================== > ? ?The (Interactive) Glasgow Haskell Compiler -- version 6.12.1 > ? ============================================================== > > The GHC Team is pleased to announce a new major release of GHC. There > have been a number of significant changes since the last major release, > including: > > * Considerably improved support for parallel execution. GHC 6.10 would > ?execute parallel Haskell programs, but performance was often not very > ?good. Simon Marlow has done lots of performance tuning in 6.12, > ?removing many of the accidental (and largely invisible) gotchas that > ?made parallel programs run slowly. > > * As part of this parallel-performance tuning, Satnam Singh and Simon > ?Marlow have developed ThreadScope, a GUI that lets you see what is > ?going on inside your parallel program. It's a huge step forward from > ?"It takes 4 seconds with 1 processor, and 3 seconds with 8 processors; > ?now what?". ThreadScope will be released separately from GHC, but at > ?more or less the same time as GHC 6.12. > > * Dynamic linking is now supported on Linux, and support for other > ?platforms will follow. Thanks for this most recently go to the > ?Industrial Haskell Group who pushed it into a fully-working state; > ?dynamic linking is the culmination of the work of several people over > ?recent years. One effect of dynamic linking is that binaries shrink > ?dramatically, because the run-time system and libraries are shared. > ?Perhaps more importantly, it is possible to make dynamic plugins from > ?Haskell code that can be used from other applications. > > * The I/O libraries are now Unicode-aware, so your Haskell programs > ?should now handle text files containing non-ascii characters, without > ?special effort. > > * The package system has been made more robust, by associating each > ?installed package with a unique identifier based on its exposed ABI. > ?Now, cases where the user re-installs a package without recompiling > ?packages that depend on it will be detected, and the packages with > ?broken dependencies will be disabled. Previously, this would lead to > ?obscure compilation errors, or worse, segfaulting programs. > > ?This change involved a lot of internal restructuring, but it paves the > ?way for future improvements to the way packages are handled. For > ?instance, in the future we expect to track profiled packages > ?independently of non-profiled ones, and we hope to make it possible to > ?upgrade a package in an ABI-compatible way, without recompiling the > ?packages that depend on it. This latter facility will be especially > ?important as we move towards using more shared libraries. > > * There are a variety of small language changes, including > ?* Some improvements to data types: record punning, declaring > ? ?constructors with class constraints, GADT syntax for type families > ? ?etc. > ?* You can omit the "$" in a top-level Template Haskell splice, which > ? ?makes the TH call look more like an ordinary top-level declaration > ? ?with a new keyword. > ?* We're are deprecating mdo for recursive do-notation, in favour of > ? ?the more expressive rec statement. > ?* We've concluded that the implementation of impredicative polymorphism > ? ?is unsustainably complicated, so we are re-trenching. It'll be > ? ?deprecated in 6.12 (but will still work), and will be either removed > ? ?or replaced with something simpler in 6.14. > > > The full release notes are here: > > ?http://haskell.org/ghc/docs/6.12.1/html/users_guide/release-6-12-1.html > > How to get it > ~~~~~~~~~~~~~ > > The easy way is to go to the web page, which should be self-explanatory: > > ? ? ? ?http://www.haskell.org/ghc/ > > We supply binary builds in the native package format for many > platforms, and the source distribution is available from the same > place. > > Packages will appear as they are built - if the package for your > system isn't available yet, please try again later. > > > Background > ~~~~~~~~~~ > > Haskell is a standard lazy functional programming language; the > current language version is Haskell 98, agreed in December 1998 and > revised December 2002. > > GHC is a state-of-the-art programming suite for Haskell. ?Included is > an optimising compiler generating good code for a variety of > platforms, together with an interactive system for convenient, quick > development. ?The distribution includes space and time profiling > facilities, a large collection of libraries, and support for various > language extensions, including concurrency, exceptions, and foreign > language interfaces (C, whatever). ?GHC is distributed under a > BSD-style open source license. > > A wide variety of Haskell related resources (tutorials, libraries, > specifications, documentation, compilers, interpreters, references, > contact information, links to research groups) are available from the > Haskell home page (see below). > > > On-line GHC-related resources > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > > Relevant URLs on the World-Wide Web: > > GHC home page ? ? ? ? ? ? ?http://www.haskell.org/ghc/ > GHC developers' home page ?http://hackage.haskell.org/trac/ghc/ > Haskell home page ? ? ? ? ?http://www.haskell.org/ > > > Supported Platforms > ~~~~~~~~~~~~~~~~~~~ > > The list of platforms we support, and the people responsible for them, > is here: > > ? http://hackage.haskell.org/trac/ghc/wiki/Contributors > > Ports to other platforms are possible with varying degrees of > difficulty. ?The Building Guide describes how to go about porting to a > new platform: > > ? ?http://hackage.haskell.org/trac/ghc/wiki/Building > > > Developers > ~~~~~~~~~~ > > We welcome new contributors. ?Instructions on accessing our source > code repository, and getting started with hacking on GHC, are > available from the GHC's developer's site run by Trac: > > ?http://hackage.haskell.org/trac/ghc/ > > > Mailing lists > ~~~~~~~~~~~~~ > > We run mailing lists for GHC users and bug reports; to subscribe, use > the web interfaces at > > ? ?http://www.haskell.org/mailman/listinfo/glasgow-haskell-users > ? ?http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs > > There are several other haskell and ghc-related mailing lists on > www.haskell.org; for the full list, see > > ? ?http://www.haskell.org/mailman/listinfo/ > > Some GHC developers hang out on #haskell on IRC, too: > > ? ?http://www.haskell.org/haskellwiki/IRC_channel > > Please report bugs using our bug tracking system. ?Instructions on > reporting bugs can be found here: > > ? ?http://www.haskell.org/ghc/reportabug > > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell > From svein.ove at aas.no Mon Dec 14 12:28:53 2009 From: svein.ove at aas.no (Svein Ove Aas) Date: Mon Dec 14 12:02:59 2009 Subject: [Haskell] ANNOUNCE: GHC version 6.12.1 In-Reply-To: <7a5c95d30912140925m43ff7037p9348769e2e394985@mail.gmail.com> References: <20091214133614.GA11826@matrix.chaos.earth.li> <7a5c95d30912140925m43ff7037p9348769e2e394985@mail.gmail.com> Message-ID: <221b53ab0912140928j7a018271ja963c11fea4cf2b9@mail.gmail.com> On Mon, Dec 14, 2009 at 6:25 PM, Dennis Walter wrote: > Where has Control.Concurrent.STM gone? > I cannot find it on > http://www.haskell.org/ghc/docs/latest/html/libraries/ > anymore! > > I hope that is not what you meant by "Considerably improved support > for parallel execution" ;-) > Split into an stm package, on hackage. :-) -- Svein Ove Aas From leaf.pub1 at gmail.com Mon Dec 14 13:59:07 2009 From: leaf.pub1 at gmail.com (Leaf Petersen) Date: Mon Dec 14 13:33:12 2009 Subject: [Haskell] Call For Participation: DAMP 2010 Message-ID: If you're interested in what's going on with Haskell and multicores (and you should be!), please come participate in DAMP. We have several talks about Haskell work in the program this year, and I think all of the talks should be of interest to the Haskell community. Cheers, Leaf Petersen (General Chair) DAMP 2010: Workshop on Declarative Aspects of Multicore Programming Madrid, SPAIN (colocated with POPL 2010) January 19, 2010 damp10.cs.nmsu.edu The advent of multicore architectures has profoundly increased the importance of research in parallel computing. Modern platforms are becoming more complex and heterogenous and novel solutions are needed to account for their peculiarities. Multicore architectures will differ in significant ways from their multisocket predecessors. For example, the communication to compute bandwidth ratio is likely to be higher, which will positively impact performance. More generally, multicore architectures introduce several new dimensions of variability in both performance guarantees and architectural contracts, such as the memory model, that may not stabilize for several generations of product. Programs written in functional or (constraint-)logic programming languages, or in other highly declarative languages with a controlled use of side effects, can greatly simplify parallel programming. Such declarative programming allows for a deterministic semantics even when the underlying implementation might be highly non-deterministic. In addition to simplifying programming this can simplify debugging and analyzing correctness. DAMP 2010 is the fifth in a series of one-day workshops seeking to explore ideas in declarative programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. DAMP seeks to gather together researchers in declarative approaches to parallel programming and to foster cross fertilization across different approaches. Preliminary Program: ==================== Tuesday January 19th, 2010: Invited Talk [9:00-10:00] * Parallelizing Constraint Programs. Laurent Michel (University of Connecticut) Coffee Break [10:00-10:30] Session 1 [10:30-11:30] * PASTHA - Parallelizing Stencil Calculations in Haskell Michael Lesniak * Ypnos: Declarative Parallel Structured Grid Programming Dominic Orchard, Alan Mycroft, Max Bolingbroke Coffee Break [11:30-12:00] Session 2 [12:00-13:00] * SequenceL: Transparency and Multi-core Parallelism Brad Nemanich, Daniel Cooke, Nelson Rushton * Efficient Parallel Programming in Poly/ML and Isabelle/ML David Matthews, Makarius Wenzel Lunch (PROVIDED by the Conference) [13:00-14:30] Session 3 [14:30-15:30] * S-Net for Multi-Memory Multicores Clemens Grelck, Jukka Julku, Frank Penczek * Compress-and-Conquer for Optimal Multicore Computing Z. George Mou, Hai Liu, Paul Hudak Coffee Break [15:30-16:00] Sesssion 4 [16:00-17:00] * Lightweight Ansynchrony using Parasitic Threads KC Sivaramakrishnan, Lukasz Ziarek, Raghavendra Prasad, Suresh Jagannathan * A Parallel ASP Instantiator Based on DLV Simona Perri, Francesco Ricca, Marco Sirianni Invited Talk [17:00-18:00] * Declarative Data-Parallel Programming with the Accellerator System Satnam Singh (Microsoft Research) URL: ==== http://damp10.cs.nmsu.edu -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091214/53cd14e5/attachment.html From duncan.coutts at googlemail.com Mon Dec 14 18:42:14 2009 From: duncan.coutts at googlemail.com (Duncan Coutts) Date: Mon Dec 14 18:16:21 2009 Subject: [Haskell] Re: ANNOUNCE: GHC version 6.12.1 In-Reply-To: <200912142249.52489.daniel.is.fischer@web.de> References: <20091214133614.GA11826@matrix.chaos.earth.li> <200912142249.52489.daniel.is.fischer@web.de> Message-ID: <1260834134.9220.28404.camel@localhost> On Mon, 2009-12-14 at 22:49 +0100, Daniel Fischer wrote: > Oh great, that's not what I expected: > > $ cabal install cabal-install > cabal: This version of the cabal program is too old to work with ghc-6.12+. > You will need to install the 'cabal-install' package version 0.8 or higher. > If you still have an older ghc installed (eg 6.10.4), run: > $ cabal install -w ghc-6.10.4 'cabal-install >= 0.8' > $ cabal install -w ghc-6.10.3 'cabal-install >= 0.8' > Resolving dependencies... > cabal: There is no available version of cabal-install that satisfies >=0.8 > > Oops, nothing higher than 0.6.4 on Hackage, even > darcs.haskell.org/cabal-install is only version 0.7.5. Right, the cabal-install 0.8.x release will appear in due course. It shouldn't be too long since I've already been using it for Hackage regression testing of ghc-6.12. > That seems to work, though, but I needed to manually install network, mtl and parsec > before bootstrap.sh ran. Yes, the bootstrap needs updating to take account of the fact that those packages are no longer shipped with ghc-6.12. Duncan From dennis.walter at gmail.com Tue Dec 15 06:13:19 2009 From: dennis.walter at gmail.com (Dennis Walter) Date: Tue Dec 15 05:47:23 2009 Subject: [Haskell] ANNOUNCE: GHC version 6.12.1 In-Reply-To: <221b53ab0912140928j7a018271ja963c11fea4cf2b9@mail.gmail.com> References: <20091214133614.GA11826@matrix.chaos.earth.li> <7a5c95d30912140925m43ff7037p9348769e2e394985@mail.gmail.com> <221b53ab0912140928j7a018271ja963c11fea4cf2b9@mail.gmail.com> Message-ID: <7a5c95d30912150313i411a35dcg407aae1fbcbaf575@mail.gmail.com> > > Where has Control.Concurrent.STM gone? > > I cannot find it on > > http://www.haskell.org/ghc/docs/latest/html/libraries/ > > anymore! > > > Split into an stm package, on hackage. :-) > > Thanks for the info; I wonder if this is a good or a bad sign regarding STM's future within Haskell? Is it so big and self-contained to deserve its own external package, or is it so little used that it does not belong to into the "standard" libraries? Did I miss an announcement about restructuring and cleaning up the Haskell hierarchical libraries? And btw: the Links on http://www.haskell.org/haskellwiki/Software_transactional_memory referring to the API documentation are broken. From igloo at earth.li Tue Dec 15 06:57:43 2009 From: igloo at earth.li (Ian Lynagh) Date: Tue Dec 15 06:31:46 2009 Subject: [Haskell] Re: ANNOUNCE: GHC version 6.12.1 In-Reply-To: References: <20091214133614.GA11826@matrix.chaos.earth.li> Message-ID: <20091215115743.GC3875@matrix.chaos.earth.li> On Mon, Dec 14, 2009 at 03:24:05PM +0100, Bas van Dijk wrote: > There's a broken link to the Haskell Platform in: > > http://haskell.org/ghc/docs/6.12.1/html/users_guide/release-6-12-1.html#id2890234 Thanks; fixed with a redirect. Thanks Ian From marlowsd at gmail.com Tue Dec 15 09:27:03 2009 From: marlowsd at gmail.com (Simon Marlow) Date: Tue Dec 15 09:01:13 2009 Subject: [Haskell] ANNOUNCE: GHC version 6.12.1 In-Reply-To: <7a5c95d30912150313i411a35dcg407aae1fbcbaf575@mail.gmail.com> References: <20091214133614.GA11826@matrix.chaos.earth.li> <7a5c95d30912140925m43ff7037p9348769e2e394985@mail.gmail.com> <221b53ab0912140928j7a018271ja963c11fea4cf2b9@mail.gmail.com> <7a5c95d30912150313i411a35dcg407aae1fbcbaf575@mail.gmail.com> Message-ID: <4B279CB7.50902@gmail.com> On 15/12/09 11:13, Dennis Walter wrote: >>> Where has Control.Concurrent.STM gone? >>> I cannot find it on >>> http://www.haskell.org/ghc/docs/latest/html/libraries/ >>> anymore! >>> >> Split into an stm package, on hackage. :-) >> >> > Thanks for the info; I wonder if this is a good or a bad sign > regarding STM's future within Haskell? Is it so big and self-contained > to deserve its own external package, or is it so little used that it > does not belong to into the "standard" libraries? You should think of the "standard" libraries as those that come with the Haskell Platform, which includes stm. The packages that come with GHC are now the bare essentials needed to bootstrap GHC itself. We haven't changed our position on stm at all: it continues to be fully supported, and there are no plans to change that. Unfortunately the removal of stm from the set of packages that we regularly build with GHC means that it isn't getting as much testing as before, which is something we should fix. There are various plans afoot to revamp our automatic build & testing infrastructure, and testing external libraries should be a part of that. Cheers, Simon From allbery at ece.cmu.edu Tue Dec 15 16:54:19 2009 From: allbery at ece.cmu.edu (Brandon S. Allbery KF8NH) Date: Tue Dec 15 16:28:43 2009 Subject: [Haskell] ANNOUNCE: GHC version 6.12.1 In-Reply-To: <7a5c95d30912150313i411a35dcg407aae1fbcbaf575@mail.gmail.com> References: <20091214133614.GA11826@matrix.chaos.earth.li> <7a5c95d30912140925m43ff7037p9348769e2e394985@mail.gmail.com> <221b53ab0912140928j7a018271ja963c11fea4cf2b9@mail.gmail.com> <7a5c95d30912150313i411a35dcg407aae1fbcbaf575@mail.gmail.com> Message-ID: -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Dec 15, 2009, at 06:13 , Dennis Walter wrote: >>> Where has Control.Concurrent.STM gone? >>> I cannot find it on >>> http://www.haskell.org/ghc/docs/latest/html/libraries/ >>> anymore! >>> >> Split into an stm package, on hackage. :-) > Thanks for the info; I wonder if this is a good or a bad sign > regarding STM's future within Haskell? Is it so big and self-contained > to deserve its own external package, or is it so little used that it > does not belong to into the "standard" libraries? Did I miss an > announcement about restructuring and cleaning up the Haskell > hierarchical libraries? What you missed is that the GHC devs are getting out of the libraries business. The Haskell Platform replaces the GHC standard libraries. - -- brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@kf8nh.com system administrator [openafs,heimdal,too many hats] allbery@ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.10 (Darwin) iEYEARECAAYFAksoBZkACgkQIn7hlCsL25U/gQCfdasJwPAiKz1HMGZ1T3xcAXoG c/4AoM6ZsbhpjNwpdCTkrRSmTCiaosy0 =lJ4Q -----END PGP SIGNATURE----- From jv at informatik.uni-bonn.de Fri Dec 18 03:34:35 2009 From: jv at informatik.uni-bonn.de (=?ISO-8859-1?Q?Janis_Voigtl=E4nder?=) Date: Fri Dec 18 03:08:14 2009 Subject: [Haskell] [Fwd: Termination Competition 2009 live on the web!] Message-ID: <4B2B3E9B.6050007@informatik.uni-bonn.de> Hi all, This contest should be of interest to Haskellers. There is an "FP Category" in which termination of Haskell programs is automatically checked. The current state can be observed by following the corresponding "View Results" link from the page http://termcomp.uibk.ac.at/termcomp/competition/categoryList.seam?competitionId=101722&cid=51 Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de -------------- next part -------------- An embedded message was scrubbed... From: Juergen Giesl Subject: Termination Competition 2009 live on the web! Date: Thu, 17 Dec 2009 12:05:40 +0100 Size: 5770 Url: http://www.haskell.org/pipermail/haskell/attachments/20091218/18e34dd1/TerminationCompetition2009liveontheweb-0001.eml From jfredett at gmail.com Sat Dec 19 10:57:13 2009 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sat Dec 19 10:31:08 2009 Subject: [Haskell] Haskell Weekly News: Issue 144 - December 19, 2009 Message-ID: <4b2cf7d9.9453f10a.62dd.2cb9@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091219 Issue 144 - December 19, 2009 --------------------------------------------------------------------------- Welcome to issue 144 of HWN, a newsletter covering developments in the [1]Haskell community. The big news this week is the release of the Glorious Glasgow Haskell compiler version 6.12.1, lots of exciting new improvements, congratulations from the whole community go out to the devs, good work GHC Team! Otherwise, this week has been quiet, with some interesting discussions about associated types and the new GHC, and some excellent new packages announced. Finally, due to the incoming holidays, there won't be an HWN for the next two weeks, I'll see you Haskellers in 2010, until then, your Haskell Weekly News! Announcements GHC version 6.12.1. Ian Lynagh [2]announced the (Interactive) Glasgow Haskell Compiler, version 6.12.1. Including improved support for parallel execution, Dynamic linking support on Linux, and many other improvments. atom-0.1.4. Tom Hawkins [3]announced a bug fix release of the atom package, affecting floating point variable initialization. text 0.7, fast Unicode text. Bryan O'Sullivan [4]announced a new release of the text package adds support for Unicode I/O explicit-iomodes-0.1. Bas van Dijk [5]announced explicit-iomodes version 0.1, a wrapper around System.IO that provides a Handle type which is parametrized with the IOMode it is in. Hemkay, the 100% Haskell MOD player. Patai Gergely [6]announced a Hemkay, an old-school MOD player in pure Haskell. GT-VMT 2010: deadlines extended. Emilio Tuosto [7]announced a deadline extension to the GT-VMT call for papers. Discussion Restrictions on associated types for classes. Stephen Lavelle [8]asked if there was a way to wrap a associated type in a class constraint. Yay 6.12.1! Evan Laforge [9]talked about some of the changes in the new version of GHC. Blog noise [10]Haskell news from the [11]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Michael Snoyman: [12]data-object family. * Bryan O'Sullivan: [13]Making GHC's I/O manager more scalable. * Conor McBride: [14]Epilogue for Epigram: 2+2=4. * Sebastian Fischer: [15]Thesis submitted. * Bryan O'Sullivan: [16]Data.Text 0.7 gains I/O support. * Ketil Malde: [17]Searching for poly(A) tails. * Mark Jason Dominus: [18]Monads are like burritos. * Sean Leather: [19]"Upwards and downwards accumulations on trees" translated into Haskell. Quotes of the Week * yrlnry: yrlnry: just some lady who had a lot of money and decided she wanted poor grad students to have some of it after she died... pretty nice of her, actually senile dementia, more likely. * Philonous: A 'newbie', in Haskell, is someone who hasn't yet implemented a compiler. They've only written a monad tutorial. * kmc: Right, for example Either (pun not intended) * kmc: One thing I've learned from open-source software is that if you invent enough wheels, one of them will turn out to be round and capable of rolling. * PhilipWadler: To see that "in" and "out" are inverses, stare at the following diagram * kmc: Data.Map is like a C++ STL map, without the suck * edwardkmett: Most monad tutorials are written by people who barely understand monads, if at all, but unfortunately nothing can stop someone from writing a monad tutorial. We've tried, there was blood everywhere. * Cale: A small category is a monad in the 2-category of spans of sets. About the Haskell Weekly News New editions are posted to [20]the Haskell mailing list as well as to [21]the Haskell Sequence and [22]Planet Haskell. [23]RSS is also available, and headlines appear on [24]haskell.org. To help create new editions of this newsletter, please see the information on [25]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [26]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17678 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68009 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67946 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67931 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67923 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17676 8. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68084 9. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67950 10. http://planet.haskell.org/ 11. http://haskell.org/haskellwiki/Blog_articles 12. http://snoyberg.wordpress.com/2009/12/17/data-object-family/ 13. http://www.serpentine.com/blog/2009/12/17/making-ghcs-io-manager-more-scalable/ 14. http://www.e-pig.org/epilogue/?p=266 15. http://www-ps.informatik.uni-kiel.de/~sebf/haskell/thesis.html 16. http://www.serpentine.com/blog/2009/12/15/data-text-0-7-gains-io-support/ 17. http://blog.malde.org/index.php/2009/12/14/searching-for-polya-tails/ 18. http://blog.plover.com/prog/burritos.html 19. http://feedproxy.google.com/~r/splonderzoek/~3/4E8TZPDZ-aM/upwards-and-downwards-accumulations-on.html 20. http://www.haskell.org/mailman/listinfo/haskell 21. http://sequence.complete.org/ 22. http://planet.haskell.org/ 23. http://sequence.complete.org/node/feed 24. http://haskell.org/ 25. http://haskell.org/haskellwiki/HWN 26. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From popl10-announce at software.imdea.org Sat Dec 19 14:17:36 2009 From: popl10-announce at software.imdea.org (popl10-announce@software.imdea.org) Date: Sat Dec 19 13:51:30 2009 Subject: [Haskell] POPL 2010 - Call for Participation - Early Registration Dec 22 Message-ID: <19245.9936.822067.4646@dhcp-163.imdea> ********************************************************************* * ACM SIGPLAN-SIGACT Symposium * * on * * Principles of Programming Languages * * * * January 20-22, 2010 * * Madrid, Spain * * * * Call for Participation * * * * http://www.cse.psu.edu/popl/10/ * ********************************************************************* Important dates * Early registration deadline: *** December 22, 2009 *** * Hotel reservation deadline: December 28, 2009 * Conference: January 20-22, 2010 Hotel All the conference events will take place at the Melia Castilla Hotel, Madrid. We encourage attendees to stay at the conference hotel. Information about the hotel can be found on the POPL web page: http://www.cse.psu.edu/popl/10/ Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. Preliminary program A preliminary program can be found at the end of this email in text format, or it can be found here: http://www.cse.psu.edu/popl/10/program.html Invited speakers * Neil Gershenfeld (MIT, USA) * Thomas A. Henzinger (IST, Austria) Student Attendees Students with accepted papers or posters are encouraged to apply for a SIGPLAN PAC grant that will help to cover travel expenses to POPL. Details on the PAC program and the application can be found in the conference web site. PAC also offers support for companion travel. General Chair: Manuel Hermenegildo Director, IMDEA Software Institute Professor, C.S. Department, T.U. of Madrid (UPM), Spain Program Chair: Jens Palsberg Professor, UCLA Computer Science Department Program Committee: Alex Aiken Stanford University Rajeev Alur University of Pennsylvania Cristiano Calcagno Imperial College, London Juan Chen Microsoft Research Wei-Ngan Chin National University of Singapore Mads Dam Royal Institute of Technology, Stockholm Erik Ernst Aarhus University John Field IBM T. J. Watson Research Center Cormac Flanagan UC Santa Cruz Roberto Giacobazzi Universita' degli Studi di Verona Rachid Guerraoui EPFL Sorin Lerner UC San Diego Calvin Lin University of Texas, Austin Atsushi Ohori Tohoku University Jens Palsberg UCLA Andrey Rybalchenko Max Planck Institute for Software Systems Amr Sabry Indiana University Mooly Sagiv Tel-Aviv University Peter Sewell University of Cambridge Tayssir Touili CNRS-LIAFA Affiliated Events * WFLP: Functional and (Constraint) Logic Programming * January 17, 2010 * VMCAI: Verification Model Checking and Abstract Interpretation * January 17-19, 2010 * PADL: Practical Applications of Declarative Languages * January 18-19, 2010 * DAMP: Declarative Aspects of Multicore Programming * January 19, 2010 * PLPV: Programming Languages meets Program Verification * January 19, 2010 * PEPM: Partial Evaluation and Semantics-Based Program Manipulation * January 18-19, 2010 * TLDI:Types in Language Design and Implementation * January 23, 2010 POPL 2010 Preliminary Program ----------------------------- Wednesday, January 20, 2009 =========================== * Invited talk, 9:00-10:00 * Session Chair: Jens Palsberg (UCLA) - Reconfigurable Asynchronous Logic Automata Neil Gershenfeld (MIT, USA) * Session: Concurrency, 10:30-11:30 * Session Chair: John Field (IBM T. J. Watson Research Center) - On the Verification Problem for Weak Memory Models Mohamed Faouzi Atig (LIAFA, University Paris Diderot), Ahmed Bouajjani (LIAFA, University Paris Diderot), Sebastian Burckhardt (Microsoft Research), Madan Musuvathi (Microsoft Research) - Coarse-Grained Transactions Eric Koskinen (University of Cambridge), Matthew Parkinson (University of Cambridge), Maurice Herlihy (Brown University) - Sequential Verification of Serializability H. Attiya (Technion), G. Ramalingam (Microsoft Research India), N. Rinetzky (Queen Mary University of London) * Session: Static Analysis I, 12:00-1:00 * Session Chair: Tayssir Touili (CNRS-LIAFA) - Compositional May-Must Program Analysis: Unleashing the Power of Alternation Patrice Godefroid (Microsoft Research Redmond), Aditya V. Nori (Microsoft Research India), Sriram K. Rajamani (Microsoft Research India), Sai Deep Tetali (Microsoft Research India) - Continuity Analysis of Programs Authors: Swarat Chaudhuri (Pennsylvania State University), Sumit Gulwani (Microsoft Research), Roberto Lublinerman (Pennsylvania State University) - Program Analysis via Satisfiability Modulo Path Programs William R. Harris (University of Wisconsin, Madison, WI), Sriram Sankaranarayanan (NEC Laboratories America, Princeton, NJ), Franjo Ivancic (NEC Laboratories America, Princeton, NJ), Aarti Gupta (NEC Laboratories America, Princeton, NJ) * Session: Verified Compilers, 2:30-3:30 * Session Chair: Sorin Lerner (UC San Diego) - A simple, verified validator for software pipelining Jean-Baptiste Tristan (INRIA Paris-Rocquencourt), Xavier Leroy (INRIA Paris-Rocquencourt) - A Verified Compiler for an Impure Functional Language Adam Chlipala (Harvard University) - Verified just-in-time compiler on x86 Magnus O. Myreen (University of Cambridge) * Session: Type Inference, 4:00-5:00 * Session Chair: Benjamin Pierce (University of Pennsylvania) - Dependent Types from Counterexamples Tachio Terauchi (Tohoku University) - Low-Level Liquid Types Patrick Rondon (UC San Diego), Ranjit Jhala (UC San Diego), Ming Kawaguchi (UC San Diego) - Type Inference for Datalog with Complex Type Hierarchies Max Schaefer (Semmle Ltd., Oxford), Oege de Moor (Semmle Ltd., Oxford) Thursday, January 21, 2009 ========================== * Invited talk, 9:00-10:00 * Session Chair: Jens Palsberg (UCLA) - From Boolean to Quantitative Notions of Correctness Thomas A. Henzinger (IST, Austria) * Session: Reasoning about Programs, 10:30-11:30 * Session Chair: Roberto Giacobazzi (Universita' degli Studi di Verona) - Nominal System T Andrew M. Pitts (University of Cambridge) - A Theory of Indirection via Approximation Aquinas Hobor (National University of Singapore), Robert Dockins (Princeton University), Andrew W. Appel (Princeton University) - A Relational Modal Logic for Higher-Order Stateful ADTs Derek Dreyer (MPI-SWS), Georg Neis (MPI-SWS), Andreas Rossberg (MPI-SWS), Lars Birkedal (ITU-Copenhagen) * Session: Static Analysis II, 12:00-1:00 * Session Chair: Andrey Rybalchenko (Max Planck Institute for Software Systems) - Decision Procedures for Algebraic Data Types with Abstractions Philippe Suter (EPFL), Mirco Dotta (EPFL), Viktor Kuncak (EPFL) - Automatic Numeric Abstractions for Heap-Manipulating Programs Stephen Magill (Carnegie Mellon University), Ming-Hsien Tsai (National Taiwan University), Peter Lee (Carnegie Mellon University), Yih-Kuen Tsay (National Taiwan University) - Static Determination of Quantitative Resource Usage for Higher-Order Programs Steffen Jost (University of St Andrews), Hans-Wolfgang Loidl (University of St Andrews), Kevin Hammond (University of St Andrews), Martin Hofmann (Ludwig-Maximilians University, Munich) * Session: Verification, 2:30-3:30 * Session Chair: Xavier Leroy (INRIA Rocquencourt) - Toward a Verified Relational Database Management System Ryan Wisnesky (Harvard University), Gregory Malecha (Harvard University), Avraham Shinnar (Harvard University), Greg Morrisett (Harvard University) - Counterexample-Guided Focus Andreas Podelski (University of Freiburg), Thomas Wies (EPFL) - Structuring the verification of heap-manipulating programs Aleksandar Nanevski (Microsoft Research, Cambridge / IMDEA Software, Spain), Viktor Vefeiadis (Microsoft Research, Cambridge), Josh Berdine (Microsoft Research, Cambridge) * Session: Types, 4:00-5:00 * Session Chair: Erik Ernst (Aarhus University) - Dependent types and program equivalence Limin Jia (University of Pennsylvania), Jianzhou Zhao (University of Pennsylvania), Vilhelm Sjoberg (University of Pennsylvania), Stephanie Weirich (University of Pennsylvania) - Pure Subtype Systems DeLesley Hutchins (MZA Associates Corporation) - Modular Session Types for Distributed Object-Oriented Programming Simon J Gay (University of Glasgow, UK), Vasco T Vasconcelos (University of Lisbon, Portugal), Antonio Ravara (Instituto de Telecomunicacoes and Technical University of Lisbon, Portugal), Nils Gesbert (University of Glasgow, UK), Alexandre Z Caldeira (University of Lisbon, Portugal) Friday, January 22, 2009 ========================= * Session: Program Synthesis, 9:00-10:00 * Session Chair: Cristiano Calcagno (Imperial College, London) - From Program Verification to Program Synthesis Saurabh Srivastava (University of Maryland, College Park), Sumit Gulwani (Microsoft Research, Redmond), Jeffrey S. Foster (University of Maryland, College Park) - Abstraction-Guided Synthesis of Synchronization Martin Vechev (IBM Research), Eran Yahav (IBM Research), Greta Yorsh (IBM Research) - Programming with Angelic Non-determinism Shaon Barman (UC Berkeley), Rastislav Bodik (UC Berkeley), Satish Chandra (IBM TJ Watson Research), Joel Galenson (UC Berkeley), Doug Kimelman (IBM TJ Watson Research), Casey Rodarmor (UC Berkeley), Nicholas Tung (UC Berkeley) * Session: Relating and Integrating Static and Dynamic Checks, 10:30-11:30 * Session Chair: Matthias Felleisen (Northeastern University) - Contracts Made Manifest Michael Greenberg (University of Pennsylvania), Benjamin Pierce (University of Pennsylvania), Stephanie Weirich (University of Pennsylvania) - Threesomes, With and Without Blame Jeremy G. Siek (University of Colorado at Boulder), Philip Wadler (University of Edinburgh) - Integrating Typed and Untyped Code in a Scripting Language Tobias Wrigstad (Purdue University), Francesco Zappa Nardelli (INRIA), Sylvain Lebresne (Purdue University), Johan Ostlund (Purdue University), Jan Vitek (Purdue University) * Session: Compilers, 12:00-1:00 * Session Chair: Peter Sewell (University of Cambridge) - Generating Compiler Optimizations from Proofs Ross Tate (UC San Diego), Michael Stepp (UC San Diego), Sorin Lerner (UC San Diego) - Automatically Generating Instruction Selectors Using Declarative Machine Descriptions Joao Dias (Tufts University), Norman Ramsey (Tufts University) - Semantics and Algorithms for Data-dependent Grammars Yitzhak Mandelbaum (AT&T Labs - Research), Trevor Jim (AT&T Labs - Research), David Walker (Princeton University) * Session: Security and Ownership, 2:30-3:30 * Session Chair: Mads Dam (Royal Institute of Technology, Stockholm) - Paralocks - Role-Based Information Flow Control and Beyond Niklas Broberg (Gothenburg University), David Sands (Chalmers University of Technology) - Modular Verification of Security Protocol Code by Typing Karthikeyan Bhargavan (Microsoft Research), Cedric Fournet (Microsoft Research), Andrew D. Gordon (Microsoft Research) - Dynamically Checking Ownership Policies in Concurrent C/C++ Programs Jean-Phillipe Martin (Microsoft Research Cambridge), Michael Hicks (University of Maryland, College Park), Manuel Costa (Microsoft Research Cambridge), Periklis Akritidis (University of Cambridge), Miguel Castro (Microsoft Research Cambridge) * Session: Medley, 4:00-5:00 * Session Chair: Mooly Sagiv (Tel-Aviv University) - Nested Interpolants Matthias Heizmann (University of Freiburg, Germany), Jochen Hoenicke (University of Freiburg, Germany), Andreas Podelski (University of Freiburg, Germany) - Monads in Action Andrzej Filinski (University of Copenhagen) - Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification Naoki Kobayashi (Tohoku University), Naoshi Tabuchi (Tohoku University), Hiroshi Unno (Tohoku University) From jv at informatik.uni-bonn.de Sat Dec 19 14:31:43 2009 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Sat Dec 19 14:05:35 2009 Subject: [Haskell] Call for Participation - PEPM'10 (co-located with POPL'10) Message-ID: <4B2D2A1F.2080101@informatik.uni-bonn.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 G. 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. Igor II - 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 jeremy at n-heptane.com Sat Dec 19 19:17:59 2009 From: jeremy at n-heptane.com (Jeremy Shaw) Date: Sat Dec 19 18:52:31 2009 Subject: [Haskell] ANN: Happstack 0.4.1 Message-ID: <99D43ACE-4235-45BD-8484-6BA0CC64F6E7@n-heptane.com> Happstack 0.4.1 STABLE is now available. We recommend that all users of Happstack update to 0.4.1 immediately. Migration from Happstack 0.3 should be trivial. There was one race condition in happstack-state which could cause a state event to fail under heavy congestion. Happstack is the Haskell Application Server Stack. It is a scalable framework for developing web applications. It is similar in purpose to Django, RoR, Turbogears, Grails, Seaside, etc. Using less buzzwords, it is a collection of libraries which can be used to develop a self-contained server application which does not require SQL or Apache (though it can integrate with both). It includes: * an HTTP server * a rich DSL for deconstructing HTTP Requests and generating Responses * HTML/XML/etc templating via HStringTemplate, HSP, or Text.XHtml * a persistent data store based on user defined Haskell data types with ACID properties and state migration * and more!! Happstack's modular nature means it is easy to integrate unrelated 3rd party modules such as Pandoc, or to add support for an alternative templating system. Additionally, it does not exclude you from using SQL, or supporting other protocols besides HTTP. HOMEPAGE: http://www.happstack.com/ SUPPORTED PLATFORMS: Happstack supports GHC 6.8, 6.10, and 6.12, under GNU/Linux, FreeBSD, OS X, and Windows. GHC 6.12 currently requires a minor patch to HJScript. Details here: http://groups.google.com/group/haskell-server-pages/browse_thread/thread/56f388fdbaec1420 INSTALL: 1. ensure that ~/.cabal/bin is in your $PATH 2. cabal update 3. cabal install happstack * see SUPPORTED PLATFORMS for information about GHC 6.12 NOTABLE CHANGES: For a complete list of changes see: http://www.patch-tag.com/r/mae/happstack/snapshots/all/history Removed: * happstack-contrib has been completely removed. If you were using something in it, please complain on the mailing list. * removed Happstack.Server.S3 -- newer, better maintained S3 libraries are on hackage now * removed unsupported spread-based multimaster support fileServe: * now with sendfile() support! On supported platforms sendfile allows files to be served from the disk to the network in a zero-copy fashion. This means faster transfers, less memory and CPU usage, and no file handle leaks. (hopefully). sendfile uses native sendfile() support on Linux, Windows, OS X, and FreeBSD. Other platforms will use a sendfile emulation mode. We recommend that you use sendFile instead of sendFileStrict or sendFileLazy, unless you have specific needs and know some reason why you must use sendFileStrict or sendFileLazy. * FileServe internals majorly refactored. FileServe now provides a modular way of building your own fileServe-like functions. Also includes functions for serving a single file instead of the contents of a directory. * added more complete list of mime-types * automatically redirect from foo to foo/ if foo is a directory * filter . and .. from request path, but allow filenames and directories which start with . happstack-server: * ServerMonad instance for ErrorT * Added ServerMonad, FilterMonad, and WebMonad for XMLGenT * Added secure flag to cookies. Defaults to False. * fix supportsIPv6 to work with newer versions of network library * simpleHTTPWithSocket + bindPort for H.S.SimpleHTTP (you can use this to start the server as root, bind to the socket, and then drop privileges.) * Fixed Accept-Encoding parser to accepts encodings with a - in them. Added additional tests to acceptEncodingParserTest * fix so basicAuth sets correct response code and headers. * SimpleHTTP: added trailingSlash. Guard which checks that Request URI ends with a / * decode body of PUT requests not just POST * added ifModifiedSince guard * added host and withHost guards to SimpleHTTP (similar to dir and path, but for the requested hostname) other: * happstack-state: Correct an embarrassing race condition bug. * happstack-data: Exported getSafeGet and getSafePut * happstack: add state transition code to guestbook (add email to form, handler, and state), and tar of example _local state before transition experimental: * happstack-state: now has experimental replication support using Amazon Web Services. This support is disabled by default. This feature is highly experimental, may not work, and may even be completely removed in future versions (though, hopefully not). THANKS: Alex Jacobson David Himmelstrup / Lemmih Matthew Elder / mae Antoine Latter Erik Hesselink Pasqualino 'Titto' Assini Nils / McManiaC Thomas Hartman Creighton Hogg / wchogg John MacFarlane Jochem Berndsen / koeien MightByte And everyone who filed bug reports, tested RC1 and RC2, and anyone else I missed. From niklas.broberg at gmail.com Sat Dec 19 19:37:59 2009 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Sat Dec 19 19:11:53 2009 Subject: [Haskell] Re: [Haskell-cafe] ANN: Happstack 0.4.1 In-Reply-To: <99D43ACE-4235-45BD-8484-6BA0CC64F6E7@n-heptane.com> References: <99D43ACE-4235-45BD-8484-6BA0CC64F6E7@n-heptane.com> Message-ID: > ? GHC 6.12 currently requires a minor patch to HJScript. Details here: HJScript-0.4.5 is now on hackage, fixing this problem. Thanks for the heads-up. Cheers, /Niklas From matt at mattelder.org Mon Dec 21 01:44:23 2009 From: matt at mattelder.org (Matthew Elder) Date: Mon Dec 21 01:18:09 2009 Subject: [Haskell] Re: [Haskell-cafe] ANN: Happstack 0.4.1 In-Reply-To: <99D43ACE-4235-45BD-8484-6BA0CC64F6E7@n-heptane.com> References: <99D43ACE-4235-45BD-8484-6BA0CC64F6E7@n-heptane.com> Message-ID: <987d172d0912202244s4059576cjd78a4e70536f6f36@mail.gmail.com> Hooray! On 12/19/09, Jeremy Shaw wrote: > Happstack 0.4.1 STABLE is now available. > > We recommend that all users of Happstack update to 0.4.1 > immediately. Migration from Happstack 0.3 should be trivial. There was > one race condition in happstack-state which could cause a state event > to fail under heavy congestion. > > Happstack is the Haskell Application Server Stack. It is a scalable > framework for developing web applications. It is similar in purpose to > Django, RoR, Turbogears, Grails, Seaside, etc. > > Using less buzzwords, it is a collection of libraries which can be > used to develop a self-contained server application which does not > require SQL or Apache (though it can integrate with both). > > It includes: > > * an HTTP server > * a rich DSL for deconstructing HTTP Requests and generating > Responses > * HTML/XML/etc templating via HStringTemplate, HSP, or Text.XHtml > * a persistent data store based on user defined Haskell data types > with ACID properties and state migration > * and more!! > > Happstack's modular nature means it is easy to integrate unrelated 3rd > party modules such as Pandoc, or to add support for an alternative > templating system. Additionally, it does not exclude you from using > SQL, or supporting other protocols besides HTTP. > > HOMEPAGE: > > http://www.happstack.com/ > > SUPPORTED PLATFORMS: > > Happstack supports GHC 6.8, 6.10, and 6.12, under GNU/Linux, > FreeBSD, OS X, and Windows. > > GHC 6.12 currently requires a minor patch to HJScript. Details here: > > > http://groups.google.com/group/haskell-server-pages/browse_thread/thread/56f388fdbaec1420 > > INSTALL: > > 1. ensure that ~/.cabal/bin is in your $PATH > 2. cabal update > 3. cabal install happstack > > * see SUPPORTED PLATFORMS for information about GHC 6.12 > > > NOTABLE CHANGES: > > For a complete list of changes see: > > http://www.patch-tag.com/r/mae/happstack/snapshots/all/history > > Removed: > > * happstack-contrib has been completely removed. If you were > using something in it, please complain on the mailing list. > * removed Happstack.Server.S3 -- newer, better maintained S3 > libraries are on hackage now > * removed unsupported spread-based multimaster support > > fileServe: > > * now with sendfile() support! On supported platforms sendfile > allows files to be served from the disk to the network in a > zero-copy fashion. This means faster transfers, less memory and > CPU usage, and no file handle leaks. (hopefully). sendfile uses > native sendfile() support on Linux, Windows, OS X, and > FreeBSD. Other platforms will use a sendfile emulation mode. We > recommend that you use sendFile instead of sendFileStrict or > sendFileLazy, unless you have specific needs and know some reason > why you must use sendFileStrict or sendFileLazy. > > * FileServe internals majorly refactored. FileServe now provides > a modular way of building your own fileServe-like functions. Also > includes functions for serving a single file instead of the > contents of a directory. > > * added more complete list of mime-types > * automatically redirect from foo to foo/ if foo is a directory > * filter . and .. from request path, but allow filenames and > directories which start with . > > happstack-server: > > * ServerMonad instance for ErrorT > * Added ServerMonad, FilterMonad, and WebMonad for XMLGenT > * Added secure flag to cookies. Defaults to False. > * fix supportsIPv6 to work with newer versions of network library > * simpleHTTPWithSocket + bindPort for H.S.SimpleHTTP (you can > use this to start the server as root, bind to the socket, and then > drop privileges.) > * Fixed Accept-Encoding parser to accepts encodings with a - in > them. Added additional tests to acceptEncodingParserTest > * fix so basicAuth sets correct response code and headers. > * SimpleHTTP: added trailingSlash. Guard which checks that > Request URI ends with a / > * decode body of PUT requests not just POST > * added ifModifiedSince guard > * added host and withHost guards to SimpleHTTP (similar to dir > and path, but for the requested hostname) > > other: > > * happstack-state: Correct an embarrassing race condition bug. > * happstack-data: Exported getSafeGet and getSafePut > * happstack: add state transition code to guestbook (add email > to form, handler, and state), and tar of example _local state before > transition > > experimental: > > * happstack-state: now has experimental replication support using > Amazon Web Services. This support is disabled by default. This > feature is highly experimental, may not work, and may even be > completely removed in future versions (though, hopefully not). > > THANKS: > > Alex Jacobson > David Himmelstrup / Lemmih > Matthew Elder / mae > Antoine Latter > Erik Hesselink > Pasqualino 'Titto' Assini > Nils / McManiaC > Thomas Hartman > Creighton Hogg / wchogg > John MacFarlane > Jochem Berndsen / koeien > MightByte > > And everyone who filed bug reports, tested RC1 and RC2, and anyone > else I missed. > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > -- Sent from my mobile device Need somewhere to put your code? http://patch-tag.com Want to build a webapp? http://happstack.com From dons at galois.com Mon Dec 21 10:59:57 2009 From: dons at galois.com (Don Stewart) Date: Mon Dec 21 10:33:43 2009 Subject: [Haskell] Haskell Web News: Looking back on 2009 Message-ID: <20091221155957.GA8995@whirlpool.galois.com> The Haskell Web News is a monthly summary of the hottest news about the Haskell programming language, as found in our online communities. If you want to catch up with what?s been happening in Haskell, this might be the journal for you. In this edition, we look back on the major events of 2009. http://haskellwebnews.wordpress.com/2009/12/20/the-year-in-haskell/ -- Don From akenn at microsoft.com Tue Dec 22 10:14:49 2009 From: akenn at microsoft.com (Andrew Kennedy) Date: Tue Dec 22 09:48:46 2009 Subject: [Haskell] Final Call for Participation: TLDI'10 Message-ID: <39B4CD0B764E1B44AEA3DAA2F0385D54097798E6@DB3EX14MBXC306.europe.corp.microsoft.com> ********************************************************************* FINAL 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 Early registration deadline for POPL: December 22, 2009 (TODAY!) 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 mlexan at gmail.com Wed Dec 23 03:36:29 2009 From: mlexan at gmail.com (Michael Lee) Date: Wed Dec 23 03:10:06 2009 Subject: [Haskell] ghc-6.12.1 binary package for OpenSolaris b129 Message-ID: <7b6309700912230036n70f08af3la6e9ae80808ec5fa@mail.gmail.com> If anyone is interested in a binary package of ghc-6.12.1 for OpenSolaris, one can find said package at http://code.google.com/p/opensolaris-lang/. Please let me know how it works out for you. Thanks, -m -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20091223/29012a8a/attachment.html From marcel at bitrot.dyndns.org Fri Dec 25 11:51:58 2009 From: marcel at bitrot.dyndns.org (Marcel =?UTF-8?B?Rm91cm7DqQ==?=) Date: Fri Dec 25 11:25:34 2009 Subject: [Haskell] ANNOUNCE: hecc-0.2 Message-ID: <20091225175158.61ce3148@rechner.Biotop> Hi again, this is the second release of hecc, the Elliptic Curve Cryptography Library for Haskell, to be found at http://hackage.haskell.org/package/hecc There are only some smaller changes since the first release **3... * license change to the more common BSD3 * proper benchmarking * speed improvements * timing-attack resistant default point multiplication * simple key generation (given a generator on the curve used) En Detail: There are now 2 algorithms for point multiplication, the classic double-and-add (dnadd) and a montgomery ladder(montgladder). Dnadd varies in speed between 200us (degenerate case: long rows of zeroes) and 4.6ms while montgomery ladder (almost, see **1) always takes its 4.6ms. **2 Notes: **1 except when multiplying by binary numbers with trailing long rows of zeroes (e.g. 2^254), in which case it also takes 200us (cache?... anybody got more ideas how to fix this?) **2 Test HW: 2.4Ghz Core2, accompanying src/bench.hs, projective coordinates used **3 (due to an annoyingly complicated fracture of my main hand) This library still uses plain Haskell, in case anybody wants to ask... ;-) Still considered alpha, so beware of dragons! Almost enjoying holidays, welcoming feedback, Marcel -- Marcel Fourn? OpenPGP-Key-ID: 0x74545C72 A good library is preferable to a tool, except when you just need that one tool. From ivan.miljenovic at gmail.com Sat Dec 26 06:23:13 2009 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Sat Dec 26 05:56:54 2009 Subject: [Haskell] ANNOUNCE: graphviz-2999.8.0.0 Message-ID: <87bphm6kta.fsf@gmail.com> I am pleased to announce the latest release of my graphviz [1] library, which provides bindings and helper functions for use with the Graphviz [2] suite of graph visualisation programs. [1] http://hackage.haskell.org/package/graphviz [2] http://www.graphviz.org/ For the most part, this release has a compatible API with the 2999.7.0.0 version; the only exceptions to this are the runGraphviz and runGraphvizCommand functions in Data.GraphViz.Commands; I released after the last release that it might be useful to have these return the filenames of the files created rather than just indicating success, especially when using addExtension (from the same module) to add the correct extension to a provided filename. The rest of the changes to this release are: * Added support for generalised DotGraphs; this optional representation removes the restriction of ordering of Dot statements. This allows for greater flexibility of how to specify Dot code. As an offshoot from this, most relevant functions now utilise a new DotRepr class that work with both DotGraphs and the new GDotGraphs; this shouldn't affect any code already in use. * With the prompting of Noam Lewis, the augmentation functions have been revamped in two ways: - Now contains support for multiple edges. - The ability to perform "manual" augmentation if greater control is desired. * Add a preview function to quickly render and visualise an FGL graph using the Xlib canvas. * Added a pseudo-inverse of the FGL -> Dot functions (a graph is created, but the original node and edge labels are unrecoverable). * The Printing and Parsing modules have been moved (from Data.GraphViz.Types to Data.GraphViz). In the near future, this library is also likely to contain support for record shapes for graph nodes thanks to Minh Thu. If you want/require any additional features in graphviz, you too can do what countless (well, OK, not actually countless per-se) people like Noam and Thu have done: bug me to do it or send me a patch! ;-) (I hope that I don't have to make yet another release soon fixing an obvious flaw as soon as I actually start using this release myself...) -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From jmillikin at gmail.com Sun Dec 27 01:41:20 2009 From: jmillikin at gmail.com (John Millikin) Date: Sun Dec 27 01:14:57 2009 Subject: [Haskell] ANNOUNCE: CPython / libpython bindings Message-ID: <3283f7fe0912262241j603ce84bqf523ef9b74fad115@mail.gmail.com> CPython, the primary implementation of the Python language, has a C API for embedding Python into applications and writing extension modules[1]. The cpython[2] package is a binding to this API. It's not a complete binding yet -- there's a couple areas where I haven't figured out how to represent the C-ish idioms -- so it's not yet possible to do things like implement extension modules[3], run code directly from a file[4], or compile Python strings to code[4]. Hackage can't build docs because it doesn't have the Python development libraries installed, so I've uploaded them to . If you encounter any build errors, or have wishes / ideas on which parts of the API to add to the binding, please say so. I will add parts as I figure them out, but wanted to get a working version out ASAP so people can play with it. [1] http://docs.python.org/3.1/c-api/ [2] http://hackage.haskell.org/package/cpython/ [3] http://docs.python.org/3.1/c-api/module.html#initializing-c-modules [4] http://docs.python.org/3.1/c-api/veryhigh.html From thaldyron at gmail.com Sun Dec 27 12:53:59 2009 From: thaldyron at gmail.com (Peter Robinson) Date: Sun Dec 27 12:27:44 2009 Subject: [Haskell] ANN: stm-io-hooks-0.6.0 Message-ID: A new announcement, as the interface has changed quite a bit (e.g. 'onRetry' is gone) and previous versions had a rare but annoying bug due to the unpredictability of 'unsafeIOToSTM'. >From the package description: ----- This library provides an STM monad with commit and retry IO hooks. A retry-action is run (at least once) if the transaction retries, while commit-actions are executed iff the transaction commits. The AdvSTM monad also gives some atomicity guarantees for commit-actions: * When a TVar is modified in a transaction and this transaction commits, the update remains invisible to other threads until the corresponding onCommit action is run. * If the onCommit action throws an exception, the original values of the modified TVars are restored. Note: This library was inspired by the AdvSTM monad on the Haskell Wiki (see http://haskell.org/haskellwiki/?title=New_monads/MonadAdvSTM). Feedback is welcome! ----- From coreyoconnor at gmail.com Mon Dec 28 18:31:21 2009 From: coreyoconnor at gmail.com (Corey O'Connor) Date: Mon Dec 28 18:04:42 2009 Subject: [Haskell] ANN: vty-4.2.1.0 Message-ID: http://hackage.haskell.org/package/vty 4.2.1.0 * GHC 6.12.1 support * API changes: * Attr record accessor fore_color changed to attr_fore_color * Attr record accessor back_color changed to attr_back_color * Attr record accessor style changed to attr_style * Added an "inline" display attribute changing DSL: * put_attr_change applies a display attribute change immediately to a terminal * For instance, can be used to change the display attrbiutes of text output via putStrLn and putStr. EX: "put_attr_change $ back_color red" will set the background color to red. * Changes do not apply to a Picture output via output_picture. * See Graphics.Vty.Inline * Moved all IO actions into any monad an instance of MonadIO Short example of Graphics.Vty.Inline: import Graphics.Vty import Graphics.Vty.Inline main = do t <- terminal_handle putStr "Not styled. " put_attr_change t $ back_color red >> apply_style underline putStr " Styled! " put_attr_change t $ default_all putStrLn "Not styled." release_terminal t return () Cheers, Corey O'Connor From iavor.diatchki at gmail.com Tue Dec 29 13:24:46 2009 From: iavor.diatchki at gmail.com (Iavor Diatchki) Date: Tue Dec 29 12:58:08 2009 Subject: [Haskell] Nominations for the Haskell 2011 committee In-Reply-To: <4B2630CF.5040900@gmail.com> References: <4B2630CF.5040900@gmail.com> Message-ID: <5ab17e790912291024i7150d116tfcbe2e05b6f5f446@mail.gmail.com> Hello, I would like to participate in the design of Haskell 2011. I have used Haskell for about 10 years, commercially at Galois Inc, for the last 3. I have a good understanding of all parts of the language and various implementations, and I have a particular interest in its type system and semantics, which is why I think that I would be able to provide valuable input to the committee. -Iavor On Mon, Dec 14, 2009 at 4:34 AM, Simon Marlow wrote: > So that the Haskell 2011 cycle can get underway, we are soliciting > nominations for new committee members. ?Since this is the first time we've > done this, the procedure is still somewhat unsettled and things may yet > change, but the current guidelines are written down here: > > http://hackage.haskell.org/trac/haskell-prime/wiki/Committee > > In particular, on the makeup of the commitee: > > ?The committee should represent each class of stakeholders with > ?roughly equal weight. These classes are > > ? ?* Implementers (compiler/tool writers) > ? ?* Commercial users > ? ?* Non-commercial users (e.g. open source) > ? ?* Academic users (using Haskell in research) > ? ?* Teachers > ? ?* Authors > > ?In addition, members of the committee should be long-standing users > ?with a deep knowledge of Haskell, and preferably with experience of > ?language design. The committee should contain at least some members > ?with a comprehensive knowledge of the dark corners of the Haskell > ?language design, who can offer perspective and rationale for existing > ?choices and comment on the ramifications of making different choices. > > > To nominate someone (which may be yourself), send a message to > haskell-prime@haskell.org. ?Please give reasons for your nomination. > > The current committee will appoint new commitee members and editors starting > in the new year, so the deadline for nominations is 31 December 2009. > > During discussion amongst the current commitee, we realised that the choice > of committee should be informed not just by the criteria above, but also by > the particular proposals that are expected to be under consideration during > this cycle. ?With that in mind, we plan that following the nominations the > current committee will choose a "core commitee" of up to 10 members, and > further members may be appointed during the year based on expertise needed > to consider particular proposals. ?Accordingly, now would be a good time to > start discussing which proposals should be considered in the Haskell 2011 > timeframe, as that may affect the choice of commitee members. > > More details on the current Haskell Prime process are here: > > http://hackage.haskell.org/trac/haskell-prime/wiki/Process > > > Cheers, > ? ? ? ?Simon > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell >