- Haskell - Haskell.org

PhD studentship in Nottingham
by Graham Hutton 31 May '11

31 May '11

Dear all, I are currently advertising a PhD studentship in functional programming -- the advert is copied below, and attached. If you know of any good candidates who many be interested in this, or there is a local mailing list for advertising such things, I would be much obliged if you could pass on the advert. Best wishes, Graham +------------------------------------------------------------------+ PhD Studentship in Functional Programming School of Computer Science University of Nottingham, UK Applications are invited for a fully-funded PhD studentship in the Functional Programming Lab in the School of Computer Science at the University of Nottingham, starting on 1st October 2011, under the supervision of Prof Graham Hutton. The suggested topic for the studentship is to develop a practical implementation of the worker/wrapper transformation, a simple but powerful unifying paradigm for program optimisation, but other ideas for possible topics are welcome too. The studentship is for three and a half years, and includes a maintenance grant of 13,590 UK pounds per year, and tuition fees. Applicants for the position will require a first-class Honours degree (or equivalent) in Computer Science and/or Mathematics, some experience in functional programming, and an aptitude for mathematical subjects. Additional desirable attributes include a Masters degree, and/or some experience in programming language semantics, implementation and optimisation. Due to the nature of the funding, the position is only open to UK citizens, or EU citizens who have resided in the UK for the last three years. The successful applicant will work under the supervision of Prof Graham Hutton in the FP Lab in Nottingham, a leading centre for research on functional programming. The group currently comprises 5 academic staff, 1 research fellow, and 10 PhD students. In order to apply, please submit the following to Prof Graham Hutton (graham.hutton(a)nottingham.ac.uk) by 24th June 2011: an up-to-date copy of your CV (including the results of all your University examinations to date) along with a brief covering letter that describes your experience in functional programming, your reasons for wishing to pursue a PhD in this area, and any ideas you have regarding possible research directions. Closing date for applications: 24th June 2011. +------------------------------------------------------------------+ -- Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

DTP 2011: Second call for talks
by Wouter Swierstra 31 May '11

31 May '11

Dependently Typed Programming 2011 Call for Papers 27 of August 2011 Nijmegen, The Netherland In association with ITP 2011 Deadline for submission: 10 June 2011 http://www.cs.ru.nl/dtp11 Dependently typed programming is here today: where will it go tomorrow? On the one hand, dependent type theories have grown programming languages; on the other hand, the type systems of programming languages like Haskell (and even C#) are incorporating some kinds of type-level data. When types involve data, they can capture relationships between data, internalising invariants necessary for appropriate computation. When data describe types, we can express patterns of programming in code. We're beginning to see how to take advantage of the power and precision which dependent types afford, but there are still plenty of problems to address and issues to resolve. The design space is large: this workshop is a forum for researchers who are exploring it. We hope that the workshop will attract people who work on the design and implementation of dependently typed programming languages and development environments, or who are using existing systems to develop dependently typed programs and libraries. * Submissions * If you want to give a talk or a demo at the workshop, please send us a title and an abstract before 10 June 2011 to w.swierstra{at}cs.ru.nl. Slots will be of 30 minutes (unless you ask for less). We will try to fit as many talks as possible. We aim to publish post-proceedings containing refereed papers related to the topic of the workshop in a suitable journal. More information about this will come after the workshop. * Important Dates * 10 June 2011: Submission deadline 25 June 2011: Notification of acceptance 27 August 2011: DTP workshop * Program Committee * Ana Bove, Chalmers, Sweden Matthieu Sozeau, INRIA, France Wouter Swierstra, Radboud University, The Netherlands

1 0

Student Internships for Parallel Haskell Programming at NII, Tokyo
by Sebastian Fischer 31 May '11

31 May '11

As part of my research fellowship at the National Institute of Informatics in Tokyo, I announce the availability of student internships for up to three months between July and September 2011. Qualified applicants are enrolled in a Masters or Phd program, have a firm grasp of the Haskell programming language, and, ideally, know the different approaches to parallel and concurrent programming available in the Glorious Glasgow Haskell Compilation System (GHC). Their task is to support research on combinators for parallel programming by developing and comparing efficient implementations. The available fund covers sojourn costs but no travel expenses. It is meant to foster collaboration between Germany and Japan but qualified students from other countries may also be funded. If you want to spend the summer hacking Haskell in Tokyo please do not hesitate to contact me off list. Feel free to write even if you are unsure whether you are qualified or have any other questions regarding the internship. Best regards, Sebastian http://research.nii.ac.jp/members/fischer/ P.S. Information about the status after the earthquake is available on the Local Information page of ICFP'11: http://www.biglab.org/icfp11local/index.html Additionally, you may want to follow recent news in English by Mainichi Daily News and NHK World: http://mdn.mainichi.jp/ http://www3.nhk.or.jp/daily/english/

