April 2011 - Haskell - Haskell.org

FOPARA 2011: Last CFP and Call for Participation
by Ricardo Peña 13 Apr '11

13 Apr '11

*************************************************************************** * LAST CALL FOR PAPERS AND CALL FOR PARTICIPATION * * 2nd International Workshop on * Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** REGISTRATION IS OPEN NOW!! Submission date in few days --------------------------- Full Paper submission deadline: April 15, 2011 Notification of acceptance (for presentation): April 20, 2011 Early Registration deadline: April 25, 2011 FOPARA workshop: May 19, 2011 Submission for formal review deadline: July 8, 2011 Notification of acceptance (for LNCS): September 16, 2011 Camera ready paper: October 7th, 2011 Invited Speaker --------------- Reinhard Wilhelm (Universitat des Saarlandes) Timing Analysis and Timing Predictability I will describe our approach to compute safe and precise upper bounds on execution times for real-time programs. The required effort and the precision of the results depends strongly on the characteristics of the execution platform. Increasing the precision and reducing the effort is easy if performance is of no concern. However, the ultimate goal is to design architectures that offer a good combination of performance and predictability. I will present an overview of existing results in this research area. Scope ----- The 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) will be held at the Computer Science Faculty of Complutense University of Madrid. It will be co-located with the 12th International Symposium Trends in Functional Programming, TFP 2011 (http://dalila.sip.ucm.es/tfp11/) The workshop will serve as a forum for presenting original research results that are relevant to the analysis of resource (time, space, and others) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- FOPARA 2011 is a two-phase workshop. All participants are invited to submit a draft paper describing the work to be presented at the workshop. These submissions will be screened by the program committee chair to make sure they are within the scope of FOPARA and will appear in the draft proceedings distributed at the workshop. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the workshop, authors will be given the opportunity to incorporate the feedback from discussions at the workshop and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles that will appear in the formal proceedings. All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Computer Science Department of Complutense University of Madrid. The papers selected after the reviewing process will be published as a volume of the Springer LNCS series. Program Committee ----------------- . Puri Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/École normale supérieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tamás Kozsik (Eötvös Loránd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL) Sponsors -------- . Computer Science Faculty, Complutense University of Madrid . Spanish Ministry of Science and Innovation

1 0

ANNOUNCE: TCache 0.8
by Alberto G. Corona 13 Apr '11

13 Apr '11

Tired of your persistence layer? Take persistence the haskelll way. Besides the backward compatible stuff, TCache now defines persistent STM variables (DBRef's) that leverages the traditional haskell reference syntax to perform fast in-memory database transactions and inter-object references. It includes indexing, triggers and an straightforward pure-haskell query language based on record field relations. http://hackage.haskell.org/package/TCache-0.8.0.2 This version includes a lot of changes and must be considered beta. Please submit any bugs, comments and so on. Cheers!

1 0

CFP -- 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11)
by Alberto Pardo 12 Apr '11

12 Apr '11

CALL FOR PAPERS - SEFM 2011 The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM) 14-18 November 2011 Montevideo, Uruguay URL: http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES * Title and abstract submission deadline: 23 April 2011 * Paper submission deadline: 30 April 2011 * Acceptance/rejection notification: 15 June 2011 * Camera-ready version due: 15 July 2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. Papers that combine formal methods and software engineering are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic. These can either be normal or short papers. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Holger Hermanns, Saarland University, Germany * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Daniel Le Métayer - INRIA, France SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development" with a separate Call for Papers that can be found at http://www.fing.edu.uy/inco/eventos/SEFM2011/CFP-MSD-special-track.txt. All queries on submissions to the special track should be sent to: sefm2011-msd(a)iist.unu.edu. The special track will have as keynote speaker: * Matteo Pedercini, Millennium Institute, USA LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (Río de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. All papers must be written in English. Research and tool papers must not exceed 16 pages in the LNCS format while short papers must not exceed 8 pages in the LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). All queries on the submissions should be sent to: sefm2011(a)fing.edu.uy. Papers must be submitted electronically via the Easychair System: http://www.easychair.org/conferences/?conf=sefm11 The proceedings will be published in the Springer Lecture Notes in Computer Science series (LNCS, http://www.springer.com/lncs) After the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a special issue of the SoSyM journal (Software and Systems Modeling, Springer), following the standard reviewing process of the journal. COMMITTEES Conference Chair * Alberto Pardo, Universidad de la República, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering, Graz University of Technology, Austria * Luis Barbosa, University of Minho, Portugal * Gilles Barthe, IMDEA Software, Spain * Thomas Anung Basuki, Parahyangan Catholic University, Indonesia * Alexandre Bergel, University of Chile, Chile * Gustavo Betarte, Universidad de la República, Uruguay * Ana Cavalcanti, University of York, UK * Pedro R. D'Argenio, Univ. Nacional de Córdoba, Argentina * Van Hung Dang, Vietnam National University, Vietnam * George Eleftherakis, SEERC, Greece * José Luiz Fiadeiro, University of Leicester, UK * Martin Fränzle, Oldenburg University, Germany * Stefania Gnesi, ISTI-CNR, Italy * Rob Hierons, Brunel University, UK * Paola Inverardi, University of L'Aquila, UK * Jean-Marie Jacquet, University of Namur, Belgium * Tomasz Janowski, UNU-IIST, China * Jean-Marc Jezequel, IRISA, France * Joseph Kiniry, IT University of Copenhagen, Denmark * Paddy Krishnan, Bond University, Australia * Martin Leucker, TU Munich, Germany * Xuandong Li, Nanjing University, China * Peter Lindsay, The University of Queensland, Australia * Antónia Lopes, University of Lisbon, Portugal * Nenad Medvidovic, University of Southern California, USA * Mercedes Merayo, Universidad Complutense de Madrid, Spain * Stephan Merz, INRIA Nancy, France * Madhavan Mukund, Chennai Mathematical Institute, India * Cesar Muñoz, NASA, USA * Martín Musicante, UFRN, Brazil * Mizuhito Ogawa, JAIST, Japan * Olaf Owe, University of Oslo, Norway * Gordon Pace, University of Malta, Malta * Ernesto Pimentel, University of Málaga, Spain * Sanjiva Prasad, Indian Institute of Technology Delhi, India * Anders Ravn, Aalborg University, Denmark * Leila Ribeiro, UFRGS, Brazil * Augusto Sampaio, UFPE, Brazil * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden * Sebastian Uchitel, Imperial College London, UK, and UBA, Argentina * Willem Visser, University of Stellenbosch, South Africa * Sergio Yovine, CONICET and UBA, Argentina Organising Committee * Carlos Luna, Universidad de la República, Uruguay * Alberto Pardo, Universidad de la República, Uruguay * Luis Sierra, Universidad de la República, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR, China * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Mathai Joseph, TRDDC, Pune, India * Zhiming Liu, UNU-IIST, Macao SAR, China * Andrea Maggiolo-Schettini, Pisa University, Italy

