February 2013 - Haskell

CfP: (NEW!) Workshop Haskell and Rewriting Techniques HART 2013
by Johannes Waldmann 17 Feb '13

17 Feb '13

Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations. There are strong connections between Haskell programming and rewriting. Therefore, we announce a new workshop, International Workshop on Haskell And Rewriting Techniques (HART 2013) http://www.imn.htwk-leipzig.de/HART2013/ to be held on June 27, in conjunction with RDP 2013, in Eindhoven. (RDP contains RTA, the main rewriting conference.) We plan a half day of discussions, in an informal setting, on how Haskell and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example, equational reasoning and other rewriting techniques for program verification and analysis; lambda calculi and type systems for functional programs and higher order rewriting systems; rewriting of type expressions in the type checker; rewriting of programs by refactoring tools, optimizers, code generators; execution of programs as a form of graph rewriting; template Haskell, introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. When in doubt, contact a member of the PC. Program committee: Alcino Cunha (U Minho) Jürgen Giesl (RWTH Aachen) Andy Gill (U of Kansas) Johan Jeuring (U Utrecht) Keisuke Nakano (UEC Tokyo) Kristoffer H Rose (IBM Watson) (co-chair) Christian Sternagel (JAIST) Janis Voigtländer (U Bonn) Johannes Waldmann (HTWK Leipzig) (co-chair) Dates: May 6: deadline for submissions May 20: notification of acceptance June 27: workshop Submission and Proceedings: Two categories of submissions are invited: Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. Presentation-only papers. Describing work recently published or submitted. Will not be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is handled through the EasyChair HART2013 page, https://www.easychair.org/conferences/?conf=hart2013 In line with the informal style of the workshop, the reviewing of submissions will be light. When accepting and scheduling presentations, preference will be given to original research. Proceedings will be made available electronically at the workshop.

1 0

A Ph.D. Student’s CRY for Help
by Rasheed Khan 16 Feb '13

16 Feb '13

A Ph.D. Student’s CRY for Help To: Prof. Hamid Arabnia, WORLDCOMP Coordinator, Professor of Computer Science, University of Georgia, USA Prof. Hamid Arabnia, I am a student from Africa and I am in the final stages of my Ph.D. work. I have a journal paper in ACM and a conference paper in WORLDCOMP. As per my university policy, I am required to have at least two research papers in peer-reviewed (refereed) international conferences or journals before I submit my synopsis/dissertation. While everything was fine, recently, WORLDCOMP was declared as a bogus conference with evidences and endorsements from scientists: https://sites.google.com/site/worlddump1 Also see http://worldcomp-fake-bogus.blogspot.com Now, my university officials have stopped me from submitting the dissertation stating that WORLDCOMP is not peer-reviewed due to the evidences in these websites. They said that WORLDCOMP is completely fake and that’s why you have not responded to the open challenge at https://sites.google.com/site/dumpconf or https://sites.google.com/site/moneycomp1 I sent many emails to you requesting to respond to the open challenge and prove that WORLDCOMP is not fake so that I can show your response to my university officials and convince them and submit my dissertation. I also asked you to email me the reviews for my paper (I never received them, although your acceptance email stated that the paper was reviewed by two experts) but you are not responding. Recall that when I met you in WORLDCOMP, you offered me a reference letter and invited me to organize a session in the next conference and promised free registration for my next paper if I get at least five registered papers from others. Now I am shocked with your silence. I am clueless on what to do as I will forfeit my student status unless I submit the dissertation soon. I am facing humiliation here. I was attracted by the keynote speakers, sponsors, tutorials, and University of Georgia name at WORLDCOMP website. Now I feel that I made a very critical mistake by submitting to WORLDCOMP. As the last resort, I am posting to this mailing list/forum (where WORLDCOMP details were published in the past I think) so that you understand the seriousness. I once again ask you to provide a detailed response at WORLDCOMP’s website and prove that it is not a fake (and also email me my paper reviews). I request you to focus on this issue than organizing the next conference (and create more victims like me). I hope you still have moral values. My elderly parents are dependent on me and I am crying for help. I openly beg your response! Respectfully, Saidi (this is my nickname and I am using it to avoid further humiliation. I know that you will easily identify me from this nickname and from my background mentioned above). To the forum/list owner: please understand my situation and publish this message and it will help other researchers to be more careful while choosing a conference. To the members: please help me getting a response from Prof. Arabnia. NOTE: ___________________________________________________________ This letter has been delivered unencrypted. We would like to remind you that full end-to-end protection of email correspondence is only provided if both sender and recipient are Secure Mail users. To register FREE at Secure Mail, please visit our site: http://www.s-mail.com