1 0

ANNOUNCE: time-recurrence-0.4.2
by Chris Heller 31 May '11

31 May '11

I've been busy making major changes to my time library: http://hackage.haskell.org/package/time-recurrence Things are still under heavy development. This release is to show the direction the library is heading in. A major shift in the design has been made, and the current work is an attempt at simplifying the recurring time manipulations into the smallest number of function possible, then providing some useful convenience methods on top of that. Version 0.4.2 definitely feels more Haskell-y. Here is a simple example of how things are done: > date = parse822Time "Tue, 02 Sep 1997 09:00:00 -0500" > take 5 $ repeatSchedule' dailyUTC{interval = toInterval 10, moment = date} > [1997-09-02 14:00:00 UTC > ,1997-09-12 14:00:00 UTC > ,1997-09-22 14:00:00 UTC > ,1997-10-02 14:00:00 UTC > ,1997-10-12 14:00:00 UTC] In addition a test suite has been added to the package, it currently is using HUnit test-framework, and the Cabal 1.10 stdio test suite facility. Feedback, suggestions and pull requests are always welcome. -Chris

1 0

ANNOUNCE: Clipboard-2.2.0. System clipboard interface.
by Daniel Díaz Casanueva 30 May '11

30 May '11

Hi all, I've just uploaded Clipboard-2.2.0 to Hackage [1]. Clipboard [2] is a library that provides an interface for the system clipboard. The API is very simple, so anyone can use it without knowing of low-level Win32 API. Currently, this library only works on a Windows OS, due to its dependency on the Win32 library. Features for 2.2.0 version: * Added compatibility with the unicode character set, while reading the content of the clipboard. * Unicode character set is the new standard for setting the clipboard content. * Fixed the function 'modifyClipboardString'. * Some changes in documentation. I want to give thanks to Artyom Kazak, who sent me the patch of Unicode compatibilty and the fix for 'modifyClipboardString' function. -- References [1] - Hackage site - http://hackage.haskell.org [2] - Clipboard site - http://sites.google.com/site/dheltadiaz/packages/clipboard

1 0

Position Available: Microsoft Research PhD Scholarship
by Serdar Tasiran 26 May '11

26 May '11

Microsoft Research PhD Scholarship on Concurrent Software Verification A PhD student position is available in the Department of Computer Engineering at Koc University, Istanbul, Turkey. The student will carry out research on the verification of concurrent software. This proof system will generalize the QED proof system described in our paper titled "A Calculus of Atomic Actions" that appeared in POPL '09. The project is funded by a Microsoft Research PhD Scholarship -- one of 18 such positions in Europe in 2010. The position is supervised by Dr. Serdar Tasiran of Koc University, and Dr. Shaz Qadeer of Microsoft Research, Redmond, WA, USA. See the link below for further information. http://research.microsoft.com/en-us/collaboration/global/open-phd-positions… The Microsoft Research PhD Scholarship and Koc University will provide to the PhD student the following benefits: - A monthly stipend (3000 TL/month net, roughly 1250 Euros/month) - Annual summer schools at Microsoft Research, Cambridge, UK. An opportunity to interact with world-class researchers. - Paid internship opportunities at Microsoft Research Laboratories. Scholars are paid in addition to their scholarship bursary. - A laptop computer and software provided by Microsoft Research. - Housing and health insurance. Please contact Serdar Tasiran (stasiran(a)ku.edu.tr) to obtain more information and apply. Serdar Tasiran http://home.ku.edu.tr/~stasiran http://theorem.ku.edu.tr

1 0

ANNOUNCE: CamHac: Haskell Hackathon in Cambridge, UK, 12-14 August 2011
by Simon Marlow 26 May '11

26 May '11