1 0

Call for Contributions - Haskell Communities and Activities Report, May 2011 edition
by Janis Voigtländer 12 Apr '11

12 Apr '11

Dear all, I would like to collect contributions for the 20th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 May 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 November 2010 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/05-2011/template.tex There is also a LaTeX style file at http://haskell.org/communities/05-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

2nd CfP: Special journal issue on Functional and (Constraint) Logic Programming
by Santiago Escobar 11 Apr '11

11 Apr '11

Special issue of Information and Computation on Functional and (Constraint) Logic Programming <http://www.dsic.upv.es/~sescobar/flp-issue/> Scope Functional and (Constraint) Logic Programming aims at bringing together researchers interested in functional programming, (constraint) logic programming, as well as the integration of the two paradigms. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications and combinations of high-level, declarative programming languages and related areas. This special issue is devoted to contributions which aim at realizing integrations of the two classical declarative paradigms: functional programming and (constraint) logic programming. Contributions on functional programming or (constraint) logic programming are also welcome but they should discuss and effectively justify their usefulness to the integration of both paradigms. Submissions Submitted papers must be original and not submitted for journal publication elsewhere, and will be subject to the standard journal refereeing process of the Information and Computation journal. Submissions must be sent in pdf format to sescobar(a)dsic.upv.es no later than May 6th, 2011 You should use the Elsevier's latex macro package, available at http://www.elsevier.com/wps/find/authorsview.authors/elsarticle The cover page of the submission should include the paper title, the author names, the coordinates of the corresponding author, and an abstract. Guest Editors Moreno Falaschi Dipartimento di Scienze Matematiche e Informatiche Facoltà di Scienze MM.FF.NN. Università di Siena Italy. Santiago Escobar Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Camino de Vera, 14 Apdo. 22.012 E-46022 Valencia (Spain)