1 0

Silent error
by miphis＠meta.ua 16 Feb '13

16 Feb '13

The program looks like this: --*********************** factorial :: Int->Int factorial n = product [1..n] main = do print $ factorial 50 --*********************** And that yields "0" (no errors). Is it a bug or feature? :) ______________________________ Акция! Скидка до - 50% на колготы зимних коллекций в Линии магазинов EVA! http://go.meta.ua/eva_colgotes

4 3

ANN: rss2irc-1.0, announces RSS/Atom feed updates to IRC
by Simon Michael 15 Feb '13

15 Feb '13

I'm pleased to announce a new release of rss2irc, the software behind hackagebot on #haskell. rss2irc is an IRC bot that polls an RSS or Atom feed and announces updates to an IRC channel, with options for customizing output and behavior. It aims to be an easy-to-use, reliable, well-behaved bot. Release notes: 1.0 (2013/2/15) New: * more robust item detection and duplicate announcement protection, with simpler options * easier irc address syntax, drop -p/--port option * can poll urls with semicolon parameter separator (eg darcsweb's) * can poll https feeds * can poll from stdin (-) * can poll a file containing multiple copies of a feed (eg for testing) * can announce item urls containing percent * `--cache-control` option sets a HTTP Cache-Control header * `--use-actions` announces with CTCP ACTIONs (like the /me command) Fixed: * updated for GHC 7.6 & current libs * initialises http properly on microsoft windows * builds threaded and optimised by default * thread and error handling is more robust, eg don't ignore exceptions in the irc writer thread * no longer adds stray "upload:" to IRC messages * renamed --dupe-descriptions to `--allow-duplicates` * dropped --debug flag * new item detection and announcing is more robust * announcements on console are clearer * a simulated irc connection is not logged unless --debug-irc is used Best, -Simon

1 0

ANNOUNCE: graphviz-2999.16.0.0
by Ivan Lazar Miljenovic 14 Feb '13

14 Feb '13

I'm pleased to announce that I've finally tracked down all the pesky little bugs that prevented me from releasing version 2999.16.0.0 of my graphviz library, that helps you use the Graphviz suite of tools to visualise graphs. The important changes are: * Add support for Graphviz-2.30.0: - New attributes: + `Area` + `Head_LP` + `LayerListSep` + `LayerSelect` + `Tail_LP` + `XLP` - `BgColor`, `Color` and `FillColor` now take a list of colors with optional weightings. - Layer handling now supports layer sub-ranges. - Added the voronoi-based option to `Overlap`. - Added the `Striped` and `Wedged` styles. * Updates to attributes and their values: - The following attributes have had their values changed to better reflect what they represent: + `FontPath` takes a `Path` value. + `Layout` takes a `GraphvizCommand` (and thus `GraphvizCommand` has been moved to `Data.GraphViz.Attributes.Complete`). - Added `MDS` to `Model` (which had somehow been overlooked). - Various attributes now have defaults added/updated/removed if wrong. - Removed the following deprecated attributes: + `ShapeFile` + `Z` * Now any value that has a defined default can be parsed when the Dot code just has `attribute=""` (which `dot -Tcanon` is fond of doing to "reset" attributes). * `GraphvizCommand` now defines `Sfdp` (which had somehow been overlooked up till now). * The `canonicalise` and related functions have been re-written; whilst there might be some cases where their behaviour does not fully match how `dot -Tcanon` and `tred` behave (due to the interaction of various attributes), the new implementation is much more sane. * Use temporary files rather than pipes when running dot, etc. Makes it more portable, and also avoids issues where dot, etc. use 100% CPU when a graph is passed in via stdin. Original patch by Henning Thielemann. -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

1 0

Haskell Weekly News: Issue 258
by Daniel Santa Cruz 14 Feb '13

14 Feb '13

