- Haskell - Haskell.org

Chalmers FP is hiring 2 Assistant Professors in Functional Programming: deadline 2011-10-18
by John Hughes 12 Oct '11

12 Oct '11

We're recruiting Assistant Professors to the FP group for our new Strategic Research project "RAW FP". Come and work with us! Two-body problem? We've got two jobs! Deadline coming up on the 18th. John Hughes http://wiki.portal.chalmers.se/cse/pmwiki.php/FP/FP https://site1.reachmee.com/I003/chalmers/ENG/vacdetail.aspx?commadseqno=142… 2 Assistant Professors in Functional Programming The Functional Programming group at Chalmers University is seeking two outstanding young researchers for four year Assistant Professor positions Ref 2011/231. Group description Functional programming is enjoying an unprecedented surge of interest, with languages such as Erlang, Scala and Haskell seeing high-profile applications in companies large and small. A major reason is the much improved productivity that software developers can enjoy, by adopting functional programming. With intense competition from emerging economies, productivity improvements are vital if the West is to retain its software industry. We have secured a large, five-year strategic research grant to bring these benefits to two new areas: signal processing and low-level control in the system layer of products such as radio base stations for mobile broadband, and real-time automotive software built around the AUTOSAR standard. Our approach is to combine domain-specific languages embedded in Haskell or Erlang with rapid verification based on property-based testing (QuickCheck) and automated proof tools. Our work is carried out in close cooperation with industry, and has the potential to make a real impact in key industrial sectors. Our group is a leading centre of functional programming research, the source of the QuickCheck testing tool (awarded Most Influential Paper of ICFP 2000 by ACM SIGPLAN), the Equinox theorem prover and Paradox model finder, and of domain specific languages like Lava and the Feldspar signal-processing language (embedded in Haskell, funded by Ericsson, the world's largest supplier of radio base stations). We combine strong links to industry with high academic standards, and thus receive funding from both basic and strategic research agencies. We are currently four professors (Hughes, Sheeran, Claessen, Jansson), five postdocs, and eight doctoral students; our new strategic grant will fund a significant expansion and a stream of visiting international researchers. The proposal that attracted the funding for these positions is available at http://www.cse.chalmers.se/~ms/SSF10Final.pdf<http://www.cse.chalmers.se/%7Ems/SSF10Final.pdf> Although some changes have been made to the plan, the proposal gives a good indication of the research areas to which we expect successful candidates to contribute. Job description These are attractive four year full-time positions in one of the strongest Functional Programming groups anywhere. You will work at the cutting edge of research in Functional Programming, and will strengthen your qualifications, both for advancement in academia and for industrial research positions. After two years, progress will be assessed. After four years, an Assistant Professor who has been appointed in open competition may, under certain circumstances, be considered for appointment to a permanent position as Associate Professor. You will be expected to take part in teaching and masters project supervision (to a maximum of 25%) and also in doctoral student supervision. The working language in the research group is English. The undergraduates are normally taught in Swedish, but the graduate level teaching is in English. You will gain experience of grant proposal writing, as we strive to find funding for our long term research. You will most likely be involved in industrial collaboration. The positions are available from October 2011, although the start date is negotiable. Required qualifications We are looking for researchers with a strong record in functional programming research and practice, preferably related to domain specific languages, testing and/or automated reasoning. You should have a doctorate in computer science (normally completed at most five years before deadline for application), and ideally also post-doctoral experience. We have promised much in the above proposal, and you will be expected to help us to deliver! You should have a strong publication record for your academic age. We place particular emphasis on the communication of research results and the quality of your writing will strongly influence our assessment of you. Please make sure to include your three best papers in your application. Application procedure The application shall be marked with Ref 2011/231 and written in English. The application shall be sent electronically and be attached as three pdf-files, as below: 1. Application: - a first page containing name, reference number 2011/231 and a list of all documents that have been enclosed, - description of the applicant's research and pedagogical qualifications, as well as other qualifications, - CV, - complete list of publications, - plans for future work within the area of the announced position, both scientific and educational, if appointed, - two reference persons who can be contacted by Chalmers (describe association with them and give their contact addresses). 2. letter of application detailing your specific qualifications for the position. 3. Publications: - copies of the applicant's best scientific publications (not more than 5), - copies of a maximum of 5 other publications (such as pedagogy, and popular science) in support of pedagogical and other merits. The application should be sent electronically. Please use the button at the foot of the page to reach the application form. The files may be compressed (zipped). Application deadline: 2011-10-18 For questions, please contact: Professor John Hughes, rjmh(a)chalmers.se<mailto:rjmh@chalmers.se> Professor Mary Sheeran, ms(a)chalmers.se<mailto:ms@chalmers.se> Department level: Head of the Department, Catarina Coquand, catarina.coquand(a)chalmers.se<mailto:catarina.coquand@chalmers.se> All reachable via Chalmers exchange: +46 31 772 10 00 Chalmers University of Technology conducts research and education in engineering sciences, architecture, technology-related mathematical sciences, natural and nautical sciences - in close collaboration with industry and society. The strategy for scientific excellence focuses our eight Areas of Advance; Built Environment, Energy, Information- & Communication Technology, Life Science, Materials Science, Nanoscience & Nanotechnology, Production and Transport. The aim is to make an active contribution to a sustainable future using the basic sciences as a foundation and innovation and entrepreneurship as central driving forces. Chalmers has about 11,000 students and 2,500 employees. New knowledge and improved technology has characterised Chalmers since its foundation in 1829 in accordance with the testament of William Chalmers, and his motto: Avancez! www.chalmers.se/en<http://www.chalmers.se/en>