1 0

CFP: 8th CHR Workshop
by Jon Sneyers 11 Apr '11

11 Apr '11

Apologies if you receive multiple copies ________________________________________ Call for Papers ------------------------------------------------------------ Eighth International Workshop on Constraint Handling Rules CHR 2011 September 9, 2011 Cairo, Egypt Co-located with the Second CHR Summer School ------------------------------------------------------------ http://met.guc.edu.eg/events/chr2011/ws.html Introduction ------------ The Constraint Handling Rules (CHR) language has become a major declarative specification formalism and implementation language for constraint reasoning algorithms and applications. Algorithms are often specified using inference rules, rewrite rules, sequents, proof rules or logical axioms that can be directly written in CHR. Its clean semantics facilitates program design, analysis and transformation. See the CHR website (http://dtai.cs.kuleuven.be/CHR/) for more information. The aim of the CHR workshop series is to stimulate and promote international research and collaboration on topics related to the Constraint Handling Rules language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous CHR workshops were organized in 2004 in Ulm (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice (Italy) at ICALP, in 2007 in Porto (Portgual) at ICLP, in 2008 in Hagenberg (Austria) at RTA, in 2009 in Pasadena (California, US) at ICLP and in 2010 in Edinburgh (Scotland) at ICLP. The workshop proceedings will be published as a technical report. Topics of Interest ------------------ The workshop calls for full papers and short papers describing ongoing work on any aspect of CHR and related approaches. The following topics are relevant (this list is non-exhaustive): - (Logical) Algorithms - Applications - Comparisons with Related Approaches - Constraint Solvers - Critical Assessment - Expressivity and Complexity - Implementations and Optimization - Language Extensions (Types, Modules, ...) - Program Analysis - Program Transformation and Generation - Programming Environments (Debugging) - Programming Pearls - Programming Tools - Retractable Constraints - Semantics - System Descriptions Important Dates --------------- * Paper Registration (Abstract): June 14, 2011 * Paper Submission: June 21, 2011 * Notification of Authors: July 21, 2011 * Final version due: August 16, 2011 * Workshop date: September 9, 2011 Submission Information ---------------------- All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. They must be written in English. There are four submission categories: 1. technical papers for describing technically sound, innovative ideas that can advance the state of the art of logic programming; 2. application papers, where the emphasis will be on their impact on the application domain; 3. system and tool papers, where the emphasis will be on the novelty, practicality, usability and general availability of the systems and tools described; 4. technical communications, aimed at describing recent developments, new projects, and other materials that are not ready for main publication as standard papers. Technical papers, application papers, and system and tool papers must not exceed 15 pages including bibliography. The limit for technical communications is 10 pages. The authors are encouraged to submit their papers in Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS/LNAI home page (http://www.springeronline.com/lncs/) Submissions can be made via the Easychair submission system, available at http://www.easychair.org/conferences/?conf=chr2011. Accepted papers will be published in a technical report. Organization ------------ Program Committee: * Slim Abdennadher, German University in Cairo, Egypt * Henning Christiansen, Roskilde University, Denmark * Francois Fages, INRIA Rocquencourt, France * Thom Fruehwirth, Universitaet Ulm, Germany * Maurizio Gabbrielli, Universita di Bologna, Italy * Remy Haemmerle, Universidad Politecnica de Madrid, Spain * Eric Monfroy, Universite de Nantes, France * Paolo Pilozzi, K.U.Leuven, Belgium * Jon Sneyers, K.U.Leuven, Belgium (chair) * Peter J. Stuckey, NICTA Victoria Laboratory, Australia * Armin Wolf, Fraunhofer FIRST, Germany Workshop Coordinator: * Jon Sneyers, K.U.Leuven (Belgium) Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

1 0

Call for papers DTP'11
by Wouter Swierstra 11 Apr '11

11 Apr '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 2911: DTP workshop * Program Committee * Ana Bove, Chalmers, Sweden Matthieu Sozeau, INRIA, France Wouter Swierstra, Radboud University, The Netherlands

