March 2013 - Haskell - Haskell.org

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

BayHac '13
by Mark Lentczner 04 May '13

04 May '13

Please join us for a weekend of Haskell hacking: *BayHac '13* *May 17th ~ 19th, 2013* *Hacker Dojo* *Mountain View, CA* Full details on the Haskell Wiki: BayHac '13<http://www.haskell.org/haskellwiki/BayHac2013> - Mark

1 1

Summer school on Applied Functional Programming at Utrecht University; deadline for registration May 15
by Doaitse Swierstra 02 May '13

02 May '13

Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous four occasions students were all very happy with the school and we plan to repeat this success this year. Among the intended audience are prospective master students who gained an interest in Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In previous years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/USCS/ -- on this page you can find the poster you can print and hang somewhere (why not your office door): Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra, Atze Dijkstra and Johan Jeuring

2 1

ANN: psqueue-benchmarks - benchmarks of priority queue implementations
by Niklas Hambüchen 07 Apr '13

07 Apr '13

(This is a slightly detailed email. If you are the maintainer of one of the packages benchmarked here, you might want to read it though.) Today I was looking for a Priority Queue that also allows a delete operation (some call this a "Priority Search Queue"). I found http://stackoverflow.com/questions/6976559/comparison-of-priority-queue-imp… and after looking at the 10 queue alternatives, I got to the following conclusions: * Only 3 of them allow to delete entries (are p*s*queues) * Most of them are outdated or at least unmaintained for the last 3-5 years * There was an effort to get a priority queue into containers (see the stackoverflow link), but it was not agreed on * Those efforts were driven by Louis Wasserman, who wrote one of the 3 psqueues (queuelike), but now only maintains a non-ps-queue (pqueue) that seems to be the most popular priority queue implementation PSQueue implementations ----------------------- The three packages that are psqueues are: - PSQueue (http://hackage.haskell.org/package/PSQueue-1.1) * original implementation from paper of Ralf Hinze * last upload 2008 * no test suite (but small commented out QC properties), no benchmarks * no code repository - fingertree-psqueue (http://hackage.haskell.org/package/fingertree-psqueue-0.3) * last upload 2011 * no tests, no benchmarks * no code repository - queuelike (http://hackage.haskell.org/package/queuelike-1.0.9) * last upload 2009 * no tests, no benchmarks * no code repository Benchmarks ---------- Unfortunately, none of them had tests, code in repositories or any indication about their real-world performance, so I made some criterion benchmarks. You can find them here: https://github.com/nh2/psqueue-benchmarks Graphs: http://htmlpreview.github.com/?https://raw.github.com/nh2/psqueue-benchmark… Benchmark results ----------------- * PSQueue throws a stack space overflow if you try to put in 100000 Ints * PSQueue suffers from some significant worst case in terms of queue creation, sometimes creating a queue from random numbers just takes 5 times longer (1st graph). This only happens sometimes (despite Criterion) * queuelike creation is instant - it seems to work around my benchmark somehow * converting a queuelike queue to a list surprisingly takes 10 times longer than with the other packages * in terms of average performance, the three are quite close to each other (apart from the point above). queuelike seems fastest, fingertree-psqueue is second and PSQueue slowest, with a difference of +30% to the next one My questions to the maintainers ------------------------------- @Scott: Do you have an idea why PSQueue stack overflows? @Louis: Why did you switch from queuelike to pqueue? Could you put the code up somewhere manageable (repo)? Is it possible to make pqueue a full pSqueue implementation? Niklas

2 4

[Haskell-cafe] Monad.Reader #22 call for copy
by Edward Z. Yang 29 Mar '13

29 Mar '13

