January 2012 - Haskell

The deadlines for paper submission have been extended (TASE 2012)
by Huibiao Zhu 13 Jan '12

13 Jan '12

TASE 2012 - CALL FOR PAPERS *********************************************************** The Sixth IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE 2012) 4-6 July 2012, Beijing, China http://selab.bjut.edu.cn/tase2012 For more information email: tase2012(a)bjut.edu.cn The deadlines for paper submission have been extended. Abstract Submission: 3 February, 2012 (New) Full-paper submission: 10 February, 2012 (New) *********************************************************** Large scale software systems and the Internet are of growing concern to academia and industry. This poses new challenges to the various aspects of software engineering, for instance, the reliability of software development, Web-oriented software architecture and aspect and object-orientation techniques. As a result, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2012 is a forum for researchers from academia, industry and government to present ideas, results, and ongoing research on theoretical advances in software engineering. TASE 2012 is the sixth in a series of symposiums, sponsored by IEEE CS and IFIP. The first TASE symposium was held in Shanghai, China, in June 2007. The second TASE symposium was held in Nanjing, China, in June 2008. The third TASE symposium was held in Tianjin, China, in July 2009. The fourth TASE symposium was held in Taipei, in August 2010, and the fifth TASE symposium was held in Xi'an, China, in August 2011. Topics of Interest: Authors are invited to submit high quality technical papers describing original and unpublished work in all theoretical aspects of software engineering. Topics of interest include, but are not limited to: * Requirements Engineering * Specification and Verification * Program Analysis * Software Testing * Model-Driven Engineering * Software Architectures and Design * Aspect and Object Orientation * Embedded and Real-Time Systems * Software Processes and Workflows * Component-Based Software Engineering * Software Safety, Security and Reliability * Reverse Engineering and Software Maintenance * Service-Oriented Computing * Semantic Web and Web Services * Type System and Theory * Program Logics and Calculus * Dependable Concurrency * Software Model Checking * Probability and Randomization All accepted papers will be included in IEEE Xplore and indexed by Ei Compendex. It is envisaged to invite the best tool-related contributions to a Special Section of STTT, Springer Verlag's Intern. Journal on Software Tools for Technology Transfer. General Co-Chairs: Jifeng He (East China Normal University, China) Baocai Yin (Beijing University of Technology, China) Program Co-Chairs: Tiziana Margaria (University Potsdam, Germany) Zongyan Qiu (Peking University, China) Hongli Yang (Beijing University of Technology, China) Publicity Chairs: Zongli Jiang (Beijing University of Technology) Jonathan P. Bowen (Museophile Limited) Organizing Chair: Husheng Liao (Beijing University of Technology, China) Local Arrangement Chair: Dan Wang (Beijing University of Technology, China) Program Committee Bernhard Aichernig (Graz University of Technology, AT) Richard Banach (University of Manchester, UK） Dirk Beyer (University of Passau) Lubos Brim (Masaryk University Brno - Czech Republic) Michael Butler (University of Southampton, UK) Aziem Chawdhary (Contemplate Ltd, UK) Florin Craciun (Babes-Bolyai University, Romania) Tyng-Ruey Chuang (Academica Sinica, Taiwan) Wei-Ngan Chin (National University of Singapore, Singapore) Zhenhua Duan (Xidian University, China) Joao Ferreira (Teesside University, UK) Xinyu Feng (University of Science and Technology of China) Hai-Feng Guo (University of Nebraska, Omaha) Sara Kalvala (University o Warwick, UK) Paritosh K. Pandya (Tata Institute of Fundamental Research, India) Husheng Liao (Beijing University of Technology, China) Xuandong Li (Nanjing University, China) Shaoying Liu (Hosei University, Japan) Yang Liu (National Univ. of Singapore, Singapore) Tiziana Margaria (University Potsdam, Germany, Co-Chair) Dominique Mery (Univ. Nancy, LORIA, France) Radu Mateescu (INRIA Grenoble) Huaikou Miao (Shanghai University, China) Corneliu Popeea (Technische Universit?t München, Germany) Geguang Pu (East China Normal University, China) Jun Pang (University of Luxembourg) Sungwoo Park (Pohang University of Science and Technology, Korea) Zongyan Qiu (Peking University, China, Co-Chair) Shengchao Qin (Teesside University, UK) Cristina Seceleanu (Malardalen Technical University, Sweden) Jun Sun (Singapore University of Technology and Design) Meng Sun (Peking University, China) Yih-Kuen Tsay (National Taiwan University) Hai Wang (Aston University, UK) Yi Wang (Uppsala University, Sweden) Ji Wang (National University of Defense Technology, China) Ender Yuksel (Technical University of Denmark) Hongli Yang (Beijing University of Technology, China, Co-Chair) Gianluigi Zavattaro (University of Bologna) Naijun Zhan (Chinese Academy of Sciences, China) Hongyu Zhang (Tsinghua University, China) Jian Zhang (Chinese Academy of Sciences, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Xiangpeng Zhao (Microsoft ATC, China) Hong Zhu (Oxford Brookes University, UK) Huibiao Zhu (East China Normal University, China)

