From pirelo at googlemail.com Fri Jan 1 14:07:49 2010 From: pirelo at googlemail.com (Pablo Nogueira) Date: Fri Jan 1 13:41:02 2010 Subject: [Haskell] ANN: WFLP 2010 Call for participation Message-ID: ******************************************************************** Call For Participation WFLP2010 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Hotel reservation deadline: December 28, 2009 VENUE WFLP2010 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid. REGISTRATION To register for WFLP2010, follow the link from the POPL 2010 page, at http://www.cse.psu.edu/popl/10/ SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. INVITED SPEAKER Mariangiola Dezani (University of Torino, Italy) ACCEPTED PAPERS Transforming Functional Logic Programs into Monadic Functional Programs Bernd Brassel, Sebastian Fischer, Michael Hanus and Fabian Reck Mixed-level Embedding and JIT Compilation for an Iteratively Staged DSL George Giorgidze and Henrik Nilsson An Access Control Language based on Term Rewriting and Description Logic Michele Baggi, Demis Ballis and Moreno Falaschi Lazy and Faithful Assertions for Functional Logic Programs Michael Hanus Parameterized Models for On-line and Off-line Use Pieter Wuille and Tom Schrijvers A Denotational Semantics for Curry Jan Christiansen, Daniel Seidel and Janis Voigtlander A Declarative Debugger of Missing Answers for Functional and Logic Programming Rafael del Vado Virseda and Fernando Perez Morente Efficient and Compositional Higher-Order Streams Gergely Patai Bridging the gap between two Concurrent Constraint Languages Alexei Lescaylle Daudinot and Alicia Villanueva Garcia Large scale random testing with QuickCheck on MapReduce framework Shigeru Kusakabe and Yuuki Ikuta Automated verification of security protocols in tccp Alexei Lescaylle Daudinot and Alicia Villanueva Garcia Implementation and Evaluation of a Declarative Debugger for Java Herbert Kuchen and Christian Hermanns PROGRAM CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAM COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Bernd Brassel (CAU Kiel, Germany) Olaf Chitil (Univ. of Kent, UK) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (Univ. of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada) -------------- next part -------------- ******************************************************************** Call For Participation WFLP2010 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Hotel reservation deadline: December 28, 2009 VENUE WFLP2010 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid. REGISTRATION To register for WFLP2010, follow the link from the POPL 2010 page, at http://www.cse.psu.edu/popl/10/ SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. INVITED SPEAKER Mariangiola Dezani (University of Torino, Italy) ACCEPTED PAPERS Transforming Functional Logic Programs into Monadic Functional Programs Bernd Brassel, Sebastian Fischer, Michael Hanus and Fabian Reck Mixed-level Embedding and JIT Compilation for an Iteratively Staged DSL George Giorgidze and Henrik Nilsson An Access Control Language based on Term Rewriting and Description Logic Michele Baggi, Demis Ballis and Moreno Falaschi Lazy and Faithful Assertions for Functional Logic Programs Michael Hanus Parameterized Models for On-line and Off-line Use Pieter Wuille and Tom Schrijvers A Denotational Semantics for Curry Jan Christiansen, Daniel Seidel and Janis Voigtlander A Declarative Debugger of Missing Answers for Functional and Logic Programming Rafael del Vado Virseda and Fernando Perez Morente Efficient and Compositional Higher-Order Streams Gergely Patai Bridging the gap between two Concurrent Constraint Languages Alexei Lescaylle Daudinot and Alicia Villanueva Garcia Large scale random testing with QuickCheck on MapReduce framework Shigeru Kusakabe and Yuuki Ikuta Automated verification of security protocols in tccp Alexei Lescaylle Daudinot and Alicia Villanueva Garcia Implementation and Evaluation of a Declarative Debugger for Java Herbert Kuchen and Christian Hermanns PROGRAM CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAM COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Bernd Brassel (CAU Kiel, Germany) Olaf Chitil (Univ. of Kent, UK) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (Univ. of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada) From johan.tibell at gmail.com Wed Jan 6 07:38:31 2010 From: johan.tibell at gmail.com (Johan Tibell) Date: Wed Jan 6 07:11:49 2010 Subject: [Haskell] Reminder: ZuriHac - Haskell hackathon in Zurich, March 19-21 Message-ID: <90889fe71001060438n2b6bcbf9se71b11e037888e24@mail.gmail.com> Hi all! This is to remind you that we're organizing ZuriHac, a Haskell hackathon/get-together, to be held March 19-21 at the Google Office in Zurich, Switzerland. Lots of people have already registered but we still have space for more! If you plan on coming, please register [1] so we can make sure there's seating for everyone. Registration, travel, lodging and many other details will soon be available on the ZuriHac wiki [2]. If you have any questions don't hesitate to drop Christophe or me an email (or email addresses can be found on the wiki.) WHEN Friday March 19 2:30pm to 6:30pm Saturday March 20 10am to 6pm Sunday March 21 10am to 6pm WHERE We will be in the TechTalk area of the Google Office at Brandschenkestrasse 110. Please see the wiki [3] for directions. ORGANIZERS Johan Tibell Christophe Poucet Hope to see you in Zurich! - The ZuriHac team [1] http://haskell.org/haskellwiki/ZuriHac/Register [2] http://haskell.org/haskellwiki/ZuriHac [3] http://haskell.org/haskellwiki/ZuriHac#Getting_to_the_Google_Office From frederic.blanqui at inria.fr Thu Jan 7 03:26:51 2010 From: frederic.blanqui at inria.fr (Frederic Blanqui) Date: Thu Jan 7 02:59:52 2010 Subject: [Haskell] HOR 2010 1st CALL FOR ABSTRACTS Message-ID: <4B459ACB.9090505@inria.fr> ************************************** * * * HOR 2010 1st CALL FOR ABSTRACTS * * * ************************************** 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ IMPORTANT DATES: March 25, 2010 : deadline electronic submission of paper April 20, 2010 : notification of acceptance of papers May 17, 2010 : deadline for final version of accepted papers HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2010 is part of FLoC 2010 in Edinburgh. HOR 2007 was part of RDP 2007 in Paris, France. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED SPEAKERS: Maribel Fern?ndez King's College London, UK Silvia Ghilezan University of Novi Sad, Serbia PROGRAM COMMITTEE Zena Ariola University of Oregon, USA Fr?d?ric Blanqui INRIA & Tsinghua University, China Eduardo Bonelli Universidad Nacional de Quilmes, Argentina, chair Mariangiola Dezani-Ciancaglini Universit? di Torino, Italy Roel de Vrijer Vrije Universiteit, The Netherlands HOR 2010 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/conferences/?conf=hor2010 to submit or update your paper (updates are always possible before the deadline). Please address your questions to the PC chair, under: ebonelli * gmail.com (where '*' is replaced by '@'). PROCEEDINGS: The proceedings of HOR 2010 will be made available on the HOR 2010 web page and copies will be distributed to the participants at the workshop. Publication of post-workshop proceedings in EPTCS is under consideration. STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: Venue Coordinator of the local organizing committee of FLoC'2010: Floris Geerts (fgeerts@inf.ed.ac.uk) From v.dijk.bas at gmail.com Thu Jan 7 05:50:12 2010 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Thu Jan 7 05:23:25 2010 Subject: [Haskell] ANNOUNCE: safer-file-handles-0.1 Message-ID: Hello, I'm happy to announce another member in the 'monadic regions' family: safer-file-handles: http://hackage.haskell.org/package/safer-file-handles-0.1 The package uses my 'regions' and 'explicit-iomodes' packages to add two safety features on top of the regular System.IO file handles and operations: * Regional file handles. Files must be opened in a region. When the region terminates all opened files are automatically closed. The main advantage of regions is that the handles to the opened files can not be returned from the region which ensures no I/O with closed files is possible. * Explicit IOModes. The regional file handles are parameterized by the IOMode in which they were opened. All operations on handles explicitly specify the needed IOMode. This way it is impossible to read from a write-only handle or write to a read-only handle for example. The primary technique used in this package is called "Lightweight monadic regions" which was invented by Oleg Kiselyov and Chung-chieh Shan. See: http://okmij.org/ftp/Haskell/regions.html#light-weight This technique is implemented in the 'regions' package which is re-exported from 'safer-file-handles'. See the 'safer-file-handles-examples' package for examples how to use this package: darcs get http://code.haskell.org/~basvandijk/code/safer-file-handles-examples regards, Bas P.S. While I wrote this message I realized a serious lack of expressive power of my regions package. Namely that I can't write a program that opens two different types of resources in the _same_ region. If for example I want to combine my usb-safe package and this package the following won't type-check: openBoth ? Device ? FilePath ? IO () openBoth usbDevice filePath = runTopRegion $ do h1 ? open usbDevice ? RegionT Device s IO (RegionalHandle Device (RegionT Device s IO)) h2 ? openFile filePath ReadMode ? RegionT File s IO (RegionalHandle File (RegionT File s IO)) return () The reason, as can be seen from the types of the monadic actions, is that the monad types differ between the two actions and bind ((>>=) :: Monad m => m a -> (a -> m b) -> m b) obviously requires them to be the same. The main problem thus, is that I parameterized the region with the type of resources. Note that I'm working on a solution where I remove the resource type from RegionT. So instead of: newtype RegionT resource s (pr ? * ? *) ? = RegionT { unRegionT ? ReaderT (IORef [Opened resource]) pr ? } I will have: newtype RegionT s (pr ? * ? *) ? = RegionT { unRegionT ? ReaderT (IORef [SomeOpenedResource]) pr ? } data SomeOpenedResource = ? resource. Resource resource ? Some (Opened resource) Hopefully I will be able to release this fix before FP-NL tomorrow. From v.dijk.bas at gmail.com Thu Jan 7 10:00:31 2010 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Thu Jan 7 09:33:48 2010 Subject: [Haskell] ANNOUNCE: New versions of ALL the monadic regions packages Message-ID: Hello, As I explained in my announcement of 'safer-file-handles', I discovered a serious lack of expressive power in my 'regions' package. I have now solved that problem in the way I envisaged by removing the 'resource' parameter from 'RegionT' and using existential quantification to bring the 'resource' type back at the place I need it but hidden from the outside. Now you're able to open multiple types of resources in a single region which all will be closed automatically on termination of the region. These are the new releases: http://hackage.haskell.org/package/regions-0.2 http://hackage.haskell.org/package/regions-monadsfd-0.2 http://hackage.haskell.org/package/regions-monadstf-0.2.0.1 http://hackage.haskell.org/package/usb-safe-0.5 http://hackage.haskell.org/package/safer-file-handles-0.2 (Note that in the process I shuffled a bit with the API's. That's one of the reasons all these are major releases.) Do you want to see this in action? See 'example.hs' in the following package that demonstrates opening multiple different types of resources in a single region. The example extends the example in the 'usb-safe-examples' package by first opening a USB device (my USB mouse) and a temporary file in the same region. Next the device is configured, an interface is claimed and an alternate is set. Next some bytes are read from an endpoint of the device. Finally these bytes are written to the temporary file. It's fun to see this in action so do try it out: darcs get http://code.haskell.org/~basvandijk/code/usb-safe-and-safer-file-handles-examples/ regards and see some of you at FP-NL tomorrow! Bas From mblazevic at stilo.com Thu Jan 7 19:29:10 2010 From: mblazevic at stilo.com (=?utf-8?B?TWFyaW8gQmxhxb5ldmnEhw==?=) Date: Thu Jan 7 19:02:04 2010 Subject: [Haskell] ANN: Streaming Component Combinators 0.4 Message-ID: <.1262910550@magma.ca> Version 0.4 of Streaming Component Combinators, or SCC for short, has been released on Hackage. Get it at http://hackage.haskell.org/package/scc There isn't much new high-level functionality compared to the previous version, but the implementation has been heavily refactored and the foundations completely replaced. I'm particularly happy to have found a way to drop the ugly reliance on Data.Dynamic and to encode the required constraints in the type system instead. The foundation of streaming components in this version is the new Control.Concurrent.Coroutine module, whose main export is the monad transformer Coroutine. It can transform any monad into a suspendable, resumable, trampoline-style-runnable monad. Coroutines can be nested, which was the requirement for streaming and the main stumbling block for the implementation. The solution, worth at least 10 milliOlegs according to my estimate, was to parameterize the Coroutine with a functor that wraps the coroutine suspension, and to use nested functors for suspension from nested coroutines. The type system automatically figures out how many wrappings to apply to each suspension depending on how many intermediate coroutines it suspends. In other news is the project's Wiki page at http://trac.haskell.org/SCC/wiki/. It's still rudimentary, but growing. All feedback will be appreciated. From ivan.miljenovic at gmail.com Fri Jan 8 09:08:01 2010 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Fri Jan 8 08:40:55 2010 Subject: [Haskell] ANNOUNCE: SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0 Message-ID: <87y6k81ygu.fsf@gmail.com> I'm pleased to announce the latest releases of SourceGraph [1] and Graphalyze [2]. [1]: http://hackage.haskell.org/package/SourceGraph [2]: http://hackage.haskell.org/package/Graphalyze SourceGraph is a program that performs static code analysis on Haskell projects on the by applying graph theoretic techniques to the project's call graph. Graphalyze is a library for analysing discrete data using graph theory, and as such performs the heavy lifting for SourceGraph. Sample analysis reports generated by SourceGraph are available at http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html . I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January. [3]: http://www.program-transformation.org/PEPM10/ Changes since the previous version include: * Now supports "implicitly exported" entities (as requested by Curt Sampson). This includes instantiated class methods from other modules and functions, etc. that start with an underscore (see http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html for more information). * All inaccessible entities are now reported, not just those that were root nodes in the call graph. * Edges are now colour-coded based upon whether they are part of a clique, cycle or a chain. * Level-based analyses: visualise how deep an entity is from those exported entities. * A re-done TODO that lists in detail what is planned for SourceGraph. * Lots of under-the-hood changes that don't sound as interesting as the above :-( -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From ivan.miljenovic at gmail.com Fri Jan 8 09:29:41 2010 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Fri Jan 8 09:02:36 2010 Subject: [Haskell] ANNOUNCE: SourceGraph-0.6.0.1 In-Reply-To: <87y6k81ygu.fsf@gmail.com> (Ivan Lazar Miljenovic's message of "Sat, 09 Jan 2010 00:08:01 +1000") References: <87y6k81ygu.fsf@gmail.com> Message-ID: <87tyuw1xgq.fsf@gmail.com> I realised soon after I sent the announcement email that there was a bug in one of the new "subtle" features that I didn't list, namely the background shading of directories in import visualisation. As such, SourceGraph 0.6.0.1 contains this fix. There were also two other features in 0.6.0.0 that I forgot to mention: * SourceGraph will (well, should; I haven't managed to come across a situation where it occurs anyway) no longer throw a fit if Graphviz throws an error when visualising a graph; instead it will just put an error message into the generated report. * The generated Dot code is also saved in the SourceGraph/graphs/ subdirectory, so you can tweak the call graphs of your programs. Ivan Lazar Miljenovic writes: > I'm pleased to announce the latest releases of SourceGraph [1] and > Graphalyze [2]. > > [1]: http://hackage.haskell.org/package/SourceGraph > [2]: http://hackage.haskell.org/package/Graphalyze > > SourceGraph is a program that performs static code analysis on Haskell > projects on the by applying graph theoretic techniques to the project's > call graph. Graphalyze is a library for analysing discrete data using > graph theory, and as such performs the heavy lifting for SourceGraph. > > Sample analysis reports generated by SourceGraph are available at > http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html . > I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January. > > [3]: http://www.program-transformation.org/PEPM10/ > > Changes since the previous version include: > > * Now supports "implicitly exported" entities (as requested by Curt > Sampson). This includes instantiated class methods from other > modules and functions, etc. that start with an underscore (see > http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html > for more information). > > * All inaccessible entities are now reported, not just those that were > root nodes in the call graph. > > * Edges are now colour-coded based upon whether they are part of a > clique, cycle or a chain. > > * Level-based analyses: visualise how deep an entity is from those > exported entities. > > * A re-done TODO that lists in detail what is planned for SourceGraph. > > * Lots of under-the-hood changes that don't sound as interesting as the > above :-( -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From emilio at mcs.le.ac.uk Sat Jan 9 06:59:44 2010 From: emilio at mcs.le.ac.uk (Emilio Tuosto) Date: Sat Jan 9 06:32:36 2010 Subject: [Haskell] Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010 Message-ID: <201001091159.44922.emilio@mcs.le.ac.uk> Due to several requests, the TGC'10 chairs have decided to extend the deadline for submsissions to January 20th ================================================================ Call for Papers TGC 2010 Fifth International Symposium on TRUSTWORTHY GLOBAL COMPUTING http://www.pst.ifi.lmu.de/tgc2010 LMU, Munich, February 26-26, 2010 ---------------------------------------------------------------- co-located with the review of FP6 GCII projects AEOLUS and SENSORIA ================================================================ IMPORTANT DATES --------------- Paper submissions: January 20, 2010 EXTENDED Final version (pre-proc.): February, 2010 Conference: February 24-26, 2010 Final version (post-proc.): March 22, 2010 SCOPE ------ The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorously about their behaviour and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit papers in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * resource usage and information flow policies * game-theoretic approaches to selfishness * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * sharing information and computation * efficient communication * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers, static analyzers * approximation algorithms, impossibility results, and structural properties * privacy, reliability and business integrity SUBMISSION DETAILS ------------------ Papers can be submitted online through the EASYCHAIR website http://www.easychair.org/conferences/?conf=tgc2010 Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. PROCEEDINGS ----------- We plan to publish Springer LNCS post-proceedings shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. ORIGINS & PLANS --------------- In 2010, the symposium is co-located with the reviews of the following FP6 GCII projects: AEOLUS - Algorithmic Principles for Building Efficient Overlay Computers SENSORIA - Software Engineering for Service-Oriented Overlay Computers TGC 2008, the fourth Symposium on Trustworthy Global Computing, was held in Barcelona (Spain), on November 3 - 4, 2008. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2007 was held on November 5-6, 2007 in Sophia-Antipolis, France and it was followed by the Workshop on the Interplay of Programming Languages and Cryptography on November 7, 2007. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2006 was held in Lucca (Italy), on November 7 - 9, 2006 and it was co-located with the reviews of EU FET-IST FP6 Projects AEOLUS, MOBIUS, SENSORIA and CATNETS. The first TGC event took place in Edinburgh on April 7-9, 2005 with the co-sponsorship of IFIP TC-2, as part of ETAPS 2005. TGC 2005 was the evolution of the previous Global Computing I Workshops held in Rovereto in 2003 and 2004 (see e.g. LNCS 2874) and the workshops on Foundation of Global Computing held as satellite events of ICALP and Concur (see e.g. ENTCS Vol. 85). STEERING COMMITTE ----------------- Gilles Barthe (IMDEA Software, Madrid) Rocco De Nicola (University of Florence) Christos Kaklamanis (University of Patras) Ugo Montanari (University of Pisa) Davide Sangiorgi (University of Bologna) Don Sannella (University of Edinburgh) Vladimiro Sassone (University of Southampton) Martin Wirsing (University of Munich) PROGRAM CHAIRS -------------- Martin Hofmann - hofmann@tcs.ifi.lmu.de Institut fur Informatik, LMU Munich Martin Wirsing - wirsing@lmu.de Institut fur Informatik, LMU Munich PROGRAM COMMITTEE (to be invited!) ----------------- * Gilles Barthe (IMDEA Software, Madrid) * Roberto Bruni (University of Pisa) * Rocco De Nicola (University of Florence) * Howard Foster (Imperial College) * Samir Genaim (Universidad Complutense de Madrid) * Stefania Gnesi (ISTI, Pisa) * Martin Hofmann (LMU Munich) (co-chair) * Thomas Jensen (IRISA, Rennes) * Christos Kaklamanis (University of Patras) * Alberto Marchetti-Spaccamela (University of Roma "La Sapienza") * Paddy Nixon (University College Dublin) * Giuseppe Persiano (University of Salerno) * Geppino Pucci (University of Padova) * Paola Quaglia (University of Trento) * Don Sannella (University of Edinburgh) * Vladimiro Sassone (University of Southampton) * Maria J. Serna (Universitat Polit?cnica de Catalunya) * Carolyn Talcott (SRI International) * Emilio Tuosto (University of Leicester) * Nobuko Yoshida (Imperial College London) * Martin Wirsing (LMU Munich) (co-chair) * Franco Zambonelli (University of Modena) LOCAL ORGANIZATION ------------------ * Nora Koch (chair) * Axel Rauschmayer * Gefei Zhang -- *************************************************************** 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 ivan.miljenovic at gmail.com Sun Jan 10 06:32:51 2010 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Sun Jan 10 06:05:45 2010 Subject: [Haskell] ANNOUNCE: SourceGraph-0.6.0.2 In-Reply-To: <87tyuw1xgq.fsf@gmail.com> (Ivan Lazar Miljenovic's message of "Sat, 09 Jan 2010 00:29:41 +1000") References: <87y6k81ygu.fsf@gmail.com> <87tyuw1xgq.fsf@gmail.com> Message-ID: <87my0mqjoc.fsf_-_@gmail.com> I've just uploaded a new version that works with haskell-src-exts-1.6.0 (all it needed was to increase the upper bound in the cabal file! \o/). On another note, anyone know why Niklas Broberg hasn't been making any release statements recently to say what the changes are, etc. for haskell-src-exts? Ivan Lazar Miljenovic writes: > I realised soon after I sent the announcement email that there was a bug > in one of the new "subtle" features that I didn't list, namely the > background shading of directories in import visualisation. As such, > SourceGraph 0.6.0.1 contains this fix. > > There were also two other features in 0.6.0.0 that I forgot to mention: > > * SourceGraph will (well, should; I haven't managed to come across a > situation where it occurs anyway) no longer throw a fit if Graphviz > throws an error when visualising a graph; instead it will just put an > error message into the generated report. > > * The generated Dot code is also saved in the SourceGraph/graphs/ > subdirectory, so you can tweak the call graphs of your programs. > > Ivan Lazar Miljenovic writes: > >> I'm pleased to announce the latest releases of SourceGraph [1] and >> Graphalyze [2]. >> >> [1]: http://hackage.haskell.org/package/SourceGraph >> [2]: http://hackage.haskell.org/package/Graphalyze >> >> SourceGraph is a program that performs static code analysis on Haskell >> projects on the by applying graph theoretic techniques to the project's >> call graph. Graphalyze is a library for analysing discrete data using >> graph theory, and as such performs the heavy lifting for SourceGraph. >> >> Sample analysis reports generated by SourceGraph are available at >> http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html . >> I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January. >> >> [3]: http://www.program-transformation.org/PEPM10/ >> >> Changes since the previous version include: >> >> * Now supports "implicitly exported" entities (as requested by Curt >> Sampson). This includes instantiated class methods from other >> modules and functions, etc. that start with an underscore (see >> http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html >> for more information). >> >> * All inaccessible entities are now reported, not just those that were >> root nodes in the call graph. >> >> * Edges are now colour-coded based upon whether they are part of a >> clique, cycle or a chain. >> >> * Level-based analyses: visualise how deep an entity is from those >> exported entities. >> >> * A re-done TODO that lists in detail what is planned for SourceGraph. >> >> * Lots of under-the-hood changes that don't sound as interesting as the >> above :-( -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From niklas.broberg at gmail.com Sun Jan 10 07:43:41 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Sun Jan 10 07:16:27 2010 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: SourceGraph-0.6.0.2 In-Reply-To: <87my0mqjoc.fsf_-_@gmail.com> References: <87y6k81ygu.fsf@gmail.com> <87tyuw1xgq.fsf@gmail.com> <87my0mqjoc.fsf_-_@gmail.com> Message-ID: > On another note, anyone know why Niklas Broberg hasn't been making any > release statements recently to say what the changes are, etc. for > haskell-src-exts? Because it's been so many relatively small releases of late that I haven't wanted to spam the lists. :-) If you want to keep up to date, the changes can be found here: http://code.haskell.org/haskell-src-exts/CHANGELOG Cheers, /Niklas From ivan.miljenovic at gmail.com Sun Jan 10 08:15:06 2010 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Sun Jan 10 07:47:55 2010 Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: SourceGraph-0.6.0.2 In-Reply-To: (Niklas Broberg's message of "Sun, 10 Jan 2010 13:43:41 +0100") References: <87y6k81ygu.fsf@gmail.com> <87tyuw1xgq.fsf@gmail.com> <87my0mqjoc.fsf_-_@gmail.com> Message-ID: <87iqbaqexx.fsf@gmail.com> Niklas Broberg writes: > Because it's been so many relatively small releases of late that I > haven't wanted to spam the lists. :-) I for one say spam away! Especially with a change like 1.5 -> 1.6. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com From jfredett at gmail.com Sun Jan 10 12:01:19 2010 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sun Jan 10 11:34:10 2010 Subject: [Haskell] Haskell Weekly News: Issue 145 - January 10, 2010 Message-ID: <4b4a07df.9553f10a.6e3c.17fd@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100110 Issue 145 - January 10, 2010 --------------------------------------------------------------------------- Welcome to issue 145 of HWN, a newsletter covering developments in the [1]Haskell community. Welcome back Haskellers to the HWN! After a short hiatus we return with a megaedition covering the last three weeks of Haskell news and discussion. Needless to say, lots of new package and event announcements, as well as some really great discussions (the discussion about 'lawless' uninstances of Functors was particularly interesting) over the holiday break. Hopefully everyone had a safe and happy holiday season, and is back now steadily working off the winter-weight (in accordance with resolutions or no) by tapping steadily at the keyboard, producing wonderful new packages for me to place in this, your Haskell Weekly News! Announcements Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010. Emilio Tuosto [2]announced an extension to the TGC'10 call for papers. SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0. Ivan Lazar Miljenovic [3]announced new releases of the SourceGraph and Graphalyze packages. Streaming Component Combinators 0.4. Mario Blazevic [4]announced version 0.4 of Streaming Component Combinators (SCC). safer-file-handles-0.1. Bas van Dijk [5]announced a new member of the 'monadic regions' family -- safer-file-handles. This package provides safety features on top of System.IO for handling file handles and operations. HOR 2010 1st CALL FOR ABSTRACTS. Frederic Blanqui [6]1f4e gmane.comp.lang.haskell.general/17710 announced the first call for abstracts for the Fifth International Workshop on Higher-Order Rewriting. vty-4.2.1.0. Corey O'Connor [7]announced a new version of the vty package. stm-io-hooks-0.6.0. Peter Robinson [8]announced a new version of stm-io-hooks. This version includes major interface changes, including the elimation of the 'onRetry' combinator. hecc-0.2. Marcel Fourne [9]announced the second release of his elliptic curve cryptography package, hecc. This release includes a license change to the BSD3 license, speed improvements, and new algorithms for point multiplication, as well as other changes. ghc-6.12.1 binary package for OpenSolaris. Michael Lee [10]announced a binary package availability of ghc-6.12 for OpenSolaris. Final Call for Participation: TLDI'10. Andrew Kennedy [11]announced the final call for participation in TLDI'10, the Workshop on Types in Language Design and Implementation. Haskell Web News: Looking back on 2009. Don Stewart [12]announced The Haskell Web News, a monthly summary of the hottest news about the Haskell programming language. hakyll-0.4. Jasper Van der Jeugt [13]announced the release of hakyll, a static site generator library. system-uuid-1.2.0. Jason Dusek [14]announced a new release of system-uuid. New versions of ALL the monadic regions packages. Bas van Dijk [15]announced a new version of all of the monadic regions packages, explanation of what this means is best left to the original post, linked previously. tuntap-0.0.1. John Van Enk [16]announced a new package, extracted from his in-progress VPN project. This package provides access to the TUN/TAP device in Linux. CPython / libpython bindings. John Millikin [17]announced a package providing bindings to the C API for CPython/libpython. Discussion Typed Configuration Files. Sebastian Fischer [18]asked about whether there was an analogue to CmdArgs for config files. Review request for my permutations implementation. CK Kashyap [19]asked for a review of his implementation of a function for finding permutations -- in addition to a review he asked for earlier for code involving monads. The result is a nice pair of threads with introductory material about idiomatic, efficient Haskell code. lawless instances of Functor. Paul Brauner [20]asked about 'lawless' instances (Editor's Note: more so -- 'uninstances', since by definition, it cannot be a functor without satisfying the laws, even if it an instance can be written) of the `Functor` class. This is in an effort to better understand how Functors work in Haskell and in the wider theory. Blog noise [21]Haskell news from the [22]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Mitchell: [23]Using .ghci files to run projects. * Tom Moertel: [24]A formal language for recipes: brain dump. * Mark Jason Dominus: [25]A monad for probability and provenance. * Alex Mason: [26]A small follow up. * Russell O'Connor: [27]Constructive Classical Completeness. * Galois, Inc: [28]GHC Nominated for Programming Language Award. * Neil Brown: [29]CHP vs CML, Forking and Picky Receivers. * Conal Elliott: [30]Is Haskell a purely functional language?. * Conal Elliott: [31]Can functional programming be liberated from the von Neumann paradigm?. * Real-World Haskell: [32]Real World Haskell in Japaneseâå®æ¦ã§å¦ã¶é¢æ°åè¨èªããã°ã©ãã³ã°. * Conal Elliott: [33]Garbage collecting the semantics of FRP. * Alex Mason: [34]Why I love Cereal. * Mark Jason Dominus: [35]A short bibliography of probability monads. * Conal Elliott: [36]Communication, curiosity, and personal style. * Epilogue for Epigram: [37]Bidirectional Basics. * Neil Mitchell: [38]Explaining Haskell IO without Monads. * Conal Elliott: [39]Is program proving viable and useful?. * Conal Elliott: [40]Why program with continuous time?. Quotes of the Week * fasta: Haskell is like an efficient version of Python and is used for the same things. * koeien37: there are the languages that everybody complains about, and the languages that nobody use * Pseudonym: Olegs can be warded off by adding a note claiming that it's impossible to implement in the type system. * elly: I leave for five minutes and godel numbering of endofunctors is invokved as a potential proof that the universe is simulated. Thanks, #haskell :P * kmc: a monad is like an invisible train filled with jello traveling backwards in time * conal: "Obviously" is one of those words that is most useful when it is least true * Jafet: Javascript is pretty much a DSL for making your web browser take up more CPU * copumpkin: limpac: in this channel we're all automata with no feelings, except for the occasional feeling of hate. * dmhouse: I'm not sure it's working correctly but it sure is fast... * Cale: We need a bunch of "Will it monad?" video clips, with "It monads!" at the end of each. * merijn: I run on HST (Hacker Standard Time) which is essentially current time zone -3 * ray: [about an anti-FP blog post] i came up with some contrived example, announced that it's impossible, and therefore FP sucks * hiredman: I used to think "dons" was a title, like people who were recognized as being really good at haskell were called dons About the Haskell Weekly News New editions are posted to [41]the Haskell mailing list as well as to [42]the Haskell Sequence and [43]Planet Haskell. [44]RSS is also available, and headlines appear on [45]haskell.org. To help create new editions of this newsletter, please see the information on [46]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [47]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17716 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17714 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17713 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17711 6. http://article.gmane.org/ 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17705 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17704 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17701 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17700 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17699 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17698 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68864 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68857 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68827 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68807 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68388 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68865 19. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68811 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68711 21. http://planet.haskell.org/ 22. http://haskell.org/haskellwiki/Blog_articles 23. http://neilmitchell.blogspot.com/2010/01/using-ghci-files-to-run-projects.html 24. http://blog.moertel.com/articles/2010/01/08/a-formal-language-for-recipes-brain-dump 25. http://blog.plover.com/prog/haskell/probmonad.html 26. http://random.axman6.com/blog/?p=139 27. http://r6.ca/blog/20100107T035902Z.html 28. http://www.galois.com/blog/2010/01/06/ghc-nominated-for-programming-language-award/ 29. http://chplib.wordpress.com/2010/01/06/chp-vs-cml-forking-and-picky-receivers/ 30. http://conal.net/blog/posts/is-haskell-a-purely-functional-language/ 31. http://conal.net/blog/posts/can-functional-programming-be-liberated-from-the-von-neumann-paradigm/ 32. http://www.realworldhaskell.org/blog/2010/01/05/real-world-haskell%e2%80%94%e5%ae%9f%e6%88%a6%e3%81%a7%e5%ad%a6%e3%81%b6%e9%96%a2%e6%95%b0%e5%9e%8b%e8%a8%80%e8%aa%9e%e3%83%97%e3%83%ad%e3%82%b0%e3%83%a9%e3%83%9f%e3%83%b3%e3%82%b0/ 33. http://conal.net/blog/posts/garbage-collecting-the-semantics-of-frp/ 34. http://random.axman6.com/blog/?p=124 35. http://blog.plover.com/prog/haskell/probmonad-refs.html 36. http://conal.net/blog/posts/communication-curiosity-and-personal-style/ 37. http://www.e-pig.org/epilogue/?p=283 38. http://neilmitchell.blogspot.com/2010/01/haskell-io-without-monads.html 39. http://conal.net/blog/posts/is-program-proving-viable-and-useful/ 40. http://conal.net/blog/posts/why-program-with-continuous-time/ 41. http://www.haskell.org/mailman/listinfo/haskell 42. http://sequence.complete.org/ 43. http://planet.haskell.org/ 44. http://sequence.complete.org/node/feed 45. http://haskell.org/ 46. http://haskell.org/haskellwiki/HWN 47. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From johanj at cs.uu.nl Sun Jan 10 14:09:02 2010 From: johanj at cs.uu.nl (Johan Jeuring) Date: Sun Jan 10 13:41:46 2010 Subject: [Haskell] ANNOUNCE: Palindromes 0.2 Message-ID: <88A86C52-CF81-46AC-AC3B-47D311F3ECF4@cs.uu.nl> Palindromes 0.2 ============================================== Palindromes is a package for finding palindromes in files. Palindromes 0.2 is now available on hackage. Visit the homepage http://www.jeuring.net/Palindromes/ In version 0.2, the following features have been added: - Read from standard input, via the flag -i - More flexible flag handling - Read multiple files - Specify minimum length of palindromes returned, via the flag -m int For more information, consult the README file in the distribution. -- Johan Jeuring From torsten.grust at uni-tuebingen.de Mon Jan 11 16:05:11 2010 From: torsten.grust at uni-tuebingen.de (Torsten Grust) Date: Mon Jan 11 15:37:50 2010 Subject: [Haskell] =?iso-8859-1?q?Open_Position_=28PhD_student_or_Postdoc?= =?iso-8859-1?q?=29=2C_U_T=FCbingen=2C_Germany_?= Message-ID: [ Dear Haskellers! This job opening may sound a bit database-ish on a first read, but there is lots of Haskell and functional programming inside. Please contact me if you're in doubt. Best wishes, --Torsten ] Join us on the fringes between database and programming languages The Database Systems Research Group (Prof. Torsten Grust) at the Wilhelm-Schickard-Institute for Computer Science of Eberhard Karls Universit?t T?bingen, Germany, opens a position for a Research Assistant (PhD student or Postdoc level, three-year, full-time) in the Ferry research project[1]. Ferry explores how far we can push the idea of relational database engines that support the super-fast execution of programs written in a variety of programming languages. Our current focus is on LINQ, Ruby, and Philip Wadler's Links, but consider this list as open-ended. = DATABASE-SUPPORTED PROGRAM EXECUTION = We search for, design, and implement new compilation strategies that map data types and idioms prevalent in (functional) programming and scripting languages into efficient database queries. Ferry targets off-the-shelf SQL database systems as well as a number of off-beat database engines (e.g., X100, MonetDB, or kdb+). We build on technology developed in the context of our project Pathfinder[2]. Implementation languages are Haskell, O'Caml and C. This demo video[3] provides a flavor of the ideas behind Ferry. Ferry is supported by the DFG (German Research Foundation). = REQUIREMENTS = We are looking forward to grow our team and welcome applications of highly motivated candidates with an excellent university degree (Master in Computer Science or a closely related field) who are willing to develop and shape the future of Ferry. If you are a database person, that's great. If you are into (functional) programming languages, that's perfect. (Yes, we love SQL /and/ Haskell.) Last but not least, we hope that you like systems building as much as we do. The position has no teaching obligations -- if you would like to get involved with teaching nevertheless, please let us know. Good knowledge of English (research and publication) is a requirement, a reasonable command of German will be helpful. = JOB DETAILS AND APPLICATION = Successful candidates will sign a contract with the Universit?t T?bingen under the current regulations applicable to employees in Public Service (TV-L). This is a three-year full-time position. The exact start date in the time frame March till May 2010 is negotiable. You will be working in T?bingen, the traditional university town in the Neckar valley (Stuttgart region). Our group offers an informal, open, and fun working environment. Universit?t T?bingen aims at increasing the number of female employees and thus especially welcomes applications of female candidates. Applications of disabled candidates will be given priority, depending on their suitability. Please send your complete application in PDF format via e-mail to Prof. Torsten Grust (torsten.grust@uni-tuebingen.de). The deadline for applications is Feburary 19, 2010. Inquiries with respect to this position may be directed to Prof. Torsten Grust +49 7071 / 29 75477 torsten.grust@uni-tuebingen.de www-db.informatik.uni-tuebingen.de [1] http://www.ferry-lang.org/ [2] http://www.pathfinder-xquery.org/ [3] http://bit.ly/4GKEhQ (MP4, approx. 10MB), or http://www.youtube.com/watch?v=JRKmRiW_v4Q&fmt=18 (YouTube) -- | Prof. Dr. Torsten Grust torsten.grust@uni-tuebingen.de | | www-db.informatik.uni-tuebingen.de | | Database Systems - Universit?t T?bingen (Germany) | From julien.verlaguet at gmail.com Mon Jan 11 19:13:32 2010 From: julien.verlaguet at gmail.com (Julien Verlaguet) Date: Mon Jan 11 18:46:10 2010 Subject: [Haskell] Job at Mylife Message-ID: Dear Haskell Programmers, Our company, MyLife, is continuing to seek OCaml programmers to expand our team in the Silicon Valley. We develop back-end people search technologies and the vast majority of our code is written in Objective Caml and runs on Linux. We love that as it provides us with an opportunity to tackle on big challenges with great productivity. We are now looking for talented and passionate people to share the fun in Mountain View, California. The primary requirements for the job are: - proficiency in a functional programming language and eventually OCaml - familiarity with Linux and shell scripting - proficiency in written English, as much of our team communications are written (brainstorms, bug reports, etc.) - ability to understand end-user requirements and translate them into robust software that gets the job done The ideal candidate will have a good nose for hunting bugs, diagnosing performance problems, and hacking his/her way through colleagues' code. Please contact us at ocaml-job@mylife.com if you are interested or might be interested in the future. Julien -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20100111/c23a9393/attachment.html From rjmh at chalmers.se Tue Jan 12 08:36:05 2010 From: rjmh at chalmers.se (John Hughes) Date: Tue Jan 12 08:08:44 2010 Subject: [Haskell] AST 2010 reminder--call for papers and presentations Message-ID: <3BB52CEEEB8AE2488CC54C1793B3C85418742F27@MAPI01.ita.chalmers.se> Just a reminder: the submission deadline for AST 2010 (Automation of Software Test 2010, associated with ICSE 2010 in Cape Town) is only a week away. If you're planning to submit a paper or a presentation for the workshop, then now's the time to be putting it together! http://www.cs.allegheny.edu/ast2010/ John Hughes -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20100112/7c34de32/attachment.html From Malcolm.Wallace at cs.york.ac.uk Wed Jan 13 12:27:20 2010 From: Malcolm.Wallace at cs.york.ac.uk (Malcolm Wallace) Date: Wed Jan 13 12:01:22 2010 Subject: [Haskell] ANN: HaXml-1.20.1 Message-ID: I am pleased to announce a new, stable, release of HaXml. (Actually, 1.20 has been available for some time, but I am just getting round to the announcement, and a fresh bugfix means a version bump to 1.20.1.) HaXml-1.20.1 ------------ http://haskell.org/HaXml http://hackage.haskell.org/package/HaXml If you have been using the previous stable version, 1.13.x, you are strongly encouraged to upgrade, as no further bugfixes will be back- propagated. (Ideally, Cabal and Hackage should also now cease to recommend 1.13.x as a preferred version, but I do not know how to change that. A simple "cabal install HaXml" will unfortunately still find 1.13.x, so please use "cabal install HaXml-1.20.1" with explicit version number.) There have been significant API changes since 1.13.x, and a brief migration guide is included on the website. In summary: * There is a SAX-like stream parser. * Ordinary parsing of XML documents can now also be lazy. * Some types have changed. * Some old classes have been re-arranged into a single new class. Regards, Malcolm From ross at soi.city.ac.uk Wed Jan 13 12:38:34 2010 From: ross at soi.city.ac.uk (Ross Paterson) Date: Wed Jan 13 12:10:58 2010 Subject: [Haskell] ANN: HaXml-1.20.1 In-Reply-To: References: Message-ID: <20100113173834.GA18398@soi.city.ac.uk> On Wed, Jan 13, 2010 at 05:27:20PM +0000, Malcolm Wallace wrote: > Ideally, Cabal and Hackage should also now cease to recommend 1.13.x > as a preferred version, but I do not know how to change that. done From xana at di.uminho.pt Thu Jan 14 05:24:21 2010 From: xana at di.uminho.pt (Alexandra Silva) Date: Thu Jan 14 04:56:53 2010 Subject: [Haskell] Two PhD positions in theoretical computer science Message-ID: <4B4EF0D5.8090403@di.uminho.pt> Vacancies for PhD positions in theoretical computer science =========================================================== Leiden Institute of Advanced Computer Science (LIACS) of Leiden University and Centrum Wiskunde & Informatica (CWI) in Amsterdam are looking for two PhD students for working in the NWO funded research project CoRE: Coinductive Calculi of Regular Expressions The purpose of the project is to use the theory of coalgebras and Kleene algebras for automatic reasoning and verification of quantitative and probabilistic systems, interactive systems and advanced functional programs. We are looking for excellent candidates with a background (Master degree) in mathematics, computer science or a related degree and who have strong interest in the mathematical foundations of computer science. Conditions of employment ------------------------ There are two PhD positions available. One candidate will be employed at LIACS in the Foundations of Software Technology (FAST) group. The other will be employed at CWI in the Coordination Languages group (SEN3) in the sub-group `Coalgebraic Models of Computation' led by Prof. Jan Rutten. Both groups provide a dynamic and productive work environment, are in close collaboration with each other and are involved in several national and international research projects. Both PhD candidates will be appointed for a period of four years and will receive salary based on a full-time employment. The salary and labour agreements are in accordance with the CAO for Dutch universities and research institutes. How to Apply? ------------- You are invited to send your application letter together with a curriculum vitae (including a list of master courses), an abstract of your master thesis or a list of publications, and the names and contact addresses of two potential referees. Please send your application before 1 March 2010 to: Marcello Bonsangue and Milad Niqui From zhen.sydow at gmail.com Thu Jan 14 06:26:14 2010 From: zhen.sydow at gmail.com (Luis Cabellos) Date: Thu Jan 14 05:58:45 2010 Subject: [Haskell] Signature error because the order Message-ID: <3f3964001001140326v42881d8ao217bd9a900a728fc@mail.gmail.com> Hi, I found than this piece of code causes an error in GHC ( * http://haskell.pastebin.com/m5e3f4a4c* ): data Tree a = Leaf a | Node (Tree a) (Tree a) --prettyShow :: (Show a, Num a) => Tree a -> String -- WORKS prettyShow :: (Num a, Show a) => Tree a -> String -- FAILS prettyShow (Leaf a) = show a prettyShow (Node a b) = (simple a) ++ (simple b) simple :: (Show a, Num a) => Tree a -> String simple (Leaf x) = prettyShow (Leaf x) simple x = "(" ++ prettyShow x ++ ")" With the error: test.lhs:14:0: Couldn't match expected type `Show a' against inferred type `Num a1' When matching the contexts of the signatures for prettyShow :: forall a. (Num a, Show a) => Tree a -> String simple :: forall a. (Show a, Num a) => Tree a -> String The signature contexts in a mutually recursive group should all be identical When generalising the type(s) for prettyShow, simple Failed, modules loaded: none. But if I change the order of *Show* and *Num* in the signature of * prettyShow* it works. It's a GHC problem? it's normal than signature is order-dependent? I use *GHC 6.10.3* Thanks, Luis Cabellos -- LC, ("There is no Dana, only Zuul." - Cazafantasmas [1984]) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20100114/3d68a89f/attachment.html From martijn at van.steenbergen.nl Thu Jan 14 07:24:16 2010 From: martijn at van.steenbergen.nl (Martijn van Steenbergen) Date: Thu Jan 14 06:56:56 2010 Subject: [Haskell] Signature error because the order In-Reply-To: <3f3964001001140326v42881d8ao217bd9a900a728fc@mail.gmail.com> References: <3f3964001001140326v42881d8ao217bd9a900a728fc@mail.gmail.com> Message-ID: <4B4F0CF0.6000908@van.steenbergen.nl> Hi Luis, Luis Cabellos wrote: > But if I change the order of *Show* and *Num* in the signature of > /prettyShow/ it works. > > It's a GHC problem? it's normal than signature is order-dependent? I think this is on purpose. The error specifically says that the contexts must be identical (rather than containing the same classes in arbitrary). I suspect this is how Haskell98 has specified it. If you enable the RelaxedPolyRec language extension, this restriction no longer applies and your code compiles fine. Hope this helps, Martijn. From simonpj at microsoft.com Thu Jan 14 11:58:32 2010 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Thu Jan 14 11:32:47 2010 Subject: [Haskell] Signature error because the order In-Reply-To: <3f3964001001140326v42881d8ao217bd9a900a728fc@mail.gmail.com> References: <3f3964001001140326v42881d8ao217bd9a900a728fc@mail.gmail.com> Message-ID: <59543203684B2244980D7E4057D5FBC10AFA27B6@DB3EX14MBXC306.europe.corp.microsoft.com> In Haskell, the context of all functions in a mutually recursive group must be identical. http://haskell.org/onlinereport/decls.html#generalization Simon From: haskell-bounces@haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of Luis Cabellos Sent: 14 January 2010 11:26 To: haskell@haskell.org Subject: [Haskell] Signature error because the order Hi, I found than this piece of code causes an error in GHC ( http://haskell.pastebin.com/m5e3f4a4c ): data Tree a = Leaf a | Node (Tree a) (Tree a) --prettyShow :: (Show a, Num a) => Tree a -> String -- WORKS prettyShow :: (Num a, Show a) => Tree a -> String -- FAILS prettyShow (Leaf a) = show a prettyShow (Node a b) = (simple a) ++ (simple b) simple :: (Show a, Num a) => Tree a -> String simple (Leaf x) = prettyShow (Leaf x) simple x = "(" ++ prettyShow x ++ ")" With the error: test.lhs:14:0: Couldn't match expected type `Show a' against inferred type `Num a1' When matching the contexts of the signatures for prettyShow :: forall a. (Num a, Show a) => Tree a -> String simple :: forall a. (Show a, Num a) => Tree a -> String The signature contexts in a mutually recursive group should all be identical When generalising the type(s) for prettyShow, simple Failed, modules loaded: none. But if I change the order of Show and Num in the signature of prettyShow it works. It's a GHC problem? it's normal than signature is order-dependent? I use GHC 6.10.3 Thanks, Luis Cabellos -- LC, ("There is no Dana, only Zuul." - Cazafantasmas [1984]) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20100114/06988206/attachment-0001.html From j.russell at alum.mit.edu Thu Jan 14 16:02:44 2010 From: j.russell at alum.mit.edu (James Russell) Date: Thu Jan 14 15:35:33 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography Message-ID: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> I am pleased to announce the Functional Programming Bibliography at http://www.catamorphism.net/ The functional programming bibliography was created in the hope that it will be a useful resource to the functional programming community. The site is still in an early stage of development, and is pretty raw, and incomplete in a number of ways. Keyword categorization, in particular, is still fairly spotty. It currently contains in excess of 1500 references, heavily slanted toward Haskell-related topics, and contains links to publicly available versions of many papers, as well as links to gated versions of some papers. I am eager for suggestions as to how the site could be made more useful. Regards, James Russell From niklas.broberg at gmail.com Thu Jan 14 18:00:12 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Thu Jan 14 17:32:42 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> Message-ID: > I am pleased to announce the Functional Programming Bibliography > at http://www.catamorphism.net/ Awesome indeed! > I am eager for suggestions as to how the site could be made more > useful. Allow (registered?) users to submit links to papers that are missing? /Niklas From sebf at informatik.uni-kiel.de Thu Jan 14 18:51:30 2010 From: sebf at informatik.uni-kiel.de (Sebastian Fischer) Date: Thu Jan 14 18:24:00 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> Message-ID: On Jan 15, 2010, at 12:00 AM, Niklas Broberg wrote: >> I am eager for suggestions as to how the site could be made more >> useful. > > Allow (registered?) users to submit links to papers that are missing? +1 -- Underestimating the novelty of the future is a time-honored tradition. (D.G.) From j.russell at alum.mit.edu Thu Jan 14 22:46:29 2010 From: j.russell at alum.mit.edu (James Russell) Date: Thu Jan 14 22:19:17 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> Message-ID: <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> On Thu, Jan 14, 2010 at 6:00 PM, Niklas Broberg wrote: >> I am pleased to announce the Functional Programming Bibliography >> at http://www.catamorphism.net/ > > Awesome indeed! > >> I am eager for suggestions as to how the site could be made more >> useful. > > Allow (registered?) users to submit links to papers that are missing? > Yeah, I've certainly been thinking about that. First, I will somehow have to overcome being a complete control freak. The very first thought that crosses my mind is "how will I ensure that author names are well normalized?" Sad, isn't it? > /Niklas > From ml at isaac.cedarswampstudios.org Thu Jan 14 23:05:22 2010 From: ml at isaac.cedarswampstudios.org (Isaac Dupree) Date: Thu Jan 14 22:38:02 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> Message-ID: <4B4FE982.7040902@isaac.cedarswampstudios.org> James Russell wrote: > On Thu, Jan 14, 2010 at 6:00 PM, Niklas Broberg > wrote: >>> I am pleased to announce the Functional Programming Bibliography >>> at http://www.catamorphism.net/ >> Awesome indeed! >> >>> I am eager for suggestions as to how the site could be made more >>> useful. >> Allow (registered?) users to submit links to papers that are missing? >> > > Yeah, I've certainly been thinking about that. > First, I will somehow have to overcome being a complete control freak. > > The very first thought that crosses my mind is > "how will I ensure that author names are well normalized?" well, if you have boundless time and energy, you could just allow people to submit the links to you and then you normalize and post them! (Is it essential that they *are* normalized? Also, by the way, your website says the data is (semi)freely copyable, under CC BY-NC-SA, but I didn't notice any way to access the database data directly (although searching with no constraints, it seems, shows everything in a rendered format) Is there related bibliographic-website work on the Web? Somehow my intuition suggests that it ought to be a fairly easy solved problem that's not helped by a software/database being specific to (in this case) functional programming topics (a slightly fuzzy category); although perhaps the small-ness and fun-ness are nice, warm, fuzzy things in themselves. :-) -Isaac From jv at informatik.uni-bonn.de Fri Jan 15 00:10:02 2010 From: jv at informatik.uni-bonn.de (=?UTF-8?B?SmFuaXMgVm9pZ3Rsw6RuZGVy?=) Date: Thu Jan 14 23:42:31 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> Message-ID: <4B4FF8AA.2060209@informatik.uni-bonn.de> James Russell schrieb: > On Thu, Jan 14, 2010 at 6:00 PM, Niklas Broberg > wrote: >>> I am pleased to announce the Functional Programming Bibliography >>> at http://www.catamorphism.net/ >> Awesome indeed! >> >>> I am eager for suggestions as to how the site could be made more >>> useful. >> Allow (registered?) users to submit links to papers that are missing? >> > > Yeah, I've certainly been thinking about that. > First, I will somehow have to overcome being a complete control freak. > > The very first thought that crosses my mind is > "how will I ensure that author names are well normalized?" You may want to have a look at the "Identify publications" feature of http://researchr.org/ (and at research.org in general, which might also be of interest to other Haskellers in academia at least). Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de From jv at informatik.uni-bonn.de Fri Jan 15 00:17:00 2010 From: jv at informatik.uni-bonn.de (=?UTF-8?B?SmFuaXMgVm9pZ3Rsw6RuZGVy?=) Date: Thu Jan 14 23:49:27 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <4B4FE982.7040902@isaac.cedarswampstudios.org> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> <4B4FE982.7040902@isaac.cedarswampstudios.org> Message-ID: <4B4FFA4C.8080602@informatik.uni-bonn.de> Isaac Dupree schrieb: > (Is it essential that they *are* normalized? Also, by the way, your Yes. Take a German name (like mine), or a Spanish one, or ..., and you get problems with identifying. For example, ACMs Digital Library is not good at that. > Is there related bibliographic-website work on the Web? Somehow my As I just mentioned, http://researchr.org/. (Which, by the way, comes from Eelco Visser, a long time Haskell friend, and is based on the Stratego/XT work than many here will have heard of or seen.) Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de From Alistair.Bayley at invesco.com Fri Jan 15 03:34:51 2010 From: Alistair.Bayley at invesco.com (Bayley, Alistair) Date: Fri Jan 15 03:07:20 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> Message-ID: <125EACD0CAE4D24ABDB4D148C4593DA911026669@GBLONXMB02.corp.amvescap.net> > From: haskell-bounces@haskell.org > [mailto:haskell-bounces@haskell.org] On Behalf Of James Russell > > I am pleased to announce the Functional Programming Bibliography > at http://www.catamorphism.net/ > > The functional programming bibliography was created in the hope > that it will be a useful resource to the functional programming > community. The site is still in an early stage of development, > and is pretty raw, and incomplete in a number of ways. Keyword > categorization, in particular, is still fairly spotty. > > It currently contains in excess of 1500 references, heavily > slanted toward Haskell-related topics, and contains links to > publicly available versions of many papers, as well as links to > gated versions of some papers. How does this compare with readscheme? http://readscheme.org/ There was a Haskell subcategory as http://haskell.readscheme.org/ , but that link seems to be dead now. Alistair ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. ***************************************************************** From sebf at informatik.uni-kiel.de Fri Jan 15 05:06:12 2010 From: sebf at informatik.uni-kiel.de (Sebastian Fischer) Date: Fri Jan 15 04:38:41 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> Message-ID: On Jan 15, 2010, at 4:46 AM, James Russell wrote: > The very first thought that crosses my mind is > "how will I ensure that author names are well normalized?" Allow (registered) users to modify (or to correct) entries. On submission of a new entry, search for similar authors that are already stored and ask "Do you mean ...". -- Underestimating the novelty of the future is a time-honored tradition. (D.G.) From nr at cs.tufts.edu Fri Jan 15 14:23:31 2010 From: nr at cs.tufts.edu (Norman Ramsey) Date: Fri Jan 15 13:56:03 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> (sfid-H-20100114-224707-+34.32-1@multi.osbf.lua) References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> (sfid-H-20100114-224707-+34.32-1@multi.osbf.lua) Message-ID: <20100115192332.B823F6018BA1C@labrador.cs.tufts.edu> > > Allow (registered?) users to submit links to papers that are missing? > > Yeah, I've certainly been thinking about that. > First, I will somehow have to overcome being a complete control freak. > > The very first thought that crosses my mind is > "how will I ensure that author names are well normalized?" > > Sad, isn't it? Not at all. It takes a compulsive control freak to assemble a good bibliography. Besides, I *want* the names to be well normalized. (If you'd seen the BibTeX entries that I get from my coauthors, you would know why...) NR From niklas.broberg at gmail.com Fri Jan 15 14:49:04 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Fri Jan 15 14:21:32 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <20100115192332.B823F6018BA1C@labrador.cs.tufts.edu> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> <20100115192332.B823F6018BA1C@labrador.cs.tufts.edu> Message-ID: > ?> > Allow (registered?) users to submit links to papers that are missing? > ?> > ?> Yeah, I've certainly been thinking about that. > ?> First, I will somehow have to overcome being a complete control freak. > ?> > ?> The very first thought that crosses my mind is > ?> "how will I ensure that author names are well normalized?" > ?> > ?> Sad, isn't it? > > Not at all. ?It takes a compulsive control freak to assemble a good > bibliography. ? Besides, I *want* the names to be well normalized. > (If you'd seen the BibTeX entries that I get from my coauthors, you > would know why...) +1 However, I still think you should let users submit links. There are really two different issues here, one is to suggest a completely new paper, another is to provide a link to an already listed paper where there's currently no link provided. A lot of the papers only have a DOI link currently. Submitting such links won't need any name normalization, as the paper is already listed. For papers not already in your database, maybe have a two-tier system where not-yet-checked entries are marked as such when they are shown? Providing bibtex entries would be nice as well. Cheers, /Niklas From niklas.broberg at gmail.com Fri Jan 15 14:57:55 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Fri Jan 15 14:30:25 2010 Subject: [Haskell] ANN: haskell-src-exts 1.7.0 Message-ID: Fellow Haskelleers, As I was asked to start spamming again, I'm hereby pleased to announce the release of haskell-src-exts-1.7.0! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts For users of hsx, this version works fine with hsx-0.6.1. Since I haven't sent out one of these announcements in a while, here's the complete CHANGELOG since the previous announcement: ** 1.7.x 1.6.1 --> 1.7.0 =============== * Operators defined on the form (a `op` b) c = ... could not be handled by the (annotated) AST, nor the parser. I had to change the definition of the AST node for InfixMatch to allow a list of right-hand subpatterns, i.e. InfixMatch l (Pat l) (Name l) (Pat l) ... has become InfixMatch l (Pat l) (Name l) [Pat l] ... I also had an epiphany and fixed the issue that would arise with exact printing of prefix definitions including parentheses (e.g. (foo x) y = ...), so that now works too! ** 1.6.x 1.6.0 --> 1.6.1 =============== * UnicodeSyntax now works not only for identifiers, but also for ->, <- and =>, as well as Arrows arrows and kind stars. (And before you send me bug reports for this one, do check that your version of readFile is Unicode aware, i.e. you use GHC 6.12 or the utf8-string version). 1.5.3 --> 1.6.0 =============== * (=~=) turns out to be too general at Functor (for intuitive and not technical reasons), so is specialised to Annotated to closer mirror the original intention. * applyFixities is hoisted to a monad, and now fails on ambiguous infix expressions. ** 1.5.x 1.5.2 --> 1.5.3 =============== * Several small bug fixes in the exact printer, and fail more gracefully if the number of srcInfoPoints doesn't match the needs of the node. 1.5.1 --> 1.5.2 =============== * Fix a bug in the exact printer that made it always print the first token at position (0,0). * In fixing the above, Annotated is now a superclass of ExactP. It was already a superclass in spirit, and nothing can break from this since ExactP is only exported abstractly. 1.5.0 --> 1.5.1 =============== * The pretty printer now introduces parentheses for non-atomic arguments to function application. Note that infix applications are left untouched, no parentheses will be inserted there, as it is assumed that fixities are already properly resolved. * Fix a bug in the pretty printer where view patterns and n+k patterns were not properly parenthesised. 1.4.0 --> 1.5.0 =============== * Add support for acting on LINE pragmas while parsing, i.e. updating the source position according to info given in LINE pragmas. This is done conditionally based on a new flag ignoreLinePragmas in the ParseMode, hence the need to increase the major version. ** 1.4.x 1.3.5 --> 1.4.0 =============== * The AST node for Proc in the simple AST is changed to include a SrcLoc argument, to make it consistent with similar nodes e.g. Lambda. This is specifically needed for transformation of patterns in HSX. ** 1.3.x 1.3.4 --> 1.3.5 =============== * Added an entry point in the parser for statements, and an instance Parseable Stmt to go with it. * Ensured that .Annotated exports all relevant parseXXX(WithYYY) functions. 1.3.3 --> 1.3.4 =============== * Operator fixities are now resolved in patterns. 1.3.2 --> 1.3.3 =============== * Fixes a bug where qualified keywords are rejected even if the extension that enables the keyword in question is not turned on. 1.3.0 --> 1.3.2 =============== (Let's forget 1.3.1 ever existed.) * Fix a bug where declarations of infix operators were not properly merged as FunBinds. From jim at sdf-eu.org Fri Jan 15 15:17:00 2010 From: jim at sdf-eu.org (Jim Burton) Date: Fri Jan 15 14:49:58 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> <20100115192332.B823F6018BA1C@labrador.cs.tufts.edu> Message-ID: <87d41bf7ib.wl%jim@sdf-eu.org> At Fri, 15 Jan 2010 20:49:04 +0100, Niklas Broberg wrote: > > > ?> > Allow (registered?) users to submit links to papers that are missing? > > ?> > > ?> Yeah, I've certainly been thinking about that. > > ?> First, I will somehow have to overcome being a complete control freak. > > ?> > > ?> The very first thought that crosses my mind is > > ?> "how will I ensure that author names are well normalized?" > > ?> > > ?> Sad, isn't it? > > > > Not at all. ?It takes a compulsive control freak to assemble a good > > bibliography. ? Besides, I *want* the names to be well normalized. > > (If you'd seen the BibTeX entries that I get from my coauthors, you > > would know why...) > > +1 > > However, I still think you should let users submit links. There are > really two different issues here, one is to suggest a completely new > paper, another is to provide a link to an already listed paper where > there's currently no link provided. A lot of the papers only have a > DOI link currently. Submitting such links won't need any name > normalization, as the paper is already listed. > > For papers not already in your database, maybe have a two-tier system > where not-yet-checked entries are marked as such when they are shown? > > Providing bibtex entries would be nice as well. > The more of these features are added, the closer it gets to duplicating citeulike.org IMO and you'd be better off making use of a citeulike group. I haven't used the groups feature much but there are several haskell/fp related groups on there , e.g. http://www.citeulike.org/group/4254 . I think there are also a great deal more papers etc on there than are represented in groups (e.g. there are more FP/Haskell papers in my own 'library' than in the group I linked to). Regards, Jim > Cheers, > > /Niklas > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell From bulat.ziganshin at gmail.com Fri Jan 15 15:44:31 2010 From: bulat.ziganshin at gmail.com (Bulat Ziganshin) Date: Fri Jan 15 15:19:43 2010 Subject: [Haskell] Re: [Haskell-cafe] ANN: haskell-src-exts 1.7.0 In-Reply-To: References: Message-ID: <824628553.20100115234431@gmail.com> Hello Niklas, Friday, January 15, 2010, 10:57:55 PM, you wrote: > * UnicodeSyntax now works not only for identifiers, but also for does this mean that unicode identifiers are allowed only when UnicodeSyntax enabled? ghc allows them anyway -- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com From jv at informatik.uni-bonn.de Fri Jan 15 15:49:51 2010 From: jv at informatik.uni-bonn.de (=?UTF-8?B?SmFuaXMgVm9pZ3Rsw6RuZGVy?=) Date: Fri Jan 15 15:22:18 2010 Subject: [Haskell] ANNOUNCE: Functional Programming Bibliography In-Reply-To: <87d41bf7ib.wl%jim@sdf-eu.org> References: <58925be01001141302k11bc4760wf4d26fdfd0cfa8f4@mail.gmail.com> <58925be01001141946k64de437tb3d87ba0076e58c9@mail.gmail.com> <20100115192332.B823F6018BA1C@labrador.cs.tufts.edu> <87d41bf7ib.wl%jim@sdf-eu.org> Message-ID: <4B50D4EF.2050903@informatik.uni-bonn.de> Jim Burton schrieb: > At Fri, 15 Jan 2010 20:49:04 +0100, > Niklas Broberg wrote: >>> > > Allow (registered?) users to submit links to papers that are missing? >>> > >>> > Yeah, I've certainly been thinking about that. >>> > First, I will somehow have to overcome being a complete control freak. >>> > >>> > The very first thought that crosses my mind is >>> > "how will I ensure that author names are well normalized?" >>> > >>> > Sad, isn't it? >>> >>> Not at all. It takes a compulsive control freak to assemble a good >>> bibliography. Besides, I *want* the names to be well normalized. >>> (If you'd seen the BibTeX entries that I get from my coauthors, you >>> would know why...) >> +1 >> >> However, I still think you should let users submit links. There are >> really two different issues here, one is to suggest a completely new >> paper, another is to provide a link to an already listed paper where >> there's currently no link provided. A lot of the papers only have a >> DOI link currently. Submitting such links won't need any name >> normalization, as the paper is already listed. >> >> For papers not already in your database, maybe have a two-tier system >> where not-yet-checked entries are marked as such when they are shown? >> >> Providing bibtex entries would be nice as well. >> > > The more of these features are added, the closer it gets to duplicating citeulike.org IMO and > you'd be better off making use of a citeulike group. I haven't used the groups feature much but > there are several haskell/fp related groups on there , e.g. http://www.citeulike.org/group/4254 > . I think there are also a great deal more papers etc on there than are represented in groups > (e.g. there are more FP/Haskell papers in my own 'library' than in the group I linked to). For the control freaks among us, I would (again) suggest to try research.org vs. citeulike. (I use both, naturally the latter only recently.) The "identify publications" feature addresses the problem with non-normalized names, and Eelco is very susceptible to feedback and feature requests. So there is a true chance for us control freaks to impact how things get implemented, and how the rules are set. This is not meant to discourage the new, FP specific bibliography of the original poster. I like it. It shows all my relevant papers, with a proper author name, despite the Umlaut I'm "burdened" with. :-) Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de From niklas.broberg at gmail.com Fri Jan 15 15:58:43 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Fri Jan 15 15:31:14 2010 Subject: [Haskell] Re: [Haskell-cafe] ANN: haskell-src-exts 1.7.0 In-Reply-To: <824628553.20100115234431@gmail.com> References: <824628553.20100115234431@gmail.com> Message-ID: >> * UnicodeSyntax now works not only for identifiers, but also for > > does this mean that unicode identifiers are allowed only when > UnicodeSyntax enabled? ghc allows them anyway Well spotted, that was poorly worded of me. haskell-src-exts works like GHC, allowing Unicode identifier always and Unicode keywords/keysymbols when UnicodeSyntax is enabled. Cheers, /Niklas From niklas.broberg at gmail.com Fri Jan 15 18:13:51 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Fri Jan 15 17:46:22 2010 Subject: [Haskell] Re: ANN: haskell-src-exts 1.7.0 In-Reply-To: References: Message-ID: > * UnicodeSyntax now works not only for identifiers, but also for > ?->, <- and =>, as well as Arrows arrows and kind stars. (And > ?before you send me bug reports for this one, do check that your > ?version of readFile is Unicode aware, i.e. you use GHC 6.12 > ?or the utf8-string version). ... and with the newly released 1.7.1, UnicodeSyntax now also enables the fancy ? to mean forall. Cheers, /Niklas From Jeremy.Gibbons at comlab.ox.ac.uk Sat Jan 16 12:21:48 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Sat Jan 16 11:54:16 2010 Subject: [Haskell] Spring School in Generic and Indexed Programming Message-ID: <201001161721.o0GHLmHf024227@merc3.comlab.ox.ac.uk> SPRING SCHOOL ON GENERIC AND INDEXED PROGRAMMING Wadham College, Oxford, 22nd to 26th March 2010 TOPIC "Generic programming" is about making programs more widely applicable via exotic kinds of parametrization - not just along the dimensions of values or of types, but of things such as the shape of data, algebraic structures, strategies, computational paradigms, and so on. "Indexed programming" is a lightweight form of dependently typed programming, constraining flexibility by allowing one to state and check relationships between parameters: that the shapes of two arguments agree, that an encoded value matches to some type, that values transmitted along a channel conforms to some protocol, and so on. The two forces of genericity and indexing balance each other nicely, simultaneously promoting and controlling generality. The EPSRC-funded Generic and Indexed Programming project at Oxford has been exploring their interaction over the period 2006 - 2010; this school is the closing activity of the project. LECTURERS Six lecturers from the Programming Languages community, each an acknowledged expert in their specialism, will cover various aspects of generic and indexed programming. Each will give about four hours' lectures, distributed throughout the week. Nate Foster (Princeton University) "Bidirectional Programming" Ralf Hinze (University of Oxford) "Generic Programming with Adjunctions" Oleg Kiselyov (Fleet Numerical Meteorology and Oceanography Center) "Typed Tagless Interpreters" Simon Peyton Jones (Microsoft Research Cambridge) "Type Functions" Jeremy Siek (University of Colorado at Boulder) "Concepts in C++" Stephanie Weirich (University of Pennsylvania) "Generic Programming with Dependent Types" PREREQUISITES The school is aimed at doctoral students in programming languages and related areas; however, researchers and practitioners will be very welcome, as will strong masters students with the support of a supervisor. It will be assumed that participants have a good understanding of typed functional programming, as in Haskell or O'Caml. DATES Registration deadline: 19th February School: 22nd March (0900) to 26th March (lunchtime) VENUE Lectures will be held and accommodation provided in Wadham College in the centre of Oxford. The college celebrates its 400th anniversary in 2010; notable past members include Sir Christopher Wren, the founder of the Royal Society, and notable present ones Marcus du Sautoy, the mathematician and TV presenter. COSTS Costs will be kept low, thanks to support from EPSRC. There will be a nominal registration fee, and B&B accommodation in college will be about £55 per night. (Precise costs are yet to be determined.) FURTHER INFORMATION Further information, including instructions on how to register, will be available soon at the website: http://www.comlab.ox.ac.uk/projects/gip/school.html From uzytkownik2 at gmail.com Sat Jan 16 21:04:13 2010 From: uzytkownik2 at gmail.com (Maciej Piechotka) Date: Sat Jan 16 20:36:39 2010 Subject: [Haskell] ANNOUNCE: nntp 0.0.3 Message-ID: <1263693853.5616.15.camel@picard> Rather a 'bug-fix' release. Intended to add additional symbols to group names. I'd like to add support for explicit fetching some headers only and giving the message a more MIME-like behaviour but I'm afraid there is nowhere written how XHDR/HDR would behave with multiline headers nor I found a suitable package (mime[1] seems to not include even parsing the headers only and mime-string[2] does not take into account comments which may or may not be a problem with Message-ID comparaison). Regards [1] http://hackage.haskell.org/package/mime [2] http://hackage.haskell.org/package/mime-string -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 198 bytes Desc: This is a digitally signed message part Url : http://www.haskell.org/pipermail/haskell/attachments/20100116/8dfe4374/attachment.bin From jfredett at gmail.com Sun Jan 17 06:16:14 2010 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sun Jan 17 05:48:36 2010 Subject: [Haskell] Haskell Weekly News: Issue 146 - January 17, 2010 Message-ID: <4b52f17e.9453f10a.31e3.00a9@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100117 Issue 146 - January 17, 2010 --------------------------------------------------------------------------- Welcome to issue 146 of HWN, a newsletter covering developments in the [1]Haskell community. This has been a pretty light week in terms of discussion and announcments, but even in this comparative news lull we have the release of several new versions of packages. Inlcluding the start of a new IDE, some new job and graduate program openings, and some really excellent blog noise. Until next week, Haskellers, your Haskell Weekly News. Announcements haskell-src-exts 1.7.0. Niklas Broberg [2]announced a new release of haskell-src-exts Lite Haskell IDE. Mambo Banda [3]announced a new Haskell IDE, as part of his effort to learn Haskell. Functional Programming Bibliography. James Russell [4]announced the Functional Programming Bibliography, a new resource for the FP community. It, though in it's early stages, contains oer 1500 references (most of which are Haskell-related) to resources within the Functional Programming World. hakyll-1.0. Jasper Van der Jeugt [5]announced the release of version 1.0 of his static site generation tool, hakyll. From all (one) of us at the HWN, contragulations on the big 1.0! afv-0.0.0. Tom Hawkins [6]announced the initial release of 'Atom's Formal Verifier', a tool for verifying C code generated by Atom chp-2.0.0, chp-plus-1.0.0. Neil Brown [7]announced released new versions of his Comminicating Haskell Processes (CHP) packages. CHP is a message-passing concurrency library for Haskell. The major change in this version is a split of CHP into two packages, one containing core functionality, and one containing additional capabilities. Update for type-level library (0.2.4). Seyed Hosein Attarzadeh Niaki [8]announced a new version of his type-level library for type-level programming. This is a minor update to fix compatibility issues with dependencies. Two PhD positions in theoretical computer science. Alexandra Silva [9]announced vacancies for PhD positions in theoretical computer science at Leiden University. HaXml-1.20.1. Malcolm Wallace [10]announced a new, stable release of HaXml AST 2010 reminder--call for papers and presentations. John Hughes [11]reminded us of the AST 2010 call for papers and presentations. The submission deadline is only one week away. Job at Mylife. Julien Verlaguet [12]announced an availabiity for an OCaml developer at MyLife. Open Position (PhD student or Postdoc), U Tubingen, Germany. Torsten Grust [13]announced an open PhD/Postdoc position at the University of Tubingen in Germany. (ED: Apologies for the improper 'u' -- it should have an umlaut, but the compilation software is not cooperating) Palindromes 0.2. Johan Jeuring [14]announced a new release of the Palindromes package, including many new features and upgrades. Discussion From records to a type class. Taru Karttunen [15]asked about turning records into type classes, in an effort to make his bindings for Fuse more elegant. AlternativePrelude extension. Sjur Gjostein Karevoll [16]suggested a language pragma for alternative preludes. (ED: Again, apologies for the look-alike, but improper character). Blog noise [17]Haskell news from the [18]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Holumbus: [19]Linking Hayoo! Search Results. * Jeff Heard: [20]SPDE, Semi-functional programming for Processing. * Neil Mitchell: [21]Using .ghci files to run projects. * Neil Mitchell: [22]Better .ghci files. * Neil Brown: [23]Darcs. * Neil Brown: [24]Splitting CHP. * Darcs: [25]darcs weekly news #50. * Bryan O'Sullivan: [26]Progress on GHC's I/O manager. * Michael Snoyman: [27]New blog address. * Conal Elliot: [28]Exact Numeric Integration. I had missed this one last week (amidst the myriad, I failed to see it), so it is presented in this week's edition. Quotes of the Week * Jafet: closures are a poor man's object objects are a poor man's closure objects are a rich man's structs Poor programmers should start unions * monochrom: Time flies like an Arrow. Space leaks like a Monad. * monochrom: Haskell already has natural language support. Just switch your natural language to simple-typed lambda calculus. * edwardk: @remember Baugn @remember lambdabot fasta says: I think the @remember command is way overused. * Berengal: data Neither a b = Left | Right * Cale: Removing monad comprehensions was actually the snowball which caused the avalanche of fail in Haskell 98 About the Haskell Weekly News New editions are posted to [29]the Haskell mailing list as well as to [30]the Haskell Sequence and [31]Planet Haskell. [32]RSS is also available, and headlines appear on [33]haskell.org. To help create new editions of this newsletter, please see the information on [34]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [35]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69197 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69176 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69153 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69106 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68995 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68943 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68940 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17727 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17725 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17724 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17723 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17722 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17721 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69207 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69194 17. http://planet.haskell.org/ 18. http://haskell.org/haskellwiki/Blog_articles 19. http://holumbus.fh-wedel.de/blog/?p=30 20. http://vis.renci.org/jeff/2010/01/15/spde-semi-functional-programming-for-processing/ 21. http://neilmitchell.blogspot.com/2010/01/using-ghci-files-to-run-projects.html 22. http://neilmitchell.blogspot.com/2010/01/better-ghci-files.html 23. http://chplib.wordpress.com/2010/01/14/darcs/ 24. http://chplib.wordpress.com/2010/01/11/splitting-chp/ 25. http://blog.darcs.net/2010/01/darcs-weekly-news-50.html 26. http://www.serpentine.com/blog/2010/01/11/progress-on-ghcs-io-manager/ 27. http://snoyberg.wordpress.com/2010/01/10/new-blog-address/ 28. http://conal.net/blog/posts/exact-numeric-integration/ 29. http://www.haskell.org/mailman/listinfo/haskell 30. http://sequence.complete.org/ 31. http://planet.haskell.org/ 32. http://sequence.complete.org/node/feed 33. http://haskell.org/ 34. http://haskell.org/haskellwiki/HWN 35. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2 From jv at informatik.uni-bonn.de Sun Jan 17 06:42:30 2010 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Sun Jan 17 06:14:55 2010 Subject: [Haskell] Presentation about ICFP'09 programming contest Message-ID: <4B52F7A6.1000806@informatik.uni-bonn.de> Hi Haskell folk, If you are in Madrid tomorrow (Monday), you will likely not want to miss the video presentation by Andy Gill and his group about the techniques behind their running the ICFP'09 programming contest: http://www.program-transformation.org/PEPM10/SpecialFeature The presentation is scheduled to start 17:15, in the PEPM workshop room. Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de From kutsia at risc.uni-linz.ac.at Tue Jan 19 06:51:42 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue Jan 19 06:24:05 2010 Subject: [Haskell] CfP: PPDP 2010 Message-ID: <4B559CCE.5000005@risc.uni-linz.ac.at> ====================================================================== Call for Papers PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: Program Design and Development * Declarative Aspects of Object-Oriented Programming * Concurrent Extensions to Declarative Languages * Declarative Mobile Computing * Integration of Paradigms * Proof Theoretic and Semantic Foundations * Type and Module Systems * Program Analysis and Verification * Program Transformation * Abstract Machines and Compilation * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: As in previous years, we are planning to include invited talks in the programme. Important Dates: # Submission: title and abstract: 15 March 2010 full paper: 21 March 2010 # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez@kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia@risc.uni-linz.ac.at From johan.tibell at gmail.com Tue Jan 19 07:13:28 2010 From: johan.tibell at gmail.com (Johan Tibell) Date: Tue Jan 19 06:46:08 2010 Subject: [Haskell] ZuriHac registration deadline on February 14, 2010 Message-ID: <90889fe71001190413n12ff6639ufecf820e16879eb0@mail.gmail.com> Hi all, Due to budget and security constraints, we need to know the final number of attendees a bit in advance. We've therefore set a registration deadline on February 14, 2010. To register please follow the instructions on the registration page: http://www.haskell.org/haskellwiki/ZuriHac/Register Cheers, Johan & Christophe From igloo at earth.li Fri Jan 22 07:40:18 2010 From: igloo at earth.li (Ian Lynagh) Date: Fri Jan 22 07:12:25 2010 Subject: [Haskell] {darcs,hackage,cvs}.haskell.org, monk.galois.com Message-ID: <20100122124018.GA30737@matrix.chaos.earth.li> Hi all, As you may be aware, the server monk.galois.com has had hardware problems recently, and has now been replaced with a new server abbot.galois.com (thanks to the summer of code people for buying the replacement, to Galois for hosting it, and for Galois's sysadmin Paul for setting it up). The names darcs.haskell.org hackage.haskell.org cvs.haskell.org now point at abbot instead of monk. When SSHing to any of these names, you will be told that the SSH key has changed. The new key is 97:f2:f1:55:a8:2d:c0:13:28:df:03:95:f8:f2:f1:2d The major services should already have been moved to abbot. However, we are taking the opportunity to do some housekeeping, so haven't moved absolutely everything across. In particular, some things may be better hosted on http://community.haskell.org/ but have been on darcs.haskell.org for historical reasons. monk will be taken offline in a month's time, so before then can you please: If you have an account on monk.galois.com, log in and copy anything you wish to keep from your home directory. If you need an account on abbot and don't already have one, e-mail me saying what you need it for. If you are responsible for anything in http://old-darcs.well-typed.com/ then: If you think it should stay on darcs.haskell.org, e-mail me saying why. Otherwise, please take a copy of it (you can also access it by SSHing to monk.galois.com and changing to the /home/darcs directory) and let me know so that I can mark it as dealt with. If you see any other problems with the new server, or anything else missing from it, let me know. Thanks Ian From v.dijk.bas at gmail.com Sat Jan 23 10:02:37 2010 From: v.dijk.bas at gmail.com (Bas van Dijk) Date: Sat Jan 23 09:35:07 2010 Subject: [Haskell] ANNOUNCE: Updates and a new member of the Monadic Regions family Message-ID: Hello, I released updates of all the members of the Monadic Regions family: * http://hackage.haskell.org/package/regions-0.3 - Export the 'Dup' and 'ParentOf' classes from 'Control.Monad.Trans.Region'. - Add: 'mapInternalHandle ? (Handle resource1 ? Handle resource2) ? (RegionalHandle resource1 r ? RegionalHandle resource2 r)'. - Internal refactoring. * http://hackage.haskell.org/package/regions-monadsfd-0.3 * http://hackage.haskell.org/package/regions-monadstf-0.3 * http://hackage.haskell.org/package/usb-safe-0.5.1 - No major changes in these packages just internal refactoring and support for regions-0.3.*. * http://hackage.haskell.org/package/safer-file-handles-0.3 - 'File' is turned into a GADT, it's parameterized with the IOMode and its constructors are exported. - Added support for bytestring IO. - Internal refactoring. * http://hackage.haskell.org/package/explicit-iomodes-0.2 This package is not a member of the family but it is required for 'safer-file-handles'. I released an update which: - Added support for bytestring IO. - Internal refactoring. Additionally I would like to announce a new member of the family: * http://hackage.haskell.org/package/regional-pointers-0.1 to quote the description: "The library allows you to allocate memory in a region yielding a regional pointer to it. When the region terminates all pointers are automatically freed. Most importantly, a pointer can't be returned from the region. So it's impossible to reference unallocated memory." This package need some more work (primarily documentation and testing) so I consider it a beta release. Note that the darcs repositories for all packages are not updated because I can't seem to get a SSH connection with code.haskell.org :-( Happy Haskell Hacking, Bas From greg at bronevetsky.com Sun Jan 24 01:39:54 2010 From: greg at bronevetsky.com (Greg Bronevetsky) Date: Sun Jan 24 01:12:18 2010 Subject: [Haskell] Workshop on Advances in Message Passing (AMP) - Submission Deadline March 20, 2010 Message-ID: <4B5BEB3A.6000303@bronevetsky.com> -------------------------------------------------------------------------------- Workshop on Advances in Message Passing (AMP) Languages, Compilers, and Run-time Support at the SIGPLAN 2010 Conference on Programming Language Design and Implementation June 6, 2010 Toronto, Canada CALL FOR PAPERS Submission: March 20, 2010 Notification: April 25, 2010 Final paper: May 16, 2010 http://www.cs.rochester.edu/u/cding/amp -------------------------------------------------------------------------------- As feature sizes in electronics grow smaller, physical issues such as bounds on the speed of light, pin counts and 2-dimensional network layouts threaten to constrain improvements in communication bandwidth and latency even as increasing core counts improve compute performance. The resulting limitations force application and system developers to explicitly optimize communication locality and timing sensitivity by using explicit communication primitives such as point-to-point sends/receives, puts/gets and collective operations such as broadcast. Today message passing is supported by a wide variety of APIs, including run-time libraries such as MPI, network interfaces such as TCP/IP and Internet protocols such as HTTP. However, relatively little attention has been paid to the connection between message-passing runtimes and programming languages and compilers. Programming a message-passing system involves the fundamental tasks of computation partitioning, data partitioning, and data communication. It poses a distinct set of challenges in the analysis, transformation, and support of such programs. Significant advances have been made in the areas programming languages, compiler support, and run-time systems for message passing programs. Such progress can be accelerated by integrating and sharing ideas, results, and tools, enabling new parallel programming techniques and improving the performance and maintainability of scientific applications as well as collaboration software. The AMP workshop brings together researchers in academia, industry and government research institutes to discuss the shared challenges and present state-of-art research results. It aims to become a focused forum on subjects in the interaction of programming language, program analysis, and run-time support of message passing systems. The topics of interest include but are not limited to o algorithms and applications o parallel languages and programmability studies o compiler and run-time techniques for improving locality, scalability, and reliability o performance, testing, and debugging tools o program analysis tools for message passing programs o programming constructs to improve the usability of message-passing AMP is soliciting both position papers (3 pages) and research papers (10 pages) that report previously unpublished work. Papers must be PDF files in ACM proceedings format, printable on US Letter and A4 paper (http://www.acm.org/sigs/sigplan/authorInformation.htm, 9 pt template). ORGANIZERS: Greg Bronevetsky, Lawrence Livermore National Laboratory greg@bronevetsky.com Chen Ding, University of Rochester cding@cs.rochester.edu Sven-Bodo Scholz, University of Hertfordshire S.Scholz@herts.ac.uk Michelle Strout, Colorado State University mstrout@cs.colstate.edu From jfredett at gmail.com Sun Jan 24 15:29:51 2010 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sun Jan 24 15:01:54 2010 Subject: [Haskell] Haskell Weekly News: Issue 147 - January 24, 2010 Message-ID: <4b5cadbf.9753f10a.3413.5835@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100124 Issue 147 - January 24, 2010 --------------------------------------------------------------------------- Welcome to issue 147 of HWN, a newsletter covering developments in the [1]Haskell community. This week on the HWN, we have a new blogger in town, Bartek, over at 'The Power of Types Compels You', wrote an excellent article which is highlighted in the blogs section. Many new packages this week as well, and some interesting discussions about performance and existential types. So, Haskellers, till next week, your Haskell Weekly News! Announcements ForSyDe DSL v3.1. Seyed Hosein Attarzadeh Niaki [2]announced a new version of the ForSyDe DSL. This version provides more freedom in the declaration of process functions, as well as compatibility with base 4. parameterized-data library v0.1.4. Seyed Hosein Attarzadeh Niaki [3]announced a new version of the parameterized-data library. The parameterized-data library provides fixed-sized vectors, this update is provide minor compatibility fixes. Updates and a new member of the Monadic Regions family. Bas van Dijk [4]announced several new updates and a new member of the Monadic Regions family. bindings-DSL 1.0.4 (Category: FFI). Mauricio CA [5]announced a new version of his package bindings-DSL. Haskell XML Toolbox Version 8.5.0. Uwe Schmidt [6]announced a new version of the Haskell XML Toolbox (HXT). The main change in this version is the separation of the XPath and XSLT modules. Cardinality-0.1. Andrey Sisoyev [7]announced the release of his package Cardinality, a package for transforming between container types safely. afv-0.0.3. Tom Hawkins [8]announced a new release of AFV, an infinite state model checker for simple, iterative C programs. CfP: PPDP 2010. Temur Kutsia [9]announced a call for papers for the PPDP 2010 conference in July Mini-announce: A few package updates. Andrew Coppin [10]announced several new releases and updates to AC-EasyRaster-GTK, AC-Vector, and other packages. amqp-0.1. Holger Reinhardt [11]announced the release of his AMQP library. It currently only works with RabbitMQ and supports most of the 0-8 spec. An introduction to AMQP can be found [12]here. nntp 0.0.3. Maciej Piechotka [13]1f4e gmane.comp.lang.haskell.cafe/69228 announced a bugfix release to nntp. haskell-src-exts 1.7.0. Niklas Broberg [14]announced a new version of haskell-src-exts, featuring many new changes to the API. Discussion Existential Types (I guess). Ozgur Akgun [15]asked about a problem he encountered when trying to use Existential types. Is Haskell capable of matching C in string processing performance? John Millikin [16]asked a question about Haskell Performance... Quick! Someone get Don Stewart! Blog noise [17]Haskell news from the [18]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * ++Bartek Paczesiowa++: [19]Pure, extensible exceptions and self-returning functions. Bartek, over at 'The Power of Types Compels You', wrote a fantastic introduction to his forthcoming exceptions package. It's funny, and a great read about using type families (particularly, equality constraints) to create a pure exception handling mechanic. Definitely worth a visit. * Neil Mitchell: [20]Optimising HLint. * Kevin Reid (kpreid): [21]Darcs repositories back. * Darcs: [22]darcs weekly news #52. * Bryan O'Sullivan: [23]New GHC I/O manager, first sets of benchmark numbers. * Galois, Inc: [24]POPL 2010, Day 1. * Galois, Inc: [25]Tech Talk: A Scalable I/O Manager for GHC. * Galois, Inc: [26]PADL/PEPM 2010, Day 2. * Neil Brown: [27]The Process Composition Monad. * Galois, Inc: [28]PADL/PEPM 2010, Day 1. * Thomas M. DuBuisson: [29]GHC on ARM. * David Sankel: [30]Semantic Editor Combinators - one of my favorite blog posts. * David Sankel: [31]Best Haskell Papers of 2009. * Gtk2HS: [32]Compiling with ghc 6.12. * Arch Haskell News: [33]wxHaskell packaged for Arch. * Darcs: [34]darcs weekly news #51. * Don Stewart (dons): [35]Playing with the new Haskell epoll event library. * Dan Piponi (sigfpe): [36]Target Enumeration with the Euler Characteristic. Parts 1 & 2. Quotes of the Week * tensorpudding: the Plot monad allow you to keep the story pure by containing all the glaring time travel silliness * sproingie: quickcheck myLanguage.hs --> "Web browser created after 285,731 tests" * RossPaterson: I'm afraid you voided the warranty when you used UndecidableInstances. * aavogt: strong static typing is not a substitute for sleep * tensorpudding: fixity goes up to 11 * temoto: Backwards written in as Forth? * Paczesiowa: oh. can't argue with Cale :) * Axman6: and smilies make code run faster 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/69474 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69473 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69470 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69465 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69434 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69366 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69339 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17753 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69322 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69250 12. http://blogs.digitar.com/jjww/2009/01/rabbits-and-warrens/ 13. http://article.gmane.org/ 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69197 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69428 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69416 17. http://planet.haskell.org/ 18. http://haskell.org/haskellwiki/Blog_articles 19. http://paczesiowa.blogspot.com/2010/01/pure-extensible-exceptions-and-self.html 20. http://neilmitchell.blogspot.com/2010/01/optimising-hlint.html 21. http://kpreid.livejournal.com/21077.html 22. http://blog.darcs.net/2010/01/darcs-weekly-news-52.html 23. http://www.serpentine.com/blog/2010/01/22/new-ghc-io-manager-first-benchmark-numbers/ 24. http://www.galois.com/blog/2010/01/21/popl-2010-day-1/ 25. http://www.galois.com/blog/2010/01/20/tech-talk-a-scalable-io-manager-for-ghc/ 26. http://www.galois.com/blog/2010/01/20/padlpepm-2010-day-2/ 27. http://chplib.wordpress.com/2010/01/19/the-process-composition-monad/ 28. http://www.galois.com/blog/2010/01/19/padlpepm-2010-day-1/ 29. http://tommd.wordpress.com/2010/01/19/ghc-on-arm/ 30. http://netsuperbrain.com/blog/posts/semantic-editor-combiners/ 31. http://netsuperbrain.com/blog/posts/best-haskell-papers-of-2009/ 32. http://haskell.org/gtk2hs/archives/2010/01/18/compiling-with-ghc-612/ 33. http://archhaskell.wordpress.com/2010/01/18/wxhaskell-packaged-for-arch/ 34. http://blog.darcs.net/2010/01/darcs-weekly-news-51.html 35. http://donsbot.wordpress.com/2010/01/17/playing-with-the-new-haskell-epoll-event-library/ 36. http://blog.sigfpe.com/2010/01/target-enumeration-with-euler.html 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 vandijk.roel at gmail.com Mon Jan 25 18:06:05 2010 From: vandijk.roel at gmail.com (Roel van Dijk) Date: Mon Jan 25 17:38:21 2010 Subject: [Haskell] ANN: ftdi-0.1 Message-ID: Hello, I just released a very early version of my 'ftdi' library [1]. It is a small layer on top of the usb package [2] that enables you to communicate with FTDI [3] devices. Its design is based on the C-library libftdi [4], but it implemented completely in Haskell. Most functionality is untested. I only have access to an FT2232C chip, so testing other chips is not possible at the moment. Furthermore, the only thing I do with that chip is perform bulk reads and the occasional small (1 byte) bulk write. The good news is that it is quite good a bulk reads. It outperformed both libftdi-0.16 and the official driver [5] by about 40% for my use case. Although to be fair, both C libraries used the old libusb-0.1 library. This library is ultimately linked with libusb-1.0.* which is a complete rewrite. To play with the library either cabal install ftdi or darcs get http://code.haskell.org/~roelvandijk/code/ftdi Regards, Roel van Dijk 1 - http://hackage.haskell.org/package/ftdi 2 - http://ftdichip.com/ 3 - http://hackage.haskell.org/package/usb 4 - http://www.intra2net.com/en/developer/libftdi/ 5 - http://www.ftdichip.com/Drivers/D2XX.htm From byorgey at seas.upenn.edu Mon Jan 25 20:48:42 2010 From: byorgey at seas.upenn.edu (Brent Yorgey) Date: Mon Jan 25 20:20:56 2010 Subject: [Haskell] ANN: The Monad.Reader Issue 15 Message-ID: <20100126014842.GA13859@seas.upenn.edu> I am very pleased to announce that Issue 15 of The Monad.Reader is now available for your reading pleasure [1]. Issue 15 consists of the following four articles: * "The hp2any project" by Gergely Patai * "Adventures in Three Monads" by Edward Z. Yang * "The Operational Monad Tutorial" by Heinrich Apfelmus * "Implementing STM in pure Haskell" by Andrew Coppin Feel free to browse the source files. You can check out the entire repository using darcs: darcs get http://code.haskell.org/~byorgey/TMR/Issue15 If you'd like to write something for Issue 16, please get in touch. The deadline will likely be sometime in mid-late April; more details will be forthcoming. -Brent [1] http://themonadreader.files.wordpress.com/2010/01/issue15.pdf From matthias.goergens at googlemail.com Tue Jan 26 11:57:49 2010 From: matthias.goergens at googlemail.com (=?ISO-8859-1?Q?Matthias_G=F6rgens?=) Date: Tue Jan 26 11:30:04 2010 Subject: [Haskell] Job opportunities at Citrix Systems (Cambridge, UK) In-Reply-To: References: Message-ID: Hi folks, I just posted this job advert on the Haskell Cafe mailing list --- and someone suggested I crosspost here, too. ?Please pardon me if this double posting is too spammy. I have recently started working for Citrix in Cambridge. ?We are working on the open source software in Ocaml. ?Admittedly Ocaml is only a second best compared to Haskell ;o) and I hope my post does not count as too off-topic here. ?But Ocaml is still a decent language. My experience was primarily with Haskell and I only started working with Ocaml in earnest at Citrix. ?(So I hope that showing a way to transplant Haskell skills to the real world --- via the roundabout route of Ocaml --- justifies my posting.) So --- if you are looking for a job in Cambridge that involves functional programming, free software [1] and free beer [2], please feel free to drop me a line. ?I have included our original advert to the Ocaml mailing list for those who want more information first. Cheers, Matthias. [1] As in free speech. ?LGPL [2] As in free beer. ?We also get other perks, like snacks and a pool table. ---------- Forwarded message ---------- From: Dave Scott Date: 2010/1/18 Subject: [Caml-list] [jobs] Citrix Systems (Cambridge, UK) To: "caml-list@yquem.inria.fr" , "ocaml-jobs@inria.fr" Dear fellow OCaml users, Summary: We (Citrix Systems) are looking for OCaml programmers to join our team in Cambridge, UK. We use OCaml extensively in the "xapi tool-stack": the control-plane used in the Xen Cloud Platform[1] on which the widely used XenServer server virtualisation product[2] is based. XCP aims to provide a complete open-source cloud infrastructure platform with a powerful management stack based on standards-based APIs, support for multi-tenancy, SLA guarantees and detailed metrics for consumption based charging. We are looking to recruit top-class engineers to work on the tool-stack; applicants must have a good knowledge of data structures and algorithms, experience of programming in the context of large systems and general aesthetic good taste when it comes to code and architecture. Our code base is significant and varied: over 130,000 lines of OCaml, solving problems ranging from the low-level (Xen hypercalls) to the high-level (resource pool management), to the compiler-driven (generating language bindings for our Xen datamodel). Our ideal candidate will have: * significant experience of applications programming in high-level languages (such ?as OCaml :-) * an aptitude for implementing (and reasoning about) complex concurrent, ?distributed systems * the skills required to contribute to both the architectural design and ?day-to-day development of a large code-base * strong communication skills and problem solving ability * a determination to deliver great products that perform brilliantly and meet ?our customers' needs So if you want to tackle interesting and challenging programming problems and contribute to an innovative, fast-growing product that is already used by tens of thousands of customers across the world, please don't hesitate to send me your CV. [1] http://www.xen.org/products/cloudxen.html [2] http://www.citrix.com/English/ps2/products/feature.asp?contentID=1686939 Thanks, -- Dave Scott From jwlato at gmail.com Wed Jan 27 17:03:51 2010 From: jwlato at gmail.com (John Lato) Date: Wed Jan 27 16:35:44 2010 Subject: [Haskell] Announce: adaptive-tuple 0.1.0 Message-ID: <9979e72e1001271403h3b25552esf872d6bdcdcadc8d@mail.gmail.com> Hello, I am pleased to announce the initial release of adaptive-tuple, a library that aims to combine the variable-length convenience of lists with the smaller space requirements of tuples. ?Using the AdaptiveTuple class, computations can be constructed in a manner very similar to the ZipList Applicative instance. The final computation is passed to a reification function with an initial input to generate an output. adaptive-tuple is similar in conception to adaptive-containers. Where adaptive-containers uses specialized data types based upon the type of the elements, adaptive-tuple uses specialized containers based upon the number of elements. Using adaptive-tuple is similar to using a type-sized vector library such as parameterized-data, but with much lower runtime space requirements. Adaptive tuples are designed to be used when a very large number of small variable-sized containers are needed and using lists degrades performance. Available on hackage at http://hackage.haskell.org/package/adaptive-tuple. Comments, patches, and bug reports are welcome. In addition to Don Stewart, Alfonso Acosta, and others responsible for the type-level and adaptive-containers libraries, this package would not have been possible with Bulat Ziganshin's excellent Template Haskell tutorials. Cheers, John From niklas.broberg at gmail.com Sun Jan 31 08:36:31 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Sun Jan 31 08:08:14 2010 Subject: [Haskell] ANN: haskell-src-exts-1.8.0 Message-ID: Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.8.0! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts For users of hsx, the latest version 0.6.1 works unchanged with this release. 1.7.2 --> 1.8.0 =============== * Add an instance Show Fixity (derived). * Support for the new ANN and INLINE_CONLIKE pragmas. * Remove support for CFILES and INCLUDE pragmas. The support wasn't correct anyway, as it assumed the pragmas appeared at the top of files. As CFILES/INCLUDE pragmas can (and do) appear anywhere, there's no hope to support them in the AST. Better to remove the support altogether. Files with CFILES/INCLUDE pragmas can still be parsed of course, but those pragmas will be handled as comments. * Parsing with ignoreLinePragmas = False now correctly updates the file name. * Allow the whole SPECIALISE/INLINE family of pragmas in instance declarations. The InsInline constructor is removed, and is now represented by 'InsDecl (InlineSig ...)'. * Fix a bug with line numbering and quasi quotes, and a similar one with line numbering and CDATA. * Fix a few minor bugs in the exactPrinter. * Fix the strange handling of so called strings in LINE pragmas. Cheers, /Niklas From niklas.broberg at gmail.com Sun Jan 31 08:55:03 2010 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Sun Jan 31 08:26:43 2010 Subject: [Haskell] Re: ANN: haskell-src-exts-1.8.0 In-Reply-To: References: Message-ID: > 1.7.2 --> 1.8.0 > =============== ... and one more I forgot: Export 'knownExtensions' from .Extension. /Niklas From jfredett at gmail.com Sun Jan 31 15:17:00 2010 From: jfredett at gmail.com (jfredett@gmail.com) Date: Sun Jan 31 14:48:47 2010 Subject: [Haskell] Haskell Weekly News: Issue 148 - January 31, 2010 Message-ID: <4b65e53c.a015f10a.0d64.ffff920e@mx.google.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100131 Issue 148 - January 31, 2010 --------------------------------------------------------------------------- Welcome to issue 148 of HWN, a newsletter covering developments in the [1]Haskell community. Hello Haskellers, this week begins with a correction. Last week, I noted a blogpost from one 'Bartek Paczesiowa', I was rapidly informed of the complete wrongness of this citation. In fact, Bartek's last name is, and I hope the Unicode makes it through here, 'wikowsk,' and Paczesiowa is his nickname. Apologies to Bartek, as penance I've reread your [2]excellent post on your blog. That said, this week's HWN if packed full of awesome potential naming errors, so I'll let you get to it. Thus, Haskellers, Your Haskell Weekly News! Announcements haskell-src-exts-1.8.0. Niklas Broberg [3]announced a new release of haskell-src-exts. Elerea 1.2.3 with some enhancements. Patai Gergely [4]announced his addition of some new features to the experimental branch of his FRP library, Elerea. hakyll-1.3. Jasper Van der Jeugt [5]announced the release of hakyll 1.3, including several new improvments and changes. ThreadScope 0.1. Satnam Singh [6]announced the release of Threadscope 0.1, the premier graphical thread profiler. The Monad.Reader Issue 15. Brent Yorgey [7]announced the most recent issue of the Monad.Reader, a monthly publication of Haskell Related expostition and discusson articles. afv-0.1.0. Tom Hawkins [8]announced a afv-0.1.0, an infinite state model checker for verifying assertions about embedded C programs. adaptive-tuple 0.1.0. John Lato [9]announced the initial release of adaptive-tuple, his library for combining the space-efficient properties of tuples with the utility of lists. Job opportunities at Citrix Systems (Cambridge, UK). Matthias Goergens [10]announced a opportunity available at Citrix Systems in Cambridge, UK. Discussion OT: Literature on translation of lambda calculus to combinators. Dusan Kolar [11]asked about texts regarding translating the untyped lambda calculus to a combinator calculus such as SKI or BCKW. Linguistic hair-splitting. Andrew Coppin [12]asked an interesting offtopic linguistic question about what we call a number, a field, an element, and a monad. Adopting hpodder? John Goerzen [13]asked if there were any interested adoptive maintainers for his hpodder project. This is an excellent opportunity for a Haskell Neophyte to help the community and learn about project management hopefully we can find hpodder a new maintainer! Blog noise [14]Haskell news from the [15]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Holumbus: [16]HolHac at FH-Wedel. * ++Arch Haskell Team++: [17]Arch Linux updates to GHC 6.12. * Neil Brown: [18]Exploring a Communicating Sequential Processes EDSL. * The GHC Team: [19]Yielding more improvements in parallel performance. Quotes of the Week * Berengal: I'm going to write a module Hmm with a (.) operator in it, so I can go 'Hmm..' in my code * clarkb,: in CS they dont teach you to program...You learn Data Structures, Algorithms, Logic, Discrete Math, Language theory, etc and happen to pick up programming on the way * dons: hey i love core. i dream about unboxes * cale: Differential geometry is the study of manifolds under change of notation. * kmc: the irony being, the abstraction that gets the most complaining and general noise [from imperative programmers] is the one that captures imperative programming * kmc: i am Jack's monad operator * arw: ...and a basic law of haskell is, 50% of all documentation has to be monad tutorials :) * Cale: Here [#haskell], we feed trolls until they explode. * bartek: It took me 2 years of studying teachings of Oleg Kiselyov (who was raised among types, where he learned to speak their language), but finally, I have the solution. * kmc: I think 250 milliolegs is enough to kill an elephant olsner: ... to kill an elephant - in the type system! * syntaxglitch: every time I have a cool idea about something that might work in Haskell, I go check Oleg's stuff and find that 1) he already did it 2) thought it out better 3) did it incidentally while working on something way more interesting * DRMacIver:: I dread to think what category theory would look like after the software engineering world had got their grubby paws on it. Enterprise variant functors. Commutative UML diagrams. 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://paczesiowa.blogspot.com/2010/01/pure-extensible-exceptions-and-self.html 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69749 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69745 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69731 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69612 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69535 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/69517 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17764 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17763 11. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69643 12. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69620 13. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/69528 14. http://planet.haskell.org/ 15. http://haskell.org/haskellwiki/Blog_articles 16. http://holumbus.fh-wedel.de/blog/?p=32 17. http://archhaskell.wordpress.com/2010/01/31/arch-linux-updates-to-ghc-6-12/ 18. http://chplib.wordpress.com/2010/01/27/exploring-a-communicating-sequential-processes-edsl/ 19. http://ghcmutterings.wordpress.com/2010/01/25/yielding-more-improvements-in-parallel-performance/ 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 jfredett at gmail.com Sun Jan 31 15:20:13 2010 From: jfredett at gmail.com (Joe Fredette) Date: Sun Jan 31 14:51:54 2010 Subject: [Haskell] HWN Issue 148 -- unicode error Message-ID: Indeed, the Unicode only made it through my system, and not the mailer itself. In fact, the name should look something like "?wik?owski", and not the garbled mess that made it through. Apologies again, Bartek! /Joe