Call for Copy: The Monad.Reader - Issue 22 -------------------------------------------- Another ICFP submission deadline has come and gone: why not celebrate by submitting something to The Monad.Reader? Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 22 will be: **Saturday, June 1** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki- page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (ezyang(a)mit.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll work something out.

1 0

Re: [Haskell] [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations
by Niklas Hambüchen 29 Mar '13

29 Mar '13

Hey Kazu, I added GHC's PSQ to the benchmark, the new figures are on http://htmlpreview.github.com/?https://raw.github.com/nh2/psqueue-benchmark… No, it does not stack overflow, and it seems to perform slightly better than the other implementations; it also doesn't suffer from the toList slowness problem as does listlike. However, it is probably not as generally usable as it hardcodes the priorities to be Doubles. (So far I only benchmark really trivial things and the other functions could be benchmarked as well.) Niklas On 29/03/13 06:16, Kazu Yamamoto (山本和彦) wrote: > Hi Niklas, > >> * PSQueue throws a stack space overflow if you try to put in 100000 >> * Ints > > A slightly different implementation is used in GHC: > > https://github.com/ghc/packages-base/blob/master/GHC/Event/PSQ.hs > > Could you test it? If this code also has the same problem, I need to > fix it. > > --Kazu >

1 0

Re: [Haskell] [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations
by Niklas Hambüchen 29 Mar '13

29 Mar '13

Hey Scott, I quickly tried your suggestion, plugging in foldr' from Data.Foldable and sprinkling a few seqs in some places, but it doesn't help the stack overflow. On Fri 29 Mar 2013 16:23:55 GMT, Scott Dillard wrote: > I do not know why it overflows. It's been a while, but isn't the > answer usually "too much laziness"? Maybe try changing the foldr in > fromList to foldr'? I would try it out quickly but do not have ghc > installed on any computers here. > > I am happy start a repo for this library, but there is not much > history to import so anyone else may do it. I'm not sure how hackage > upload permissions work... I guess I just change the maintainer field > in the .cabal file from myself to someone else...? Any volunteers? > > > > > On Thu, Mar 28, 2013 at 11:16 PM, Kazu Yamamoto <kazu(a)iij.ad.jp > <mailto:kazu@iij.ad.jp>> wrote: > > Hi Niklas, > > > * PSQueue throws a stack space overflow if you try to put in 100000 > > * Ints > > A slightly different implementation is used in GHC: > > > https://github.com/ghc/packages-base/blob/master/GHC/Event/PSQ.hs > > Could you test it? If this code also has the same problem, I need to > fix it. > > --Kazu > >

2 1

WRS 2013 - Call for Papers
by Jeroen Ketema 28 Mar '13

28 Mar '13

------------------------- WRS 2013: CALL FOR PAPERS ------------------------- 11th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2013) http://multicore.doc.ic.ac.uk/events/wrs2013/ 27 June 2013, Eindhoven, the Netherlands IMPORTANT DATES * Paper submission deadline: 24 April 2013 * Notification of acceptance: 22 May 2013 * Preliminary proceedings version due: 5 June 2013 * Workshop: 27 June 2013 * Paper submission for final proceedings: TBA * Notification of acceptance: TBA * Final version due: TBA AIMS AND SCOPE The WRS workshop promotes research and collaboration in the area of reduction strategies in rewriting and programming. It encourages the presentation of new directions, developments, and results as well as surveys and tutorials on existing knowledge in this area. Reduction strategies define which (sub)expression(s) should be selected for evaluation and which rule(s) should be applied. These choices affect fundamental properties of computations such as laziness, strictness, completeness, and efficiency, to name a few. For this reason programming languages such as Elan, Maude, OBJ, Stratego, and TOM allow the explicit definition of the evaluation strategy, whereas languages such as Clean, Curry, and Haskell allow its modification. In addition to strategies in rewriting and programming, WRS also covers the use of strategies and tactics in other areas such as theorem and termination proving. Previous editions of the workshop were held in Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), Seattle (2006), Paris (2007), Hagenberg (2008), Brasilia (2009), Edinburgh (2010), Novi Sad (2011), and Manchester (2012); the 2010 and 2012 editions were joint with the STRATEGIES workshop. Further information can be found at the permanent site for WRS (http://users.dsic.upv.es/~wrs/) WRS 2013 will be co-located with RTA 2013 (24th International Conference on Rewriting Techniques and Applications), as a satellite event of RDP, the Federated Conference on Rewriting, Deduction, and Programming. WRS 2013 will be held on 27 June in Eindhoven, the Netherlands. PAPER SUBMISSION AND PUBLICATION The submission process is in two stages. * Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style through the EasyChair submission site: https://www.easychair.org/conferences/?conf=wrs2013 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. * After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in an electronic journal, such as Electronic Proceedings in Theoretical Computer Science. Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. INVITED SPEAKER * Eelco Visser, Delft Univerity of Technology, the Netherlands PROGRAM COMMITTEE * Sandra Alves, University of Porto * Isabelle Gnaedig, LORIA and INRIA Nancy * Bernhard Gramlich, Technische Universität Wien * Jürgen Giesl, RWTH Aachen * Jeroen Ketema, Imperial College Londen (co-chair) * Dorel Lucanu, "Alexandru Ioan Cuza" University * Hans Zantema, Eindhoven University of Technology (co-chair)

1 0

ICSM 2013 - CFP for Research Track
by Natalia Dragan 28 Mar '13

28 Mar '13

============================================================================ ICSM 2013 CFP - Research Track ============================================================================ 29th IEEE International Conference on Software Maintenance 22 - 28 September 2013 - Eindhoven, The Netherlands http://icsm2013.tue.nl/ Follow us on Twitter: @IEEEICSM ============================================================================ The deadline for the Research track is approaching! Please read below and refer to the web page for further information. ================================ IMPORTANT DATES ================================ Abstract submission: April 17, 2013 Full papers submission: April 24, 2013 Notification: June 14, 2013 Camera-ready: July 13, 2013 ================================ CHAIRS ================================ General Chair: Alexander Serebrenik, Eindhoven University of Technology, The Netherlands Program Co-chairs: Tom Mens, University of Mons, Belgium and Yann-Gaël Guéhéneuc, École Polytechnique de Montréal, Canada ================================ TOPICS ================================ Topics of Interest include but not limited to: • Software repository analysis and mining • Run-time evolution, dynamic reconfiguration and self adaptation • Reverse engineering, re- engineering and migration • Software refactoring, restructuring and renovation • Software and system comprehension • Code cloning, code provenance, concept location and related research • Change and defect management • Evolution of non-code artefacts (e.g., requirements, design models, documentation, software architectures, business process models) • Maintenance-related testing (e.g., regression testing) • Maintenance and evolution processes • Software quality improvement • Software evolution for emerging paradigms • Human aspects of software evolution ================================ PAPER SUBMISSION ================================ Research papers must adhere to the IEEE CS Proceedings style guidelines and are limited to 10 pages. Further details are available at: http://icsm2013.tue.nl/CFP/index.html

1 0