Welcome to issue 258 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of February 03 to 09, 2013. Quotes of the Week * shachaf: The trouble with the lens rabbit hole is that there are a few of us here at the bottom, digging. * monochrom: "a monad is like drinking water from a bottle without human mouth touching bottle mouth" Top Reddit Stories * GHCi 7.4.2 is finally working on ARM Domain: luzhuomi.blogspot.com, Score: 49, Comments: 15 On Reddit: [1] http://goo.gl/yBh9o Original: [2] http://goo.gl/Kgx9R * Implementation of a Java Just In Time Compiler in Haskell Domain: blog.wien.tomnetworks.com, Score: 41, Comments: 15 On Reddit: [3] http://goo.gl/BjpX3 Original: [4] http://goo.gl/f1Qrh * I/O is pure Domain: chris-taylor.github.com, Score: 32, Comments: 41 On Reddit: [5] http://goo.gl/pYMXz Original: [6] http://goo.gl/9xeKd * Introduction to Haskell, Lecture 4 is Live (Pattern matching and Guards) Domain: shuklan.com, Score: 28, Comments: 7 On Reddit: [7] http://goo.gl/wvFO6 Original: [8] http://goo.gl/sKF5C * What makes comonads important? Domain: self.haskell, Score: 20, Comments: 41 On Reddit: [9] http://goo.gl/CqS7Z Original: [10] http://goo.gl/CqS7Z * OdHac, the Haskell Hackathon in Odessa Domain: haskell.org, Score: 18, Comments: 2 On Reddit: [11] http://goo.gl/ZumYI Original: [12] http://goo.gl/Pfuaq * NYC Haskell Meetup Video: Building a Link Shortener with Haskell and Snap Domain: vimeo.com, Score: 18, Comments: 3 On Reddit: [13] http://goo.gl/j42PG Original: [14] http://goo.gl/RRgsl * Evaluation-State Assertions in Haskell Domain: joachim-breitner.de, Score: 18, Comments: 6 On Reddit: [15] http://goo.gl/lMMT1 Original: [16] http://goo.gl/7eLI5 * A post about computational classical type theory Domain: queuea9.wordpress.com, Score: 17, Comments: 14 On Reddit: [17] http://goo.gl/r8DOO Original: [18] http://goo.gl/UIxIY * parellella has a forum board for haskell. anyone working in this direction? Domain: forums.parallella.org, Score: 13, Comments: 5 On Reddit: [19] http://goo.gl/BSfRd Original: [20] http://goo.gl/qLnG0 * Haskell Lectures - University of Virginia (Nishant Shukla) Domain: shuklan.com, Score: 13, Comments: 3 On Reddit: [21] http://goo.gl/CxTPI Original: [22] http://goo.gl/JkhXz * NYC Haskell Meetup Video: Coding and Reasoning with Purity, Strong Types and Monads Domain: vimeo.com, Score: 13, Comments: 2 On Reddit: [23] http://goo.gl/MmGZb Original: [24] http://goo.gl/Vj63w * Introducing fixed-points via Haskell Domain: apfelmus.nfshost.com, Score: 9, Comments: 34 On Reddit: [25] http://goo.gl/UuCc1 Original: [26] http://goo.gl/SCVJc Top StackOverflow Questions * Is spoon unsafe in Haskell? votes: 19, answers: 2 Read on SO: [27] http://goo.gl/6RDku * What general structure does this type have? votes: 17, answers: 4 Read on SO: [28] http://goo.gl/2GV0V * Why aren't Nums Ords in Haskell? votes: 14, answers: 2 Read on SO: [29] http://goo.gl/8Hrkn * Why does cabal install reinstall packages already in .cabal/lib votes: 12, answers: 1 Read on SO: [30] http://goo.gl/yMXCh * Free Monad of a Monad votes: 12, answers: 2 Read on SO: [31] http://goo.gl/kpV2q * Haskell pattern match “diverge” and ⊥ votes: 11, answers: 2 Read on SO: [32] http://goo.gl/VeRUJ * How can one make a private copy of Hackage votes: 11, answers: 2 Read on SO: [33] http://goo.gl/ZNAwL * Recursion Schemes in Agda votes: 9, answers: 1 Read on SO: [34] http://goo.gl/xtmqr Until next time, +Daniel Santa Cruz References 1. http://luzhuomi.blogspot.com/2013/02/ghci-742-is-finally-working-on-arm.html 2. http://www.reddit.com/r/haskell/comments/17zxgj/ghci_742_is_finally_working… 3. http://blog.wien.tomnetworks.com/2013/02/06/thesis/ 4. http://www.reddit.com/r/haskell/comments/17zqgr/implementation_of_a_java_ju… 5. http://chris-taylor.github.com/ 6. http://www.reddit.com/r/haskell/comments/1874at/io_is_pure/ 7. http://shuklan.com/haskell/lec04.html 8. http://www.reddit.com/r/haskell/comments/17y18q/introduction_to_haskell_lec… 9. http://www.reddit.com/r/haskell/comments/185k0s/what_makes_comonads_importa… 10. http://www.reddit.com/r/haskell/comments/185k0s/what_makes_comonads_importa… 11. http://www.haskell.org/pipermail/haskell-cafe/2013-February/106216.html 12. http://www.reddit.com/r/haskell/comments/17xxyf/odhac_the_haskell_hackathon… 13. http://vimeo.com/59109358 14. http://www.reddit.com/r/haskell/comments/185la5/nyc_haskell_meetup_video_bu… 15. https://www.joachim-breitner.de/blog/archives/590-Evaluation-State-Assertio… 16. http://www.reddit.com/r/haskell/comments/1870oe/evaluationstate_assertions_… 17. http://queuea9.wordpress.com/2012/11/05/canonize-this/ 18. http://www.reddit.com/r/haskell/comments/180uqv/a_post_about_computational_… 19. http://forums.parallella.org/viewforum.php?f=21 20. http://www.reddit.com/r/haskell/comments/180muq/parellella_has_a_forum_boar… 21. http://shuklan.com/haskell/index.html 22. http://www.reddit.com/r/haskell/comments/184r9v/haskell_lectures_university… 23. http://vimeo.com/59215336 24. http://www.reddit.com/r/haskell/comments/185li3/nyc_haskell_meetup_video_co… 25. http://apfelmus.nfshost.com/blog/2010/07/02-fixed-points-video/player.html 26. http://www.reddit.com/r/haskell/comments/186bi1/introducing_fixedpoints_via… 27. http://stackoverflow.com/questions/14710928/is-spoon-unsafe-in-haskell 28. http://stackoverflow.com/questions/14715811/what-general-structure-does-thi… 29. http://stackoverflow.com/questions/14690608/why-arent-nums-ords-in-haskell 30. http://stackoverflow.com/questions/14699269/why-does-cabal-install-reinstal… 31. http://stackoverflow.com/questions/14740213/free-monad-of-a-monad 32. http://stackoverflow.com/questions/14698414/haskell-pattern-match-diverge-a… 33. http://stackoverflow.com/questions/14758423/how-can-one-make-a-private-copy… 34. http://stackoverflow.com/questions/14699334/recursion-schemes-in-agda 35. https://plus.google.com/105107667630152149014/about

