December 2010 - Haskell

[haskell] EXTENDED DEADLINE : ICECCS 2011
by Isabelle Perseil 02 Dec '10

02 Dec '10

********************************************************************** CALL FOR PAPERS: ICECCS 2011 http://www.iceccs.org/2011 16th Annual IEEE International Conference on the Engineering of Complex Computer Systems (ICECCS) sponsored by the IEEE Technical Committee on Complexity in Computing (TCCX) April 27th-29th, 2011 Las Vegas, NV, USA ************************************************************************ Extended Submission deadline: December 15th, 2010 -------------------------------------------------- The success of key human activities ranging from research and business to everyday services relies on the use of ever more sophisticated, feature-rich and complex computer systems. These complex computer systems are regularly required to accomplish more, faster and on a broader scale, to adapt dynamically to changing workloads, scenarios and objectives, and to achieve guaranteed levels of performance and dependability. Satisfying such demanding requirements in the presence of the variability, heterogeneity and non-linear behaviour that characterise complex computer systems poses numerous challenges to both their developers and their users. The aim of the conference is to bring together researchers, practitioners and leading experts from academia and industry, to advance the state of the art in the specification, development, validation and verification, and management of complex computer systems. Scope and topics: ================ Authors are invited to submit papers describing original, unpublished research results, case studies and tools. Additionally, submissions of poster papers are sought for two separate poster sessions: an "ongoing research" poster session, and a "PhD research" poster session. Topics of interest include but are not limited to the following aspects of complex computer systems: - Requirement specification and analysis - Verification and validation - Model-driven development - Reverse engineering and refactoring - Design by contract - Agile methods - Safety-critical & fault-tolerant architectures - Adaptive, self-managing and multi-agent systems - Real-time, hybrid and embedded systems - Systems of systems - Tools and tool integration - Industrial case studies Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic, and culminate with panels to discuss relationships between industrial and academic research. Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedin Submission of Papers: ==================== Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. See the submission guidelines on the conference web site. Important Dates: ================ Submission of titles and abstracts ASAP Submission of all papers 15 December, 2010 Notification of acceptance 10 January, 2011 Camera-ready material for publication 31 January, 2011 Registration deadline for authors 10 February, 2011 Early registration deadline for non-authors 22 February, 2011 General Chair: ============== Roy Sterritt, University of Ulster, Northern Ireland Program Chairs: =============== Karin Breitman, Pontificia Universidade Catolica do Rio de Janeiro, Brazil Isabelle Perseil, Inserm, France Program Committee: ================== Mithun Acharya, ABB Corporate Research, United States Marc Aiguier, Ecole Centrale Paris, France Yamine AitAmeur, LISI/ENSMA, France Luis Almeida, Fac. de Eng. da Universidade do Porto, Portugal Keijiro Araki, Kyushu University, Japan Luciano Baresi, DEI - Politecnico di Milano, Italy Yolande Berbers, Katholieke Universiteit Leuven, Belgium Gilles Bernot, University of Nice Sophia Antipolis, France Jürgen Börstler, Blekinge Institute of Technology, Sweden Jonathan P. Bowen, London South Bank University, United Kingdom Karin Breitman, PUC-Rio, Brazil Phil Brooke, University of Teesside, United Kingdom Jean-Michel Bruel, IRIT, France Michael Butler, University of Southampton, United Kingdom Jordi Cabot, INRIA-École des Mines de Nantes, France Radu Calinescu, Aston University, United Kingdom Antonio Cerone, International Institute for Software Technology United Nations University, Macau SAR China Corina Cirstea, University of Southampton, United Kingdom Patrick Cousot, New York University and École normale supérieure, France Jim Davies, University of Oxford, United Kingdom Juan deLara, Universidad Autónoma de Madrid, Spain Mieso Denko, UoG, Canada Felicita Di Giandomenico, ISTI-CNR, Italy Simon Dobson, University of St Andrews, United Kingdom Gilles Dowek, Laboratoire d'Informatique(LIX), École Polytechnique and INRIA, France Kerstin Eder, University of Bristol, United Kingdom Huascar Espinoza, ESI Tecnalia, Spain François Fages, INRIA, France Hector Figueiredo, BAE Systems, United Kingdom Franck Fleurey, SINTEF, Norway Robert France, Colorado State University, United States Leo Freitas, University of York, UK Carlo Alberto Furia, ETH Zurich, Switzerland Jean-Louis Giavitto, CNRS and University of Evry, France Mark Grechanik, Accenture Labs, United States Lindsay Groves, Victoria University of Wellington, New Zealand Esther Guerra, Universidad Autónoma de Madrid, Spain Gaétan Hains, Univeristy Paris Est, France Shinji Kikuchi, Fujitsu Laboratories, Japan Joseph Kiniry, IT University of Copenhagen, Denmark Fabrice Kordon, Univ. Paris 6, France Daniel Krob, Laboratoire d'Informatique(LIX), École Polytechnique and CNRS, France Ralf Laemmel, Universität Koblenz-Landau, Germany Phillip Laplante, Penn State University, United States Kung-Kiu Lau, The University of Manchester, United Kingdom Zhiming Liu, International Institute for Software Technology United Nations University,Macau SAR China Gerald Luettgen, University of Bamberg, Germany Tom Maibaum, McMaster University, Canada Tiziana Margaria, Potsdam University, Germany Julie McCann, Imperial College, United Kingdom Paul Mckee, BT Innovate and Design, United Kingdom Raffaela Mirandola, Politecnico di Milano, Italy Andrea Omicini, Università di Bologna, Italy Richard Paige, University of York, United Kingdom Laurent Pautet, Telecom ParisTech, France Isabelle Perseil, Inserm, France Robert Pettit, The Aerospace Corporation, United States Ivan Porres, Åbo Akademi University, Finland Awais Rashid, Lancaster University, United Kingdom Bernhard Rumpe, RWTH Aachen University, Germany Ricardo Sanz, Universidad Politecnica de Madrid, Spain Douglas Schmidt, Vanderbilt University, United States Cristina Seceleanu, Mälardalen University, Sweden Janet Smart, University of Oxford, United Kingdom Oleg Sokolsky, University of Pennsylvania, United States Ian Sommerville, St Andrews University, United Kingdom Jörn Guy Süß, ITEE, The University of Queensland, Australia Volker Stolz, United Nations University (UNU-IIST), Macau SAR China Jing Sun, The University of Auckland, New Zealand Clemens Szyperski, Microsoft Research, United States Kenji Taguchi, National Institute of Informatics, Japan Dalila Tamzalit, University of Nantes, France Bedir Tekinerdogan, Bilkent University, Turkey Suresh Thummalapenta, NC State University, United States Antonio Vallecillo, University of Malaga, Spain Tullio Vardanega, University of Padua, Italy Emil Vassev, Lero, Ireland Huibiao Zhu, East China Normal University, China Steffen Zschaler, King's College London, United Kingdom