CamHac is happening - come and spend a long weekend in Cambridge hacking Haskell code in great surroundings with fantastic company! Full details on the wiki page: http://www.haskell.org/haskellwiki/CamHac When: Friday-Sunday 12-14 August 2011 Where: the Horobin Room of Homerton Conference Centre [1] Registration is free! See the wiki page above for details. We're limited to 50 people, and registration is on a first-come first-served basis, so sign up soon. Feel free to email me with any questions. Many thanks to Microsoft Research Cambridge for agreeing to sponsor the event! Cheers, Simon [1] http://www.homertonconference.com/Horobin.html

1 0

LOPSTR 2011 - call for participation
by German Vidal 26 May '11

26 May '11

(our apologies if you receive multiple copies of this message) ============================================================ CALL FOR PARTICIPATION 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011, AAIP 2011 and WFLP 2011) ============================================================ ONLINE REGISTRATION IS OPEN: http://www.imada.sdu.dk/~petersk/OLP/registration.html EARLY REGISTRATION DEADLINE: May 30, 2011 (next Monday!) The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. SYMPOSIUM PROGRAM (tentative): Monday, July 18, 2011: 14:00 - 15:00: Session 1 * Thomas Stroeder, Peter Schneider-Kamp, Jürgen Giesl, Fabian Emmes and Carsten Fuhs. A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog * Olivier Namet, Maribel Fernandez and Helene Kirchner. A Strategy Language for Graph Rewriting Coffee break 15:30 - 17:30: Session 2 * Paulo Moura. Meta-Predicate Semantics * Jose F. Morales, Manuel Hermenegildo and Rémy Haemmerlé. Modular Extensions for Modular (Logic) Languages * Nik Sultana. A prototype refactoring tool based on a mechanically-verified core * Céline Dandois and Wim Vanhoof. Clones in logic programs and how to detect them Tuesday, July 19, 2011: 09:00 - 10:00: LOPSTR Invited Talk * John Gallagher. <TBA> Coffee break 10:30 - 12:30: Session 3 * Wim Vanhoof. On the partial deduction of non-ground meta-interpreters * Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni. Using Real Relaxations During Program Specialization * Hirohisa Seki. Proving Properties of Co-logic Programs by Unfold/Fold Transformations * Rafael Caballero, Adrian Riesco, Alberto Verdejo and Narciso Marti- Oliet. Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees Lunch break 14:00 - 15:00: Session 4 * Giovanni Bacci, Marco Comini, Marco A. Feliú and Alicia Villanueva. Automatic Synthesis of Specifications for Curry Programs * Jesus Almendros-Jimenez, Rafael Caballero, Yolanda García-Ruiz and Fernando Saenz-Perez. A Declarative Embedding of XQuery in a Functional-Logic Language Coffee break 15:30 - 17:30: Session 5 * Elvira Albert, Miguel Gomez-Zamalloa and José Miguel Rojas Siles. Resource-driven CLP-based Test Case Generation * Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano and Isao Sasano. Marker-directed optimization of UnCAL graph transformations * Sneyers and Daniel De Schreye. Probabilistic Termination of CHRiSM Programs * Paolo Pilozzi and Daniel De Schreye. Improved termination analysis of CHR using self-sustainability analysis Wednesday, July 20, 2011: 9:00 - 10:00: PPDP/LOPSTR Invited Talk * Fritz Henglein. <TBA> Coffee break 10:30 - 11:30: PPDP/LOPSTR Invited Talk * Vitaly Lagoon. The Challenges of Constraint-Based Test Generation Coffee break 11:30 - 12:30: Session 6: * Pedro Cabalar and Stephane Demri. Automata-based Computation of Temporal Equilibrium Models * Demeyer and Wim Vanhoof. Proper Granularity for Atomic Sections in Concurrent Programs Lunch and Excursion ============================================================

1 0

Haskell Weekly News: Issue 183
by Daniel Santa Cruz 26 May '11

26 May '11