1 0

Call for Papers (ICFEM 2013)
by Huibiao Zhu 13 Feb '13

13 Feb '13

ICFEM 2013 CALL FOR PAPERS 15th International Conference on Formal Engineering Methods (ICFEM 2013) Queenstown, New Zealand, 29 October - 1 November 2013 http://www.cs.auckland.ac.nz/icfem2013/ The 15th International Conference on Formal Engineering Methods (ICFEM 2013) will be held at the Crowne Plaza Hotel in Queenstown, New Zealand from 29 October to 1 November 2013. Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2013 is organized and sponsored by The University of Auckland and will be held in the world renowned travel destination - Queenstown. Around 1.9 million visitors are drawn to Queenstown each year to enjoy their own unforgettable travel experience. We are looking forward to your submissions and participation. SCOPE AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered. + Abstraction and refinement + Formal specification and modeling + Program analysis + Software verification + Software model checking + Formal approaches to software testing + Formal methods for self-adaptive systems + Formal methods for object and component systems + Formal methods for concurrent and real-time systems + Formal methods for cloud computing and cyber-physical systems + Formal methods for software safety, security, reliability and dependability + Tool development, integration and experiments involving verified systems + Formal methods used in certifying products under international standards + Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be made through the ICFEM 2013 submission page (https://www.easychair.org/conferences/?conf=icfem2013) handled by the EasyChair conference management system. IMPORTANT DATES Abstract Submissions Due: 15 April 2013 Full Paper Submissions Due: 22 April 2013 Acceptance Notification: 18 June 2013 Camera-ready Papers Due: 15 July 2013 ORGANIZING COMMITTEE General Co-Chairs Jin Song Dong, National University of Singapore, Singapore. Ian Hayes, The University of Queensland, Australia. Steve Reeves, The University of Waikato, New Zealand. Program Committee Co-Chairs Lindsay Groves, Victoria University of Wellington, New Zealand. Jing Sun, The University of Auckland, New Zealand. Workshop and Tutorial Co-Chairs Yang Liu, Nanyang Technological University, Singapore. Jun Sun, Singapore University of Technology and Design, Singapore. Local Organization Chair Gillian Dobbie, The University of Auckland, New Zealand. Publicity Co-Chairs Jonathan Bowen, London South Bank University & Chairman, Museophile Limited, United Kingdom. Huibiao Zhu, East China Normal University, China. PROGRAM COMMITTEE Bernhard K. Aichernig, Graz University of Technology, Austria. Yamine Ait Ameur, LISI/ENSMA, France. Keijiro Araki, Kyushu University, Japan. Farhad Arbab, CWI and Leiden University, The Netherlands. Richard Banach, University of Manchester, United Kingdom. Nikolaj Bjorner, Microsoft Research Redmond, USA. Jonathan Bowen, London South Bank University & Chairman, Museophile Limited, United Kingdom. Michael Butler, University of Southampton, United Kingdom. Andrew Butterfield, Trinity College Dublin, Ireland. Wei-Ngan Chin, National University of Singapore, Singapore. Jim Davies, University of Oxford, United Kingdom. Jin Song Dong, National University of Singapore, Singapore Zhenhua Duan, Xidian University, China. Colin Fidge, Queensland University of Technology, Australia. John Fitzgerald, Newcastle University, United Kingdom. Joaquim Gabarro, Universitat Politecnica de Catalunya, Spain. Stefania Gnesi, ISTI-CNR, Italy. Radu Grosu, State University of New York at Stony Brook, USA. Lindsay Groves, Victoria University of Wellington, New Zealand. Ian Hayes, University of Queensland, Australia. Mike Hinchey, Lero, Ireland. Peter Gorm Larsen, Engineering College of Aarhus, Denmark. Michael Leuschel, Heinrich-Heine Universitat Dusseldorf, Germany. Xuandong Li, Nanjing University, China. Yuan-Fang Li, Monash University, Australia. Shang-Wei Lin, National University of Singapore, Singapore. Shaoying Liu, Hosei University, Japan. Yang Liu, Nanyang Technological University, Singapore. Zhiming Liu, UNU/IIST, China. Tiziana Margaria, University of Potsdam, Germany. Hong Mei, Peking University, China. Huaikou Miao, Shanghai University, China. Peter Mueller, ETH Zurich, Switzerland. Shin Nakajima, National Institute of Informatics, Japan. Sebastian Nanz, ETH Zurich, Switzerland. Jose Nuno Oliveira, Universidade do Minho, Portugal. Jun Pang, University of Luxembourg, Luxembourg. Shengchao Qin, Teesside University, United Kingdom. Zongyan Qiu, Peking University, China. Steve Reeves, The University of Waikato, New Zealand. Alexander Romanovsky, Newcastle University, United Kingdom. Wuwei Shen, Western Michigan University, USA. Marjan Sirjani, Reykjavik University, Iceland. Graeme Smith, The University of Queensland, Australia. Jing Sun, The University of Auckland, New Zealand. Jun Sun, Singapore University of Technology and Design, Singapore. Kenji Taguchi, AIST, Japan. Tetsuo Tamai, Hosei University, Japan. Yih-Kuen Tsay, National Taiwan University, Taiwan. T.H. Tse, The University of Hong Kong, China. Viktor Vafeiadis, MPI-SWS, Germany. Farn Wang, National Taiwan University, Taiwan. Hai H. Wang, Aston University, United Kingdom. Jim Woodcock, University of York, United Kingdom. Wang Yi, Uppsala University, Sweden. Jian Zhang, Chinese Academy of Sciences, China. Hong Zhu, Oxford Brookes University, United Kingdom. Huibiao Zhu, East China Normal University, China.