1 0

Second CFP: Term and Graph Rewriting/TERMGRAPH 2011/ETAPS 2011
by Rachid Echahed 02 Dec '10

02 Dec '10

Apologies for multiple copies ------------------------------------------------------------------------- Second CALL FOR PAPERS TERMGRAPH 2011 6th International Workshop on Computing with Terms and Graphs a Satellite Event of ETAPS 2011 Saarbrücken, Germany, April 2nd, 2011 http://termgraph2011.imag.fr http://www.termgraph.org.uk/ Full versions of best papers will be included in an issue of the international journal Mathematical Structures in Computer Science (MSCS) -------------------------------------------------------------------------- Important Dates December 8, 2010 Abstract submission December 15, 2010 Paper submission January 16, 2011 Notification of acceptance February 4, 2011 Pre-proceedings version due -------------------------------------------------------------------------- TERMGRAPH 2011 is a one-day satellite event of ETAPS 2011 <http://www.etaps.org/>, which will take place in Saarbrücken, Germany, from March 26 to April 3rd, 2011. Previous editions of the TERMGRAPH workshops series (http://www.termgraph.org.uk/) took place in Barcelona (2002), in Rome (2004), in Vienna (2006), in Braga (2007) and in York (2009). Aims and scope Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, for instance : the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages: many implementations of functional, logic, object-oriented, concurrent and mobile calculi are based on term graphs. Term graphs are also used in automated theorem proving and symbolic computation systems working on shared structures. The aim of this workshop is to bring together researchers working in different domains on term and graph transformation and to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in term graph rewriting. -------------------------------------------------------------------------- Topics of Interest Topics of interest are open and include all aspects of term graphs and sharing of common subexpressions in rewriting, programming, automated reasoning and symbolic computation. This includes (but is not limited to): term rewriting, graph transformation, programming languages, models of computation, graph-based languages, semantics and implementation of programming languages, compiler construction, pattern recognition, databases, bioinformatics, and system descriptions. -------------------------------------------------------------------------- Submissions and Publication Authors are invited to submit either regular papers (up to 15 pages), or position papers, system descriptions, work in progress, extended abstracts (5-7 pages), via the EasyChair system, at URL http://www.easychair.org/conferences/?conf=termgraph2011 Submissions should be in PostScript or PDF format, using the EPTCS style files (http://style.eptcs.org/) The Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS). Selected authors will be invited to submit a full version of their papers after the workshop. These submissions will pass through a second round of reviewing and accepted contributions are to be included in a special issue of the international journal Mathematical Structures in Computer Science (MSCS). -------------------------------------------------------------------------- Programme Committee Paolo Baldan, University of Padova, Italy Andrea Corradini, University of Pisa, Italy Frank Drewes, Umea University, Sweden Rachid Echahed (chair), CNRS, LIG Laboratory, France Tetsuo Ida, University of Tsukuba, Japan Wolfram Kahl, McMaster University, Canada Ian Mackie, Ecole Polytechnique, France Detlef Plump, University of York, UK -------------------------------------------------------------------------- Contact Rachid Echahed, LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 0