Welcome to issue 180 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of May 15 to 21, 2011. Announcements Janis Veigtlander announced that the 20th edition of the Haskell Communities and Activities reports is hot off the press! http://goo.gl/GRi7V Simon Marlow announced that he has put together a tutorial on Parallel and Concurrent programming in Haskell. http://goo.gl/LPst8 Quotes of the Week * Sergey Mironov:I looked further and found that 'Oleg already did it'. * monochrom: just say "yes" Top Reddit Stories * Wolfgang - A Wolfram Alpha clone in Haskell (under heavy load?) Domain: jabberwock.xs4all.nl, Score: 75, Comments: 10 On Reddit: http://goo.gl/okNC7 Original: http://goo.gl/7pSXA * Numeric Haskell: a tutorial about the multi-dimensional, parallel arrays package, Repa Domain: haskell.org, Score: 54, Comments: 7 On Reddit: http://goo.gl/ZRSn3 Original: http://goo.gl/InWB9 * Space leak zoo: a catalog of common space leaks in Haskell programs Domain: blog.ezyang.com, Score: 41, Comments: 7 On Reddit: http://goo.gl/npVLv Original: http://goo.gl/aMbo5 * Exercises in Optimization: A (soon to be) three-part series detailing an adventure in optimizing Haskell code. Domain: csks.wordpress.com, Score: 34, Comments: 0 On Reddit: http://goo.gl/cjWBX Original: http://goo.gl/wPqbl * Tutorial: Parallel and Concurrent Programming in Haskell :: PDF Domain: community.haskell.org, Score: 33, Comments: 7 On Reddit: http://goo.gl/CB1wt Original: http://goo.gl/yzTOU * Anatomy of a thunk leak: How to debug Haskell’s most famous space leak Domain: blog.ezyang.com, Score: 32, Comments: 3 On Reddit: http://goo.gl/f18jX Original: http://goo.gl/PiQ98 * Preview release of diagrams EDSL for declarative drawing Domain: haskell.org, Score: 31, Comments: 9 On Reddit: http://goo.gl/6sykO Original: http://goo.gl/uhbV1 * I/O is not a monad Domain: r6.ca, Score: 31, Comments: 23 On Reddit: http://goo.gl/zAra5 Original: http://goo.gl/mn49r * Eliza in 70 lines of Haskell Domain: github.com, Score: 28, Comments: 7 On Reddit: http://goo.gl/hjgNf Original: http://goo.gl/S7t9m * The "Whole Program" Fallacy Domain: lukepalmer.wordpress.com, Score: 26, Comments: 10 On Reddit: http://goo.gl/Efja3 Original: http://goo.gl/vzXVK Top StackOverflow Questions * What Haskell representation is recommended for 2D, unboxed pixel arrays with millions of pixels? votes: 48, answers: 3 Read on SO: http://goo.gl/gVpwB * Good introductory text about GHC implementation? votes: 24, answers: 2 Read on SO: http://goo.gl/6MZoh * Questions on a Haskell -> C# conversion votes: 13, answers: 3 Read on SO: http://goo.gl/0t3Gu * Can't perform I/O in foldr? votes: 12, answers: 4 Read on SO: http://goo.gl/d9Jg0 * What does "this function will fuse" mean? votes: 11, answers: 3 Read on SO: http://goo.gl/tMdlR * Haskell function type question votes: 10, answers: 3 Read on SO: http://goo.gl/gyTns * Is this always true: fmap (foldr f z) . sequenceA = foldr (liftA2 f) (pure z) votes: 10, answers: 1 Read on SO: http://goo.gl/emKmg * Difference between hsc2hs and c2hs? votes: 8, answers: 2 Read on SO: http://goo.gl/1wnhC * Is it possible to create PHP extensions in Haskell? votes: 8, answers: 2 Read on SO: http://goo.gl/QwkpK * How can configuration tools like sdl-config be used with a cabalized project? votes: 8, answers: 2 Read on SO: http://goo.gl/vHCOu About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz

1 0

ANNOUNCE: regex-genex-0.2.0
by 唐鳳 25 May '11

25 May '11

Hi all, I've just released regex-genex 0.2.0 to Hackage: http://hackage.haskell.org/package/regex-genex-0.2.0 The main interface is this: genex :: [String] -> IO [String] Given a list of regular repressions, genex returns all possible strings that matches all of them. For example: Regex.Genex> genex ["\\d", "[123abc]"] ["2","3","1"] Currently it recognizes the same pattern syntax as regex-tdfa, with full support for word boundaries (\b) and backreferences (\1 through \9). The list is generated lazily, so this terminates quickly: Regex.Genex> fmap (take 10) (genex ["([abc]+)\\1"]) ["bb","cc","aa","bbbb","cccc","aaaa","bcbc","acac","baba","abab"] It uses the "sbv" SMT solver library, which requires the "yices" binary be present in PATH; yices2 can be downloaded from here: http://yices.csl.sri.com/download-yices2.shtml Suggestions and feedback are most welcome. :-) Cheers, Audrey

1 0