1 0

Haskell in Leipzig (Germany) : call for papers, tutorials, performances
by Johannes Waldmann 12 Feb '13

12 Feb '13

Haskell in Leipzig! Now in its 8th year! http://www.bioinf.uni-leipzig.de/conference-registration/13haskell/ Calling for papers, tutorials, performances! ... on Haskell in particular, but also functional programming in general, and its extension by other paradigms. We'd love to hear about news of the language, libraries, and tools; Haskell applications in art and industry; and teaching Haskell. Presentations should be given in German but we can switch to English if requested. Submission until: March 31 Notification : April 15 Workshop : June 21 Invited talk by Christian Höner zu Siederdissen: "ADPfusion: high-performance dynamic programming in Haskell" Program comittee: Ralf Dorn (Otto-Nagel-Gymnasium Berlin), Georg Martius (MPI Leipzig), Petra Hofstedt (BTU Cottbus), Andres Löh (Well-Typed LLP), Alf Richter (iba CG Leipzig), Uwe Schmidt (FH Wedel), Peter Stadler (Univ. Leipzig), Henning Thielemann (Univ. Halle), Janis Voigtländer (Univ. Bonn), Johannes Waldmann (HTWK Leipzig)

1 0

Foundations of Health Information Engineering and Systems (FHIES 2013) - call for papers
by Jeremy.Gibbons＠cs.ox.ac.uk 11 Feb '13