1 0

ANNOUNCE: quickcheck-instances
by Antoine Latter 12 Jan '12

12 Jan '12

Hello! I'd like to announce the first release of the quickcheck-instances package, which aims to consolidate commonly needed class instances for use with QuickCheck. These instances are appropriate when your tests don't have strong requirements on the nature of the input data - for example, if you are testing a network-protocol parser, the ByteString instance provided in this package might not be what you want to use. Other limitations: * I do not have full coverage of the Haskell Platform - I have been adding instances as I need them. Patches are warmly welcomed, however. * I only have instances of the 'Arbitrary' class, however I would be happy to accept patches for instances of CoArbitrary and other classes that would be useful in quickcheck-based testing. On Hackage: http://hackage.haskell.org/package/quickcheck-instances Ordinarily I frown on orphaned instances in library packages, but the fact that quickcheck properties should never appear in a library Cabal package, most of the downsides of orphans are mitigated. Thanks, Antoine

1 0

Well-Typed are hiring: Haskell consultant
by Andres Löh 12 Jan '12

12 Jan '12

In order to keep up with customer demand, we are looking to hire a Haskell expert to work with us at Well-Typed (http://www.well-typed.com/) as a Haskell consultant. This is an exciting opportunity for someone who is passionate about Haskell and who is keen to improve and promote Haskell in a professional context. The role is quite general and could cover any of the projects and activities that we are involved in as a company. The tasks may involve: * working on the Haskell compilers, libraries and tools; * Haskell application development; * working directly with clients to solve their problems. Well-Typed has a variety of clients. For some we do proprietary Haskell development and consulting. For others, much of the work involves open-source development and cooperating with the rest of the Haskell community: the commercial, open-source and academic users. At the moment, we are running the Parallel GHC Project (http://www.haskell.org/haskellwiki/Parallel_GHC_Project/) It is likely that initial tasks will have some connection with parallel and/or concurrent programming in Haskell. We are also doing quite a bit of GHC maintenance, and some knowledge or interest in compiler internals, operating systems, the foreign language interface, and/or deployment issues would be welcome. Our ideal candidate has excellent knowledge of Haskell, whether from industry, academia, or personal interest. Familiarity with other languages, low-level programming, and good software engineering practices are also useful. Good organisation and ablity to manage your own time, and reliably meet deadlines, is important. You are likely to have a batchelor's degree or higher in computer science or a related field, although this isn't a requirement. Experience of consulting, or running a business, is also a bonus. The position is initially as a contractor for one year with a salary of 150 GBP per day. We offer flexible hours and work from home. Living in England is not required. In the longer term there is the opportunity to become a member of the partnership with a full stake in the business: being involved in business decisions, and fully sharing the risks and rewards. If you are interested, please apply via info(a)well-typed.com. Tell us why you are interested and why you would be a good fit for the job, and attach your CV. Please also indicate when you might be able to start. We are more than happy to answer informal enquiries. Contact Duncan Coutts, Ian Lynagh or Andres Löh (http://www.well-typed.com/who_we_are/) for further information, either by email or IRC. The deadline for applications is Friday 27th January 2012. == About Well-Typed Well-Typed LLP is a Haskell services company, providing consultancy services, writing bespoke applications, and offering commercial training in Haskell and related topics. -- Andres Löh, Haskell Consultant Well-Typed LLP, http://www.well-typed.com

1 0

CAV 2012: Final Call For Papers
by CAV 2012 CFP 12 Jan '12

12 Jan '12

====== 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

PhD studentship in Nottingham
by Graham Hutton 09 Jan '12

09 Jan '12

Dear all, I am currently advertising a PhD Studentship in Functional Programming at the University of Nottingham in the UK: http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI1088 If you are interested in applying yourself, please drop me a note by email. If you know of any good candidates who may be interested in applying, or there is a local mailing list for advertising such things, I'd be much obliged if you could pass on the above link. Many thanks, Graham Hutton -- Prof 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

ANN: leapseconds-announced-2012
by Bjorn Buckwalter 08 Jan '12

08 Jan '12

Dear all, The International Earth Rotation and Reference Systems Service (IERS) recently announced[1] that a positive leap second will be introduced at the end of June 2012. Consequently I have updated the leapseconds-announced library[2]. The original announcement of leapseconds-announced can be found below. Best regards, Bjorn Buckwalter [1] http://hpiers.obspm.fr/eoppc/bul/bulc/bulletinc.dat [2] http://hackage.haskell.org/package/leapseconds-announced ---------- Forwarded message ---------- From: Bjorn Buckwalter <bjorn.buckwalter(a)gmail.com> Date: Sat, Jan 17, 2009 at 13:23 Subject: ANN: leapseconds-announced-2009 To: Haskell(a)haskell.org, haskell-cafe(a)haskell.org Dear all, I'm pleased to announce the upload of the leapseconds-announced package[1] to Hackage. leapseconds-announced contains a single module and a single function implementing the Data.Time.Clock.TAI.LeapSecondTable interface (type). The documentation[2] for Data.Time.Clock.TAI.LeapSecondTable says "No table is provided, as any program compiled with it would become out of date in six months" and with that I have no objections. However, I frequently find myself needing a LeapSecondTable for a quick-and-dirty one-off analysis or simulation of the present or past. In these cases I've lazily used "(const 33)" (or more recently: "(const 34)") as my LeapSecondTable. leapseconds-announced is a pragmatic, if imperfect, improvement over my past practices. It provides a LeapSecondTable with all leap seconds announced to date (hence the name). Once the IERS announces[3] another leap second the package will need an update and all code using it a recompile. While this precludes its use in long-running production applications it is eminently adequate for my one-off uses or for applications that can afford to recompile infrequently. While, in the words of the Data.Time.Clock.TAI documentation, "most people won't need this module" I hope it can be of utility to someone. Thanks, Bjorn Buckwalter [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/leapseconds-anno… [2] http://www.haskell.org/ghc/docs/latest/html/libraries/time/Data-Time-Clock-… [3] http://hpiers.obspm.fr/eoppc/bul/bulc/bulletinc.dat

1 0

ANNOUNCE: DHD >>= UHac, April 20 - 22, Utrecht
by Sean Leather 07 Jan '12

07 Jan '12

Calling all Haskellers! To open 2012 and in celebration of the group's 3rd year of existence, the Dutch Haskell Users Group is happy to announce a new event that combines an informal conference and a hackathon. >>= >> >> >> >> >> >> >>= >>= >>= >>= *DHD >>= UHac* >>= >>= >>= >>= *April 20 - 22* >>= >>= >>= >>= *Utrecht* >>= >>= >>= >>= >> >> >> >> >> >> >>= >>= DHD >>= The Dutch HUG Day, or DHD, will be a half day of talks on anything Haskell-y or FP-ish. It will be held on Friday, April 20. >>= UHac >>= The Utrecht Hackathon, or UHac, will be a gathering of the community of enthusiastic Haskell hackers from around the world. It will start immediately following the DHD and continue to Sunday, April 22. >>= Call for Speakers >>= We are looking for speakers for the Dutch HUG Day. If you have something interesting to share, please email Sean Leather (leather(a)cs.uu.nl) See the website for more. >>= Website >>= For more information that will be continuously updated, see the event wiki page: *http://www.haskell.org/haskellwiki/DHD_UHac* Join us for a Haskell-y time in the Netherlands. We look forward to seeing you there! Sean Leather and Jurriën Stutterheim Organizers

1 0

Open PhD and PostDoc positions at Marburg University
by Klaus Ostermann 04 Jan '12

04 Jan '12

ear all, we are happy to announce that we have new openings at the PhD and PostDoc level. The Programming Language and Software Technology Group, headed by Klaus Ostermann, conducts research dedicated to developing new technologies that help to construct high-quality software in a productive way. We use and develop an exciting set of technologies involving functional, object-oriented, domain-specific and aspect-oriented programming languages, software product lines, parser technology, language-integrated queries, static and dynamic software analysis, type systems, and many other topics. For more information consult http://www.uni-marburg.de/fb12/ps/ We offer positions with a lot of freedom to choose and develop research topics, few obligations, collaboration with a very strong group of researchers, competitive salary, and opportunities to develop a strong academic career path (e.g. by founding their own junior research group). For the PostDoc positions, we expect applicants to have demonstrated scientific excellence in areas related to our own research. For PhD positions, we expect evidence of the potential for scientific excellence. Knowledge of German is not required; the communication language in our group is English. Marburg is an attractive small "student town" right in the center of Germany. We are only an hour ride away from Frankfurt Airport, which will bring you to many destinations worldwide in a single hop. To apply for a position, please send informal inquiries to Klaus Ostermann (contact data can be found on our website). We are flexible with regard to the starting date, but generally the sooner the better. We are looking forward to hearing from you. Best wishes, Klaus Ostermann on behalf of the PS group at Marburg University http://www.uni-marburg.de/fb12/ps

2 1

ANNOUNCE: IntervalMap-0.2.0
by Christoph Breitkopf 02 Jan '12

02 Jan '12

ANNOUNCE: IntervalMap-0.2.0 An implementation of maps from intervals to values. The key intervals may overlap, and the implementation supports an efficient stabbing query. It offers most of the functions in Data.Map, but Interval k instead of just k as the key type. In addition, there are functions specific to maps of intervals, for example to search for all keys containing a given point or contained in a given interval. The implementation is a red-black tree augmented with the maximum upper bound of all keys. Home page: http://www.chr-breitkopf.de/comp/IntervalMap/ Hackage: http://hackage.haskell.org/package/IntervalMap-0.2.0 This is the first release, and I'm sure that there are many holes to fix. Please don't hesitate to report even minor quibbles. Regards, Chris

1 0