1 0

ANNOUNCE: knob, a library for memory-backed handles
by John Millikin 09 Oct '11

09 Oct '11

http://hackage.haskell.org/package/knob This is a small package which allows you to create memory-backed handles. I found it as a pattern in a few of my test suites, so I spent a day or so polishing it up before posting it to the internet. Feel free to play around with it and tell me about any issues that pop up, or things you wish it could do. The interface is very simple; here's a taste: -------------------------------------------------------------------------- import Data.ByteString (pack) import Data.Knob import System.IO main = do -- for this example, we'll start with an empty knob knob <- newKnob (pack []) -- write to it withFileHandle knob "test.txt" WriteMode $ \h -> do hPutStrLn h "Hello world!" bytes <- Data.Knob.getContents knob putStrLn ("Wrote bytes: " ++ show bytes) -- read from it withFileHandle knob "test.txt" ReadMode $ \h -> do line <- hGetLine h putStrLn ("Got line: " ++ show line) --------------------------------------------------------------------------

1 0

Call for Contributions - Haskell Communities and Activities Report, November 2011 edition
by Janis Voigtländer 08 Oct '11

08 Oct '11

Dear all, I would like to collect contributions for the 21st edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 November 2011 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the May 2011 edition --- you will find interesting topics described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/11-2011/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2011/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please consider using lhs2tex syntax (http://people.cs.uu.nl/andres/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. If you have several entries to submit, it helps if you send them in separate emails. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. This corresponds to approximately one page, or 40 lines of text, with the above style and template. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. You can use it to write "wishlist" items for libraries and language features you would like to see implemented. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them.

1 0

ANNOUNCE: Parsec 3.1.2
by Antoine Latter 08 Oct '11

08 Oct '11

Parsec is a monadic combinator library that is well-documented, simple to use, and produces good error messages. This is a minor point release over Parsec 3.1.1. The changes in this release are: >From Roman Cheplyaka: - 'lookAhead' no longer counts as 'consuming input', even when it succeeds. - Fixes for 'try' related to error position reporting - Fix for merging error messages Other changes: - Fix reserved name recognition for case-insensitive languages - Add instances for 'Stream Text' (both lazy Text and strict Text), allowing Char parsers to run on the Text type. Link on Hackage: http://hackage.haskell.org/package/parsec-3.1.2 Notes: The new instances are orphaned in their own new modules, so there shouldn't be conflicts for projects defining their own orphan instances. Thanks to: Roman Cheplyaka for development, Andrew U. Frank for a bug report. Antoine

1 0

CAV 2012: Call For Workshops
by CAV 2012 CFP 08 Oct '11

08 Oct '11

------------------------------------------------------------------------ ***** CALL FOR WORKSHOP PROPOSALS ******* 24th International Conference on Computer Aided Verification CAV 2012 July 7-13, 2012 Berkeley, California, USA Workshop Chair: Shuvendu Lahiri (Microsoft Research, Redmond) The 2012 Computer-Aided Verification (CAV) Workshops provide an opportunity for participants to discuss topics in the broader verification related domains. CAV 2012 Workshops will be held before the main conference on July 7 and 8. Workshop proposals will be reviewed by the Workshop chair along with the program chairs and members of the steering committee. Proposals must consist of the following two parts: -- Part I: Technical Information -- A short (about 1 page) scientific justification of the proposed topic, its significance and relevance to CAV, and the particular benefits of the workshop to the verification community, as well as a list of previous or related workshops (if relevant). -- Part II: Organizational Information -- - contact information of the workshop organizers - identifying a main contact for the workshop (i.e. a workshop chair) - the desired length of the workshop, (one or two days) - estimate of the audience size - proposed format and agenda (for example, demo sessions, tutorials, etc.) - potential invited speakers - procedures for selecting papers and participants - plans for dissemination, if any (for example, special issues of journals) - special technical, AV, or USB stick needs - links to a preliminary website of the workshop and call for papers (if possible) - information if workshop has been previously held Important Dates: Proposals are due by Nov 10th, 2011 by email to the Workshop chair. Organizers will be notified by Nov 20th, 2011. The workshop proposals will be reviewed and evaluated on the following criteria: * Potential to advance state of the art in verification technologies, especially ability to break new ground. * Relevance to CAV. * Overlap of topics with other proposed workshops. * Past-successes of the workshop and association with previous CAV conferences. * Organizers' ability and experience to lead a successful workshop. All accepted workshops will be asked to provide a webpage, call for papers, and list of invited speakers. The workshop participants will be required to register for the workshop through the CAV main registration page. The registration rates for workshops will be set by CAV organizers in consultation with the workshop organizers, following rate structures similar to (but not the same as) those followed in the past. The workshop organizers are strongly encouraged to seek external funding and sponsorships. For further enquiries or information, please contact: Shuvendu Lahiri (CAV2012 Workshop Chair) Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA Phone: 1-425-722-4122 email: shuvendu AT microsoft.com http: http://research.microsoft.com/en-us/people/shuvendu/ -------------------------------------------------------------------------

1 0

VSTTE 2012 Verification Competition: Change of Dates
by Gudmund Grov 07 Oct '11

07 Oct '11

*** Note: due to a clash with SEFM 2011, *** *** we have moved the competition to November 8-10 *** VSTTE 2012 Verification Competition ----------------------------------- A software verification competition is organized on behalf of the VSTTE 2012 conference (https://sites.google.com/site/vstte2012) The purposes of this competition are: to help promote approaches and tools, to provide new verification benchmarks, to stimulate further development of verification techniques, and to have fun. The contest takes place during 48 hours, on 8-10 November 2011, two months prior to the conference. Problems will be put on the website of the conference. Solutions must be sent by email to the competition organizers. Any programming language, specification language, and verification tool is allowed. Problems -------- There will be several, independent problems. Each problem is presented as a sequential algorithm, using English or pseudocode, and a list of properties to formally prove about it, also expressed in plain English and standard mathematical notation. Participants have liberty to implement the proposed algorithms in functional, imperative, object-oriented, or any other programming style. Evaluation ---------- Submissions are ranked according to the total sum of points they score. Each problem includes several sub-tasks, e.g. safety, termination, behavioral correctness, etc., and each sub-task is given a number of points. While evaluating the submissions, judges take into account the accuracy and thoroughness of solutions as well as their terseness and elegance. (Clarity is more important than brevity.) A certain degree of subjectivity is inevitable and should be considered as part of the game. Participants ------------ Anybody interested can take part in the contest. Team work is allowed. Only teams up to 4 members are eligible for the first prize. Individual participants may belong to several teams. However, the same solution cannot appear in different submissions. The technical requirements are as follows: - access to the web to download the problems (PDF file); - access to the email to submit the solutions; - any software used in the solutions should be freely available for noncommercial use to the public. This does not exclude closed source programs (such as Microsoft's Z3). Software must be usable on an x86 Linux or Windows machine. Participants are authorized to modify their tools during the competition. Submission ---------- A submission is a (possibly compressed) tarball that contains exactly one directory (named by the team, for instance). This directory should contain at least a text file named README, and one directory for each problem solved. Thus it must look like: team/ -+ +- README +- problem1/ +- problem2/ + ... +- problemN/ +- other stuff... The README file should contain the following information: - contact information (email); - detailed description of the submitted solutions: properties that have been specified and/or proved, restrictions and/or generalizations, anything that may facilitate the review; - detailed instructions to replay the solutions, including the software to use, URLs to get it from, compilation commands, etc. Several solutions can be submitted for the same problem (for instance, using different tools). They should be stored in separate subdirectories of problemI/. During evaluation, only the best-faring solution will be taken into account. Organizers ---------- - Jean-Christophe Filliâtre (CNRS, France) - Andrei Paskevich (Univ Paris Sud, France) - Aaron Stump (University of Iowa, USA) Schedule -------- Tuesday 8 Nov 2011, 15:00 UTC - competition starts Thursday 10 Nov 2011, 15:00 UTC - competition stops Monday 12 Dec 2011 - the winner is notified 28-29 Jan 2012 - results are announced at VSTTE 2012 Prize ----- The winner is awarded a talk slot at VSTTE 2012, to present any research of his/her choice of interest for the VSTTE community. In particular, a presentation of solutions to the competition problems and/or of the techniques and system used would be appreciated. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

CAV 2012: Call For Papers
by CAV 2012 CFP 06 Oct '11

06 Oct '11

====== CALL FOR PAPERS ====== 24th International Conference on Computer Aided Verification (CAV 2012) July 7-13, 2012 Berkeley, California, USA Program Chairs: Madhusudan Parathasarathy and Sanjit A. Seshia Website: http://cav12.cs.illinois.edu/ Aims and Scope ------------------- The conference on Computer Aided Verification (CAV), 2012, is the 24th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. Topics of interest include: - Algorithms and tools for verifying models and implementations - Hardware verification techniques - Hybrid systems and embedded systems verification - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Testing and runtime analysis based on verification technology - Verification methods for parallel and concurrent hardware/software systems - Applications and case studies in verification - Verification in industrial practice - Algorithms and tools for system synthesis - Verification techniques for security - Formal models and methods for biological systems ** NEW in 2012 ** CAV will have *special tracks* in the following four areas: 1. Hardware Verification (track chair: Andreas Kuehlmann) 2. Computer Security (track chair: Somesh Jha) 3. Embedded Systems (track chair: Stavros Tripakis) 4. SAT and SMT (track chair: Daniel Kroening) Submissions in these four topics are especially encouraged. Papers in these areas will be subject to the same rigorous review process as other papers. Accepted special track papers will be organized into special sessions that are highlighted in the program. Events --------- The conference will include the following events: * Pre-conference workshops on July 7-8. * The main conference will take place July 9th-13th: -- Invited tutorials on July 9th. -- Technical sessions on July 10-13. Please see the conference website for further details. Paper Submission -------------------- There are two categories of submissions: A. Regular Papers: Submissions, not exceeding sixteen (16) pages using Springer's LNCS format, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data available with their submission. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses, and strengths in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. B. Tool Presentations: Submissions, not exceeding six (6) pages using Springer's LNCS format, should describe the implemented tool and its novel features. An appendix that will not be part of the published presentation may be added for use in the program committee selection process. A demonstration, in a separate demonstration session, is expected to accompany a tool presentation. Papers describing tools that have already been presented (in any conference) will be accepted only if significant and clear enhancements to the tool are reported and implemented. Papers exceeding the stated maximum length run the risk of rejection without review. Note that the page limit for submissions has been increased to 16 pages. For regular papers, an appendix can be joined to the submissions providing additional material such as details on proofs or experiments. The appendix is not guaranteed to be read or taken into account by the reviewers and it should not contain information necessary to the understanding and the evaluation of the presented work. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. Papers must be submitted in PDF format. Submission is done with EasyChair. Information about the submission procedure will be available at: http://cav12.cs.illinois.edu/ Important Dates - Abstract submission: January 15, 2012 - Paper submission (firm): January 22, 2012 at 23:59 Samoa time (UTC/GMT-11) - Author feedback/rebuttal period: March 7-9, 2012 - Notification of acceptance/rejection: March 22, 2012 - Final version due: April 20, 2012 Program Chairs ------------------ Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign, USA Sanjit A. Seshia, University of California at Berkeley, USA Program Committee --------------------- Rajeev Alur (Univ. Pennsylvania) Roderick Bloem (TU Graz) Supratik Chakraborty (IIT Bombay) Swarat Chaudhuri (Rice Univ.) Adam Chlipala (MIT) Vincent Danos (University of Edinburgh) Thomas Dillig (College of William and Mary) Andy Gordon (Microsoft Research) Mike Gordon (Cambridge Univ.) Orna Grumberg (Technion) Aarti Gupta (NEC Labs) William Hung (Synopsys) Somesh Jha (Univ. Wisconsin) Ranjit Jhala (UCSD) Bengt Jonsson (Uppsala Univ.) Rajeev Joshi (NASA JPL) Daniel Kroening (Oxford Univ.) Andreas Kuehlmann (Coverity) Viktor Kuncak (EPFL) Shuvendu Lahiri (Microsoft Research) Rupak Majumdar (MPI-SWS) Ken Mcmillan (Microsoft Research) David Molnar (Microsoft Research) Kedar Namjoshi (Bell Labs) Albert Oliveras (TU Catalonia, Barcelona) Joel Ouaknine (Oxford Univ.) Gennaro Parlato (Univ. of Southampton) Madhusudan Parthasarathy (UIUC) Nir Piterman (Univ. of Leicester) Andreas Podelski (Univ. of Freiburg) Shaz Qadeer (Microsoft Research) Zvonimir Rakamaric (Univ. of Utah) Sriram Sankaranarayanan (Univ. of Colorado) Sanjit A. Seshia (UC Berkeley) Natasha Sharygina (Univ. of Lugano) Stavros Tripakis (UC Berkeley) Helmut Veith (TU Vienna) Mahesh Viswanathan (UIUC) Jin Yang (Intel) Karen Yorav (IBM) Steering Committee ---------------------- Michael Gordon, University of Cambridge, UK Orna Grumberg, Technion, Israel Robert Kurshan, Cadence Design Systems, USA Kenneth McMillan, Microsoft Research, USA CAV Award ------------ The annual CAV Award has been established for a specific fundamental contribution or a series of outstanding contributions to the field of Computer Aided Verification. The award of $10,000 will be granted to an individual or a group of individuals chosen by the Award Committee from a list of nominations. The Award Committee may choose to make no award. The CAV Award shall be presented in an award ceremony at CAV and a citation will be published in a Journal of Record (currently, Formal Methods in System Design). Call for Nominations for the CAV Award ------------------------------------------ Anyone can submit a nomination. The Award Committee can originate a nomination. Anyone, with the exception of members of the Award Committee, is eligible to receive the Award. A nomination must state clearly the contribution(s), explain why the contribution is fundamental or the series of contributions is outstanding, and be accompanied by supporting letters and other evidence of worthiness. Nominations should include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination. The cited contribution(s) must have been made not more recently than five years ago and not over twenty years ago. In addition, the contribution(s) should not yet have received recognition via a major award, such as the ACM Turing or Kanellakis Awards. The nominee may have received such an award for other contributions. The 2012 CAV Award Committee consists of Thomas A. Henzinger (Chair) Rajeev Alur Marta Kwiatkowska Aarti Gupta The nominations should be sent to Thomas Henzinger at tah(a)ist.ac.at. Nominations must be received by January 22, 2012.

1 0

Haskell Weekly News: Issue 202
by Daniel Santa Cruz 06 Oct '11

06 Oct '11

Welcome to issue 202 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of September 25 to October 1, 2011. New and Updated Projects * ParserFunction (Enzo Fabrizio; 0.0.5) Provides utilities for parsing and evaluating mathematical expressions. [1] http://goo.gl/xNOe1 * flexiwrap (Iain Alexander; 0.1.0) Also updates to related packages: data-type, function-combine, and flexiwrap-smallcheck. [2] http://goo.gl/dN0ew * crypto-api-tests (Thomas DuBuisson) These tests have been split out into their own package. Tests now use the test-framework package. [3] http://goo.gl/7kUIV * hledger (Simon Michael; 0.16) Stability/bugfix/polish release. [4] http://goo.gl/hW085 * GA (Kenneth Hoste; 1.0) Major version bump to this genetic algorithms package. [5] http://goo.gl/NoAl4 Quotes of the Week * glguy: lazy evaluation is best 50% of time because there are 2 cases, the cases where it is the best and the cases where it is not the best * Cale: Computing lengths is admitting defeat * syntaxfree: Many people think the core ideas behind Haskell [snip] In the Deep Complex Universe some Gnomes were having Tangling problems. Wadler & friends solved their problems and as a reward the Tangled Gnomes gave them the Secret of Haskell * monochrom: How do I extract the IO out of IO String? Top Reddit Stories * GHC-specific alias analysis for LLVM Domain: blog.omega-prime.co.uk, Score: 74, Comments: 4 On Reddit: [6] http://goo.gl/kNXp9 Original: [7] http://goo.gl/851qj * GHC Projects for All Domain: dterei.blogspot.com, Score: 45, Comments: 2 On Reddit: [8] http://goo.gl/X3jpJ Original: [9] http://goo.gl/FpnUP * The Evolution of a Haskell Programmer Domain: willamette.edu, Score: 41, Comments: 17 On Reddit: [10] http://goo.gl/4WQyK Original: [11] http://goo.gl/gbNsH * Stanford CS240h, Functional Systems in Haskell course materials available on GitHub Domain: github.com, Score: 29, Comments: 3 On Reddit: [12] http://goo.gl/5aL1X Original: [13] http://goo.gl/EEflc * Introduction to programming with shift and reset (Tutorial by Oleg) Domain: okmij.org, Score: 29, Comments: 1 On Reddit: [14] http://goo.gl/Ogsjo Original: [15] http://goo.gl/xvVmQ * A few Haskell notes from the Strange Loop conference Domain: serpentine.com, Score: 27, Comments: 2 On Reddit: [16] http://goo.gl/qx4qn Original: [17] http://goo.gl/nplIs * Par Monad Slides from CUFP Domain: community.haskell.org, Score: 27, Comments: 0 On Reddit: [18] http://goo.gl/pFkgw Original: [19] http://goo.gl/Ax4bW * Slides from the CUFP 2011 Snap Framework Tutorial Domain: gregorycollins.net, Score: 23, Comments: 0 On Reddit: [20] http://goo.gl/uVrlv Original: [21] http://goo.gl/myRYa * Haskell Job Opportunity at Sensor Sense Domain: self.haskell, Score: 22, Comments: 1 On Reddit: [22] http://goo.gl/PpSdW Original: [23] http://goo.gl/PpSdW * Slides from my Haskell Implementors Workshop talk Domain: blog.johantibell.com, Score: 20, Comments: 3 On Reddit: [24] http://goo.gl/sgmzC Original: [25] http://goo.gl/BT4H0 Top StackOverflow Questions * Learning Haskell with a view to learning Scala votes: 23, answers: 4 Read on SO: [26] http://goo.gl/8BnAv * Why are the functions making Vector an instance of Functor, Monad, Applicative, Alternative, Foldable and Traversable slow? votes: 11, answers: 2 Read on SO: [27] http://goo.gl/F8sph * Strategies in Scala votes: 10, answers: 1 Read on SO: [28] http://goo.gl/NzUiU * What's the smoothest way to update haskell platform to latest? votes: 8, answers: 2 Read on SO: [29] http://goo.gl/EnG7p * Does Haskell have an equivalent to Sage? votes: 8, answers: 3 Read on SO: [30] http://goo.gl/v7oE8 * Haskell syntax for 'or' in case expressions votes: 7, answers: 3 Read on SO: [31] http://goo.gl/Akl9D * Is operator && strict in Haskell? votes: 6, answers: 3 Read on SO: [32] http://goo.gl/TLe86 Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18942 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18943 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/92700 4. http://permalink.gmane.org/gmane.comp.finance.ledger.hledger/521 5. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/92746 6. http://blog.omega-prime.co.uk/?p=135 7. http://www.reddit.com/r/haskell/comments/kwaee/ghcspecific_alias_analysis_f… 8. http://dterei.blogspot.com/2011/09/ghc-project-for-all.html 9. http://www.reddit.com/r/haskell/comments/kwm0g/ghc_projects_for_all/ 10. http://www.willamette.edu/~fruehr/haskell/evolution.html 11. http://www.reddit.com/r/haskell/comments/kv610/the_evolution_of_a_haskell_p… 12. https://github.com/bos/stanford-cs240h 13. http://www.reddit.com/r/haskell/comments/kvjda/stanford_cs240h_functional_s… 14. http://okmij.org/ftp/continuations/index.html#tutorial 15. http://www.reddit.com/r/haskell/comments/kxg3o/introduction_to_programming_… 16. http://www.serpentine.com/blog/2011/09/27/the-strange-loop-conference-was-a… 17. http://www.reddit.com/r/haskell/comments/ktscd/a_few_haskell_notes_from_the… 18. http://community.haskell.org/~simonmar/slides/CUFP.pdf 19. http://www.reddit.com/r/haskell/comments/ky3cw/par_monad_slides_from_cufp/ 20. http://gregorycollins.net/posts/2011/10/01/cufp-tutorial-slides 21. http://www.reddit.com/r/haskell/comments/kxkex/slides_from_the_cufp_2011_sn… 22. http://www.reddit.com/r/haskell/comments/kt5g4/haskell_job_opportunity_at_s… 23. http://www.reddit.com/r/haskell/comments/kt5g4/haskell_job_opportunity_at_s… 24. http://blog.johantibell.com/2011/09/slides-from-my-haskell-implementors.html 25. http://www.reddit.com/r/haskell/comments/kti89/slides_from_my_haskell_imple… 26. http://stackoverflow.com/questions/7594337/learning-haskell-with-a-view-to-… 27. http://stackoverflow.com/questions/7583403/why-are-the-functions-making-vec… 28. http://stackoverflow.com/questions/7574937/strategies-in-scala 29. http://stackoverflow.com/questions/7546949/whats-the-smoothest-way-to-updat… 30. http://stackoverflow.com/questions/7556053/does-haskell-have-an-equivalent-… 31. http://stackoverflow.com/questions/7603509/haskell-syntax-for-or-in-case-ex… 32. http://stackoverflow.com/questions/7612580/is-operator-strict-in-haskell

1 0

getting started
by haskell 06 Oct '11

06 Oct '11

i am new to haskell can you tell me the softwares to install in haskell i have install hugs emacs but when i write any code it gives same error can you help me start i have lekash too i have installed some more packages -- View this message in context: http://haskell.1045720.n5.nabble.com/getting-started-tp4848583p4848583.html Sent from the Haskell - Haskell mailing list archive at Nabble.com.

6 10

Chalmers FP is hiring 2 Assistant Professors in Functional Programming: deadline 2011-10-18
by Patrik Jansson 04 Oct '11

04 Oct '11

Come and work with us! /Patrik http://wiki.portal.chalmers.se/cse/pmwiki.php/FP/FP https://site1.reachmee.com/I003/chalmers/ENG/vacdetail.aspx?commadseqno=142… 2 Assistant Professors in Functional Programming The Functional Programming group at Chalmers University is seeking two outstanding young researchers for four year Assistant Professor positions Ref 2011/231. *Group description *Functional programming is enjoying an unprecedented surge of interest, with languages such as Erlang, Scala and Haskell seeing high-profile applications in companies large and small. A major reason is the much improved productivity that software developers can enjoy, by adopting functional programming. With intense competition from emerging economies, productivity improvements are vital if the West is to retain its software industry. We have secured a large, five-year strategic research grant to bring these benefits to two new areas: signal processing and low-level control in the system layer of products such as radio base stations for mobile broadband, and real-time automotive software built around the AUTOSAR standard. Our approach is to combine domain-specific languages embedded in Haskell or Erlang with rapid verification based on property-based testing (QuickCheck) and automated proof tools. Our work is carried out in close cooperation with industry, and has the potential to make a real impact in key industrial sectors. Our group is a leading centre of functional programming research, the source of the QuickCheck testing tool (awarded Most Influential Paper of ICFP 2000 by ACM SIGPLAN), the Equinox theorem prover and Paradox model finder, and of domain specific languages like Lava and the Feldspar signal-processing language (embedded in Haskell, funded by Ericsson, the world's largest supplier of radio base stations). We combine strong links to industry with high academic standards, and thus receive funding from both basic and strategic research agencies*. *We are currently four professors (Hughes, Sheeran, Claessen, Jansson), five postdocs, and eight doctoral students; our new strategic grant will fund a significant expansion and a stream of visiting international researchers. The proposal that attracted the funding for these positions is available at http://www.cse.chalmers.se/~ms/SSF10Final.pdf <http://www.cse.chalmers.se/%7Ems/SSF10Final.pdf> Although some changes have been made to the plan, the proposal gives a good indication of the research areas to which we expect successful candidates to contribute. *Job description *These are attractive four year full-time positions in one of the strongest Functional Programming groups anywhere. You will work at the cutting edge of research in Functional Programming, and will strengthen your qualifications, both for advancement in academia and for industrial research positions. After two years, progress will be assessed. After four years, an Assistant Professor who has been appointed in open competition may, under certain circumstances, be considered for appointment to a permanent position as Associate Professor. You will be expected to take part in teaching and masters project supervision (to a maximum of 25%) and also in doctoral student supervision. The working language in the research group is English. The undergraduates are normally taught in Swedish, but the graduate level teaching is in English. You will gain experience of grant proposal writing, as we strive to find funding for our long term research. You will most likely be involved in industrial collaboration. The positions are available from October 2011, although the start date is negotiable. *Required qualifications* We are looking for researchers with a strong record in functional programming research and practice, preferably related to domain specific languages, testing and/or automated reasoning. You should have a doctorate in computer science (normally completed at most five years before deadline for application), and ideally also post-doctoral experience. We have promised much in the above proposal, and you will be expected to help us to deliver! You should have a strong publication record for your academic age. We place particular emphasis on the communication of research results and the quality of your writing will strongly influence our assessment of you. Please make sure to include your three best papers in your application. *Application procedure* /The application shall be marked with Ref 2011/231 and written in English. The application shall be sent electronically and be attached as *three *pdf-files, as below:/ 1. Application: - a first page containing name, reference number 2011/231 and a list of all documents that have been enclosed, - description of the applicant's research and pedagogical qualifications, as well as other qualifications, - CV, - complete list of publications, - plans for future work within the area of the announced position, both scientific and educational, if appointed, - two reference persons who can be contacted by Chalmers (describe association with them and give their contact addresses). 2. letter of application detailing your specific qualifications for the position. 3. Publications: - copies of the applicant's best scientific publications (not more than 5), - copies of a maximum of 5 other publications (such as pedagogy, and popular science) in support of pedagogical and other merits. The application should be sent electronically. Please use the button at the foot of the page to reach the application form. The files may be compressed (zipped). *Application deadline: 2011-10-18* ** *For questions, please contact: *Professor John Hughes, rjmh(a)chalmers.se <mailto:rjmh@chalmers.se> Professor Mary Sheeran, ms(a)chalmers.se <mailto:ms@chalmers.se> Department level: Head of the Department, Catarina Coquand, catarina.coquand(a)chalmers.se <mailto:catarina.coquand@chalmers.se> All reachable via Chalmers exchange: +46 31 772 10 00 /Chalmers University of Technology conducts research and education in engineering sciences, architecture, technology-related mathematical sciences, natural and nautical sciences -- in close collaboration with industry and society. The strategy for scientific excellence focuses our eight Areas of Advance; Built Environment, Energy, Information- & Communication Technology, Life Science, Materials Science, Nanoscience & Nanotechnology, Production and Transport. The aim is to make an active contribution to a sustainable future using the basic sciences as a foundation and innovation and entrepreneurship as central driving forces. Chalmers has about 11,000 students and 2,500 employees. New knowledge and improved technology has characterised Chalmers since its foundation in 1829 in accordance with the testament of William Chalmers, and his motto: Avancez! www.chalmers.se/en/

1 0