11 Feb '13

CALL FOR PAPERS Third International Symposium on Foundations of Health Information Engineering and Systems http://www.cs.ox.ac.uk/FHIES2013/ International Institute for Software Technology United Nations University, Macau 21st-23rd August, 2013 BACKGROUND ICT plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world. The use of software in medical devices has caused growing concerns in relation to safety and efficacy. The increasing adoption of health information systems provides great potential benefits but also poses severe risks, both with respect to security and privacy and in regard to patient safety. Hospital and other information systems raise important issues of workflow support and interoperability. Regulators, manufacturers and clinical users have pointed out the need to research sound and science-based engineering methods that facilitate the development and certification of quality ICT systems in health care. Such methods may draw from or combine techniques from various disciplines, including but not limited to software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. AIMS The purpose of the symposium series on Foundations of Health Information Engineering and Systems is to promote a nascent research area that aims to develop and apply theories and methods from a variety of disciplines for the purpose of modeling, building and certifying software-intensive ICT systems in healthcare. A particular objective of FHIES is to explicitly include a focus on healthcare ICT applications in the developing world (in addition to systems used in the developed countries), since unique engineering challenges arise in that special setting. Because humans often play a pivotal role in the process of using such systems, theories from the human factors engineering community may need to be integrated with methods from the technology-oriented domains in order to create effective engineering methodologies for socio-technical systems in the healthcare domain. Previous FHIES symposia were held in 2011, in Mabalingwe, South Africa (with post-conference proceedings in Springer LNCS 7151, and in 2012, in Paris, France (with post-conference proceedings to appear in Springer LNCS). SCOPE FHIES seeks contributions from both the solution domain (engineering methods) and the problem domain (healthcare and health informatics). Solution-domain papers should present their methods in the context of a concrete application in healthcare, while problem-domain papers should be devised to educate the methods community about unique challenges and characteristics of the healthcare domain. Submissions should seek to inform and further the development, adaptation, evaluation and adoption of formally based and rigorous engineering methods in health care systems. Topics of interest include but are not limited to: * modelling, analysis, simulation and verification in health informatics; * design and verification techniques for software-based ICT and software-intensive medical devices; * application and integration of foundational methods from different disciplines in engineering and science to health informatics; * specific engineering challenges of ICT-based health service delivery in different settings, especially in the developing world. For a more detailed list of topics, see the symposium website. CATEGORIES We solicit high quality full submissions in the following categories: * original research contributions (16 pages max) * application experience, case studies and software prototypes (16 pages max.) * surveys, comparisons, and state-of-the-art reports (16 pages max.) * position papers identifying challenges and milestones of a research project (8 pages max.) We also invite short submissions for special sessions: * student papers on work in progress on an MSc or PhD project (4 pages max.) * tool demonstrations (2 pages max.) * proposals to organize birds-of-a-feather sessions or panels (2 pages max.) SUBMISSIONS Submissions should be in English, prepared in the LNCS format (http://www.springer.de/comp/lncs/authors.html) and all page limits are measured in this format. Full submissions (those in the first four categories above) will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the symposium; student papers will be judged on clarity of description and the promise of interesting results; tool demonstrations and BOF proposals will be judged on relevance to the symposium. All papers will be peer-reviewed by at least three program committee members. Papers should be submitted via EasyChair, at http://www.easychair.org/conferences/?conf=fhies2013 Submission constitutes a commitment for at least one author to attend the symposium and present the paper, if it is accepted. PUBLICATION All accepted submissions will be distributed in a technical report at the Symposium. After the event, postproceedings will be published in Springer LNCS. Authors of all accepted full submissions will be invited to revise their papers, in order to resolve any larger issues raised during reviewing. Authors of accepted short submissions will be invited to submit full papers for review and LNCS publication too. In addition, a special issue of a suitable journal is planned, focusing on the overall objectives of FHIES: this will have an open call for contributions. IMPORTANT DATES Intention to submit: April 29th Submission deadline: May 6th Notification of acceptance: June 12th Delivery of preproceedings version: July 17th Symposium: August 21st-23rd Submission for postproceedings review: October 4th Notification of acceptance: October 11th Camera ready version: October 18th Publication of proceedings: December 23rd ORGANIZERS General chairs: * Zhiming Liu, United Nations University, MO * Jens Weber, University of Victoria, CA Programme chairs: * Jeremy Gibbons, University of Oxford, UK * Wendy MacCaull, St. Francis Xavier University, CA For the Programme Committee, see the website.