1 0

ANNOUNCE: silently-1.1.1 (api changes and fewer temp files)
by Trystan Spangler 11 Apr '11

11 Apr '11

Silently, a package to prevent or capture output to handles, has undergone some api changes for version 1.1.1. silently and hSilently have been renamed to silence and hSilence. hSilence and hCapture now take a list of handles instead of just one. silence :: IO a -> IO a hSilence :: [Handle] -> IO a -> IO a capture :: IO a -> IO (String, a) hCapture :: [Handle] -> IO a -> IO (String, a) The 'capture' and 'hCapture' functions still use temp files behind the scenes. The 'silence' and 'hSilence' functions will write to the NUL device on Windows, to /dev/null on OSX and Linux, and use a temp file on other operating systems. Any temp files will be created in the temp folder if your system has one or the current directory if not. http://hackage.haskell.org/package/silently https://github.com/trystan/silently Another big thanks to everyone who had comments and suggestions, Trystan Spangler As an example, the program import System.IO.Silently main = do putStr "putStrLn: " >> putStrLn "puppies!" putStr "silenced: " >> silence (putStrLn "kittens!") putStrLn "" (captured, result) <- capture (putStr "wookies!" >> return 123) putStr "captured: " >> putStrLn captured putStr "returned: " >> putStrLn (show result) will print putStrLn: puppies! silenced: captured: wookies! returned: 123

1 0

CFP -- Haskell Symposium 2011
by Haskell Symposium 10 Apr '11

10 Apr '11

"Haskell 2011" ACM SIGPLAN Haskell Symposium 2011 Tokyo, Japan 22nd September, 2011 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2011/ The ACM SIGPLAN Haskell Symposium 2011 will be co-located with the 2011 International Conference on Functional Programming (ICFP), in Tokyo, Japan. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Practice and Experience, general experience with Haskell in education and industry. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Submission Details * Submission Deadline: Monday, 6th June 2011 * Author Notification: Friday, 1st July 2011 * Final Papers Due : Sunday, 10th July 2011 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm) The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2011, the 2011 Haskell Symposium web page. * http://www.icfpconference.org/icfp2011, the ICFP 2011 web page. Programme Committee * Koen Claessen, Chalmers University of Technology (chair) * Conal Elliott, LambdaPix * Andy Gill, University of Kansas * Ralf Hinze, Oxford University * Graham Hutton, University of Nottingham * John Launchbury, Galois, Inc. * Sam Lindley, University of Edinburgh * Rita Loogen, Philipps-Universität Marburg * Neil Mitchell, Standard Chartered * Matthew Naylor, University of York * Bruno Oliveira, Seoul National University * Dimitrios Vytiniotis, Microsoft Research * Steve Zdancewic, University of Pennsylvania

1 0

ANNOUNCE: normaldistribution-1.0 – Minimum fuss normally distributed random values.
by Bjorn Buckwalter 09 Apr '11

09 Apr '11

Dear all, I'm pleased to announce the immediate availability of the normaldistribution library on hackage: http://hackage.haskell.org/package/normaldistribution This purpose of this library is to have a simple API and no dependencies beyond Haskell 98 in order to let you produce normally distributed random values with a minimum of fuss. This library does not attempt to be blazingly fast nor to pass stringent tests of randomness. It attempts to be very easy to install and use while being "good enough" for many applications (simulations, games, etc.). The API builds upon and is largely analogous to that of the Haskell 98 Random module (more recently System.Random). Pure: > (sample,g) = normal myRandomGen -- using a Random.RandomGen > samples = normals myRandomGen -- infinite list > samples2 = mkNormals 10831452 -- infinite list using a seed In the IO monad: > sample <- normalIO > samples <- normalsIO -- infinite list With custom mean and standard deviation: > (sample,g) = normal' (mean,sigma) myRandomGen > samples = normals' (mean,sigma) myRandomGen > samples2 = mkNormals' (mean,sigma) 10831452 > sample <- normalIO' (mean,sigma) > samples <- normalsIO' (mean,sigma) Internally the library uses the Central Limit Theorem to approximate normally distributed values from multiple uniformly distributed random values. Enjoy, Bjorn

1 0