Haskell Weekly News: Issue 160 - December 1, 2010
by Daniel Santa Cruz 02 Dec '10

02 Dec '10

Welcome to issue 160 of the HWN, a newsletter covering developments in the [1]Haskell community in the week of November 21 - 27. My apologies for proving a much shorter version of the weekly news this time around. I'm really short on time this week, but decided to send this abbreviated version rather than skipping it. Hope to resume full coverage next week. Cheers! Top Reddit Stories * Lisk - Lisp and Haskell Domain: chrisdone.com Score: 70, Comments: 83 On Reddit: http://www.reddit.com/r/haskell/comments/ec0kp/lisk_lisp_and_haskell/ Original: http://chrisdone.com/posts/2010-11-25-lisk-lisp-haskell.html * lazycatmanatee is building a enormous suite of graphical, desktop apps in Haskell. Here's the screenshot feed Domain: flickr.com Score: 58, Comments: 11 On Reddit: http://www.reddit.com/r/haskell/comments/eb5kd/lazycatmanatee_is_building_a… Original: http://www.flickr.com/photos/48809572@N02/ * Category theory for Haskell programmers Domain: geoffhulette.wordpress.com Score: 49, Comments: 7 On Reddit: http://www.reddit.com/r/haskell/comments/eatd6/category_theory_for_haskell_… Original: http://geoffhulette.wordpress.com/2010/11/22/category-theory-for-haskell-pr… * Duck typing in Haskell Domain: chrisdone.com Score: 45, Comments: 10 On Reddit: http://www.reddit.com/r/haskell/comments/ea99a/duck_typing_in_haskell/ Original: http://chrisdone.com/posts/2010-11-22-duck-typing-in-haskell.html * GHC 7 I/O manager status update: bugs fixed, performance improved, plans afoot! Domain: serpentine.com Score: 41, Comments: 0 On Reddit: http://www.reddit.com/r/haskell/comments/ecls3/ghc_7_io_manager_status_upda… Original: http://www.serpentine.com/blog/2010/11/27/ghc-7-io-manager-status/ * And here I thought they were using Haskell... Domain: i.imgur.com Score: 34, Comments: 11 On Reddit: http://www.reddit.com/r/haskell/comments/ebgnj/and_here_i_thought_they_were… Original: http://i.imgur.com/ApzhX.png * Fun with monad comprehensions Domain: blog.n-sch.de Score: 33, Comments: 9 On Reddit: http://www.reddit.com/r/haskell/comments/ecu0w/fun_with_monad_comprehension… Original: http://blog.n-sch.de/2010/11/27/fun-with-monad-comprehensions/ * The 'text' package has been accepted into the Haskell Platform! Domain: self.haskell Score: 31, Comments: 20 On Reddit: http://www.reddit.com/r/haskell/comments/eb7fd/the_text_package_has_been_ac… Original: /r/haskell/comments/eb7fd/the_text_package_has_been_accepted_into_the/ * Yesod 0.6.3 Released Domain: docs.yesodweb.com Score: 24, Comments: 1 On Reddit: http://www.reddit.com/r/haskell/comments/e9jfd/yesod_063_released/ Original: http://docs.yesodweb.com/blog/yesod-0-6-3/ * how subtraction works for combinatorial species Domain: byorgey.wordpress.com Score: 24, Comments: 2 On Reddit: http://www.reddit.com/r/haskell/comments/ec5mx/how_subtraction_works_for_co… Original: http://byorgey.wordpress.com/2010/11/24/species-subtraction-made-simple/ Top StackOverflow Questions * Avoiding namespace pollution in Haskell votes: 14, answers: 3 http://stackoverflow.com/questions/4260507/avoiding-namespace-pollution-in-… * Keeping State in a Stateless world votes: 7, answers: 2 http://stackoverflow.com/questions/4259800/keeping-state-in-a-stateless-wor… * Updating a Big State Fast in Haskell votes: 7, answers: 2 http://stackoverflow.com/questions/4265660/updating-a-big-state-fast-in-has… * What is the most efficient purely functional algorithm for generating all prefixes of a list? votes: 7, answers: 2 http://stackoverflow.com/questions/4290370/what-is-the-most-efficient-purel… * How can I make a graphical command line in haskell/gtk2hs? votes: 6, answers: 2 http://stackoverflow.com/questions/4281984/how-can-i-make-a-graphical-comma… * Point-free form versus style votes: 5, answers: 3 http://stackoverflow.com/questions/4235741/point-free-form-versus-style * How to catch (and ignore) a call to the error function? votes: 4, answers: 2 http://stackoverflow.com/questions/4243117/how-to-catch-and-ignore-a-call-t… * Persistent console history in ghci votes: 4, answers: 1 http://stackoverflow.com/questions/4249351/persistent-console-history-in-gh… * Common Lisp equivalent to Haskell's main function? votes: 4, answers: 2 http://stackoverflow.com/questions/4285718/common-lisp-equivalent-to-haskel… * How can I write a MST algorithm (Prim or Kruskal) in Haskell? votes: 4, answers: 3 http://stackoverflow.com/questions/4290163/how-can-i-write-a-mst-algorithm-… About the Haskell Weekly News New editions are posted to [2]the Haskell mailing list as well as to [3]the Haskell Sequence and [4]Planet Haskell. [5]RSS is also available, and headlines appear on [6]haskell.org. To help create new editions of this newsletter, please send stories to dstcruz * at * gmail * dot * com. The code used to produce this version of the newsletter is not yet publicly available, as it is a complete hack designed to get things started again. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://www.haskell.org/mailman/listinfo/haskell 3. http://sequence.complete.org/ 4. http://planet.haskell.org/ 5. http://sequence.complete.org/node/feed 6. http://haskell.org/

1 0