1 0

Assistant Position at University of Ulm, Computer Science, Declarative Programming
by Jon Sneyers 11 Feb '13

11 Feb '13

(apologies for multiple copies) Please pass this message on to whoever you think may be interested. DOCTORAL OR POSTDOCTORAL POSITION IN DECLARATIVE PROGRAMMING Institute of Software Engineering and Compiler Construction, Faculty of Engineering and Computer Science, University of Ulm, Germany Starting Date: October 1, 2013. A research/teaching position is available for Ph.D. students or postdocs in the area of Constraint Programming, in particular Constraint Handling Rules (CHR). For background information on the subject start at http://www.informatik.uni-ulm.de/pm/fileadmin/pm/home/fruehwirth/ The applicant should have prior knowledge in one or more of the following areas: Declarative Programming, Logic, Program Analysis, Artificial Intelligence, and be willing to work in the field of Constraint Handling Rules. The context of the position requires a basic command of German at the time of application. Applicants are expected to be fluent in English. Mandatory teaching responsibilities are four lecture hours per week (in German or English). At least a master or equivalent in computer science or strongly related area is required. The initial appointment will be for two years, with possible renewals for up to six years and more. The position is state-funded according to salary scheme E13 TV-L, which means a gross salary of about 60.000 Euro per year, resulting in a net income of about 1750 to 2000 Euro a month depending on qualification (after deduction of taxes and of mandatory health and social insurance). Rents for flats start at about 500 Euro a month. Ulm is a pleasant city of 150.000 on the Danube, close to Stuttgart, Munich, the Alps, and Lake Konstanz. Every day life requires a basic command of German. Prospective applicants should email their resume with two references, certificates, proof of German language skills, and links to homepage and publications together in a single pdf file to Prof. Dr. Thom Fruehwirth, c/o Ulrike Seiter (secretary) ulrike.seiter(a)uni-ulm.de by May 1, 2013. Also use above email address for questions concerning the position. The University of Ulm is committed to increase the share of women in research and teaching positions and therefore explicitly encourages female candidates to apply. Job sharing is always possible for full-time positions. Physically disabled applicants receive favourable consideration when equally qualified. The job appointment is made by the central university administration. -------------------------------------------------------------------------------- Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

1 0