January 2014 - Haskell

HASKELL CAREER OPPORTUNITIES!
by Katy Ovens 23 Jan '14

23 Jan '14

Urgently seeking Software Engineers with Haskell interest / skills to join a leading technology organisation, focused on a revolutionary new HPC project. Candidates can work from home / remotely part-time but MUST be willing to be based in Cambridge at least 2-3 days a week. Flexible packages on offer to suit a range of experience levels. Get in touch for discussion with Katy Ovens on kovens(a)strgroup.co.uk http://www.strgroup.co.uk/ Katy Ovens , CertRP Lead Account Manager - Engineering 023 9232 2308 07511 011 918 kovens(a)strgroup.co.uk 1 Quay Point, Northarbour Road, Portsmouth, PO6 3TD, UK - http://www.strgroup.co.uk/ Join our social networks: http://www.linkedin.com/company/str-group http://www.facebook.com/pages/STR-Group/157182227861 http://twitter.com/#!/STR_Group All detailed pricing models will exclude local taxation charges unless otherwise stated, for a copy of our terms and conditions please http://www.strgroup.co.uk/terms-and-conditions.cms.asp STR Ltd is a limited company registered in England and Wales. Registered number: 04064332. Registered office: 1 Quay Point, Northarbour Road, Portsmouth, PO6 3TD. Please note that STR Ltd may monitor email traffic data and also the content of email for the purposes of security and staff training. IMPORTANT: This message is private and confidential. If you have received this message in error, please notify us and remove it from your system. E-mail transmission cannot be guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete, or contain viruses. STR Limited therefore does not accept liability for any errors or omissions in the contents of this message, which arise as a result of e-mail transmission. If verification is required please request a hard-copy version. -- This message has been scanned for viruses and dangerous content and is believed to be clean.

1 0

ANN: ZuriHac 2014
by Bas van Dijk 22 Jan '14

22 Jan '14

Dear Haskellers, After a very successful ZuriHac 2013 we are delighted to announce ZuriHac 2014! When: Friday 6 June 2014 - Sunday 8 June 2014 Where: Erudify offices, Zurich, Switzerland ZuriHac is an international Haskell hackathon: a grassroots, collaborative coding festival with a simple focus, to build and improve Haskell libraries, tools, and infrastructure. This is a great opportunity to meet your fellow Haskellers in real life, find new contributors for your project, improve existing libraries and tools, or even start new ones! Registration ------------ If you wish to attend, please register by filling in this form: http://bit.ly/ZuriHac2014 Please note that we have a limited number of places -- first come, first served. Full details can be found on the wiki page: http://www.haskell.org/haskellwiki/ZuriHac2014 We look forward to seeing you there! -- The organisers of ZuriHac 2014 ZuriHac 2014 is sponsored by Erudify & Google

1 0

Just started working with Haskell. Need some help
by Pyro Crane 18 Jan '14

18 Jan '14

Hi, I just started working with Haskell Running it on a RHEL linux operating system I was able to download and install it, along with libraries and packages (or, at least, what I thought were the libraries and packages) But, when I try to run a simple script, I keep getting the error : "Could not find module XXXXXX".............. I understand what this error means ---- there is a package/library missing. I tried using the "Cabal Update" command, but this did not solve the problem. So, I am now fixing this problem the primitive way, as follows : (a) I use Google to first find out what the missing module is (b) then, based on what google says, I am able to determine the name of the actual package that needs to be installed (c) I use "Cabal Install" to install the package (d) I try to run the script again (e) I get the same error, but this time, it cannot find a different module (f) I go back to Google to locate the missing module etc, etc, etc, etc Obviously, this is as slow as it is ridiculous............... especially when one considers that there are probably hundreds of these modules/packages And, now, I've come up against a module/package, which I am unable to locate in Google. It's missing from my installation, and Google does not know what it is, or where I can find it Is there any way to simply install ALL required packages??? I thought I already did this, but obviously I missed something Thanks

1 0

ANNOUNCE: Diagrams 1.0
by Brent Yorgey 17 Jan '14

17 Jan '14

The diagrams team is very pleased to announce the 1.0 release of diagrams [1], a framework and embedded domain-specific language for declarative drawing in Haskell. Check out the gallery [2] for some examples of what it can do. Diagrams can be used for a wide range of purposes, from data visualization [3] to illustration [4] to art [5], and diagrams code can be seamlessly embedded in blog posts [6], LaTeX documents [7], and Haddock documentation [8], making it easy to incorporate diagrams into your documents with minimal extra work. [1] http://projects.haskell.org/diagrams [2] http://projects.haskell.org/diagrams/gallery.html [3] http://idontgetoutmuch.wordpress.com/2013/10/23/parking-in-westminster-an-a… [4] https://www.fpcomplete.com/user/edwardk/cellular-automata/part-1 [5] http://mathlesstraveled.com/2013/04/06/stars-of-the-minds-sky-with-diagrams/ [6] http://byorgey.wordpress.com/2012/08/28/creating-documents-with-embedded-di… [7] http://projects.haskell.org/diagrams/doc/latex.html [8] http://byorgey.wordpress.com/2013/03/23/introducing-diagrams-haddock/ What's new ---------- Brent recently gave a talk at the New York Haskell Users' Group [12] presenting the new release. You can find videos of the talk on vimeo: part 1 presents a basic introduction to the library [13], and part 2 talks about mathematical abstraction and DSL design [14]. The slides are also available [15]. [12] http://www.meetup.com/NY-Haskell/ [13] http://vimeo.com/84104226 [14] http://vimeo.com/84249042 [15] http://www.cis.upenn.edu/~byorgey/pub/13-11-25-nyhaskell-diagrams.pdf This release includes a number of significant new features and improvements. Highlights include: - Support for drawing arrows between given points or between diagrams, with many options for customization (tutorial [16], documentation [17], API [18]). [16] http://projects.haskell.org/diagrams/doc/arrow.html [17] http://projects.haskell.org/diagrams/doc/manual.html#arrows [18] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Arrow.html - A new framework for creating custom command-line-driven executables for diagram generation (tutorial [19], API [20]). [19] http://projects.haskell.org/diagrams/doc/cmdline.html [20] http://projects.haskell.org/diagrams/haddock/Diagrams-Backend-CmdLine.html - Offsets of trails and paths, i.e. compute the trail or path lying a constant distance from the given one (documentation [21], API [22]). [21] http://projects.haskell.org/diagrams/doc/manual.html#offsets-of-segments-tr… [22] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Offset.html - A new API, based on Metafont, for constructing cubic splines with control over things like tangents and "tension" (tutorial [23], API [24]). [23] http://projects.haskell.org/diagrams/doc/metafont.html [24] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Path-Metafont.ht… - Tangent and normal vectors of segments and trails (API [25]). [25] http://projects.haskell.org/diagrams/haddock/Diagrams-Tangent.html - Alignment can now be done by trace in addition to envelope (API [26]). [26] http://projects.haskell.org/diagrams/haddock/Diagrams-TwoD-Align.html - The lens [27] package is now used consistently for record fields throughout the library (documentation [28]). [27] http://hackage.haskell.org/package/lens [28] http://projects.haskell.org/diagrams/doc/manual.html#faking-optional-named-… - Across-the-board improvements in performance and size of generated files. See the release notes [29] for full details, and the migration guide [30] for help porting your diagrams 0.7 code to work with diagrams 1.0. [29] http://projects.haskell.org/diagrams/releases.html [30] http://www.haskell.org/haskellwiki/Diagrams/Dev/Migrate1.0 Try it out ---------- For the truly impatient: cabal install diagrams Diagrams is supported under GHC 7.4 and 7.6. To get started, read the quick start tutorial [31], which will introduce you to the fundamentals of the framework and provide links for further reading. For those who are less impatient and want to really dig in and use the power features, read the extensive user manual [32]. There is also a growing collection of tutorials [33] on specific topics. [31] http://projects.haskell.org/diagrams/doc/quickstart.html [32] http://projects.haskell.org/diagrams/doc/manual.html [33] http://projects.haskell.org/diagrams/documentation.html Get involved ------------ Diagrams has a friendly and growing community of users and developers. To connect with the community, subscribe to the project mailing list [34], and/or come hang out in the #diagrams IRC channel on freenode.org for help and discussion. Development continues stronger than ever, and there are a wide range of projects available for new contributors of all levels of Haskell skill. Make some diagrams. Fix some bugs [35]. Submit your cool examples for inclusion in the gallery [36] or your cool code for inclusion in the diagrams-contrib [37] package. [34] http://groups.google.com/group/diagrams-discuss [35] http://github.com/diagrams/ [36] http://projects.haskell.org/diagrams/gallery.html [37] http://hackage.haskell.org/package/diagrams%2Dcontrib Happy diagramming! Brought to you by the diagrams team: - Daniel Bergey - Jeff Rosenbluth - Ryan Yates - Brent Yorgey with contributions from: - Jan Bracker - Conal Elliott - Daniil Frumin - Sam Griffin - Niklas Haas - Peter Hall - Claude Heiland-Allen - Deepak Jois - John Lato - Felipe Lessa - Chris Mears - Ian Ross - Carlos Scheidegger - Vilhelm Sjöberg - Michael Sloan - Jim Snavely - Luite Stegeman - Kanchalai Suveepattananont - Michael Thompson - Scott Walck

1 0

Call for Papers: TASE 2014
by Huibiao Zhu 16 Jan '14

16 Jan '14

TASE 2014 - CALL FOR PAPERS ****************************************************************** The 8th International Symposium on Theoretical Aspects of Software Engineering (TASE 2014) 1-3 September 2014, Changsha, China http://www.nudt.edu.cn/tase2014 For more information email: TASE2014(a)nudt.edu.cn ****************************************************************** OVERVIEW The 8th Theoretical Aspects of Software Engineering Symposium (TASE 2014), will be held in Changsha, China in September, 2014. Modern society is increasingly dependent on software systems that are becoming larger and more complex. This poses new challenges to the various aspects of software engineering, for instance, software dependability in trusted computing, interaction with physical components in cyber physical systems, distribution in cloud computing applications, etc. Hence, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2014 aims to provide a forum for people from academia and industry to communicate their latest results on theoretical advances in software engineering. TASE 2014 is the 8th in the TASE series. The past TASE symposiums were successfully held in Shanghai ('07), Nanjing ('08), Tianjin ('09), Taipei ('10), Xi'an ('11), Beijing ('12), Birmingham ('13). The proceedings of the TASE symposia were all published by the IEEE Computer Society Press. TOPICS The symposium is devoted to 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 and Cloud Computing * Semantic Web and Web Services * Type System and Theory * Program Logics and Calculus * Probability in Software Engineering SUBMISSION Submission should be done through the TASE 2014 submission page, handled by the EasyChair conference system: https://www.easychair.org/conferences/?conf=tase2014 As in previous years, the proceedings of the conference are planned to be published by the IEEE Computer Society Press. Papers must be written in English and not exceed 8 pages in Two-Column IEEE format. IMPORTANT DATES Abstract submission: 28 February 2014 (23h59 GMT) Paper submission: 07 March 2014 (23h59 GMT) Notification: 28 April 2014 Camera-ready: 19 May 2014 Conference: 1-3 September 2014 GENERAL CHAIR Jifeng He (East China Normal University, China) PROGRAM CO-CHAIRS Ji Wang (National University of Defense Technology, China) Martin Leucker (University of Lubeck, Germany) STEERING COMMITTE Keijiro Araki (Kyushu University, Japan) Shengchao Qin (Teesside University, UK) Jifeng He (East China Normal University, China) Huibiao Zhu (East China Normal University, China) Michael Hinchey (Lero, Ireland) PROGRAM COMMITTEE Earl Barr (University College London, UK) Nikolaj Bjorner (Microsoft Research, USA) Zhenhua Duan (Xidian University, China) Xinyu Feng (University of Science and Technology of China, China) Peter Habermehl (Liafa, Paris 7, France) Dang Van Hung (Vietnam National University, Vietnam) Lingxiao Jiang (Singapore Management University, Singapore) Xiaoshan Li (University of Macau, Macau) Xuandong Li (Nanjing University, China) Shaoyin Liu (Hosei University, Japan) Xiaoqing(Frank) Liu (Missouri University of Science and Technology, USA) Michael Lyu (Chinese University of Hong Kong, China) Xiaoguang Mao (National University of Defense Technology, China) Huaikou Miao (Shanghai University, China) Antoine Mine (Ecole Normale Superieure Paris, France) Paritosh K. Pandya (Tata Institute of Fundamental Research, India) Jun Pang (University of Luxembourg, Luxembourg) Sungwoo Park (Pohang University of Science and Technology, Korea) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Cesar Sanchez (IMDEA Software Institute, Spain) Axel Simon (Technical University of Munich, Germany) Volker Stolz (University of Oslo, Norway) Yih-Kuen Tsay (National Taiwan University, Taiwan) Tomas Vojnar (Brno University of Technology, Czech Republic) Hai Wang (Aston University, UK) Yi Wang (Uppsala University, Sweden) Eric Wong (UT-Dallas, USA) Yingfei Xiong (Peking University, China) Hongli Yang (Beijing University of Technology, China) Naijun Zhan (Chinese Academy of Sciences, China) Hongyu Zhang (Tsinghua University, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Hong Zhu (Oxford Brookes University, UK) Huibiao Zhu (East China Normal University, China) ORGANIZING CHAIR Wei Dong (National University of Defense Technology, China) PUBLICITY CHAIR Yanjun Wen (National University of Defense Technology, China)

1 0

UTP-2014 Unifying Theories of Programming - call for papers
by Jeremy Gibbons 12 Jan '14

12 Jan '14

********************************************************************** 5th International Symposium on Unifying Theories of Programming co-located with FM2014 May 12 - 13, 2014 Singapore http://www.comp.nus.edu.sg/~pat/UTP2014/index.html ********************************************************************** CALL FOR PAPERS Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent years. The theories define, in various different ways, many common notions, such as abstraction, refinement, choice, termination, feasibility, locality, concurrency and communication. Despite these differences, such theories may be unified in a way which greatly facilitates their study and comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artifacts of software development in a seamless, logically consistent way. Hoare and He's Unifying Theories of Programming (UTP) is widely acknowledged as one of the most significant such unification approaches. Based on their pioneering work, the aims of the UTP Symposium series are to reaffirm the significance of the ongoing UTP project and to stimulate efforts to advance. The Symposium provides a focus for the sharing of results by those already actively contributing, and raises awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. To this end the Symposium welcomes contributions on all the themes that can be related to the Unifying Theories of Programming. SUBMISSIONS Papers may be up to 20 pages in length and should be prepared using LaTeX in Springer LNCS paper format. Submissions should be made through the UTP 2014 EasyChair site; instructions are athttp://www.comp.nus.edu.sg/~pat/UTP2014 PUBLICATION Symposium post-proceedings will appear in Springer's Lectures Notes in Computer Science, as in past editions of the Symposium. (To be confirmed.) DATES Abstract due: January 17, 2014 Full paper due: January 24, 2014 Notification: March 7, 2014 Camera-ready for pre-proceedings: April 11, 2014 Symposium: May 12-13, 2014 CHAIR David Naumann (Stevens Institute of Technology) ORGANISATION CHAIR Jin Song DONG (National University of Singapore) PROGRAMME COMMITTEE Bernhard K. Aichernig (Graz University of Technology) Hugh Anderson (National University of Singapore) Jonathan P. Bowen (Birmingham City University) Ana Cavalcanti (University of York) Andrew Butterfield (Trinity College Dublin) Leo Freitas (Newcastle University) Jeremy Gibbons (University of Oxford) Lindsay Groves (Victoria University of Wellington) Walter Guttmann (University of Canterbury) Ian Hayes (University of Queensland) Jeremy Jacob (University of York) Zhiming Liu (Birmingham City University) David Naumann, chair (Stevens Institute of Technology) Marcel Oliveira (Universidade Federal do Rio Grande do Norte) Geguang Pu (East China Normal University) Shengchao Qin (Teesside University) Georg Struth (University of Sheffield) Jun Sun (Singapore University of Technology and Design) Meng Sun (Peking University) Burkhart Wolff (University of Paris-Sud) Naijun Zhan (Chinese Academy of Sciences) Huibiao Zhu (East China Normal University) JOINT EVENT FM 2014, the 19th International Symposium on Formal Methods http://www.comp.nus.edu.sg/~pat/FM2014/ Jeremy.Gibbons(a)cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/

1 0

5th Answer Set Programming Competition 2014 - FIRST CALL FOR PARTICIPANTS
by Francesco Calimeri 10 Jan '14

10 Jan '14

[apologies for any cross-posting] ======================================================================== ================================================================== 5th Answer Set Programming Competition 2014 Call for Participant Systems Aalto University, University of Calabria, University of Genova Spring/Summer 2014 http://aspcomp2014.mat.unical.it/ aspcomp2014(a)mat.unical.it ================================================================== Special edition of the ASP competition series -system track- part of the Olympic Games of the Vienna Summer of Logic 2014 == Important Dates == * March 1st, 2014 : Participant registration opens * March 31st, 2014: The competition starts * July 22nd, 2014 : Awards are presented at FLoC ======================================================================== Answer Set Programming (ASP) is a well-established paradigm of declarative programming with close relationship to other declarative modeling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. The ASP Competition is usually a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. Past ASP Competition editions were held at the University of Potsdam (Germany) in 2007, the University of Leuven (Belgium) in 2009, the University of Calabria (Italy) in 2011 and the Vienna University of Technology (Austria) in 2013. In order to join the Vienna Summer of Logic, which is expected to be the largest event in the history of logic, we this year depart from the "usual" timeline, and the 5th ASP Competition will be run in the first half of 2014 jointly at Aalto University (Finland), the University of Calabria (Italy) and the University of Genova (Italy). Another reason for having an event only one year after the 4th ASP Competition is that in 2013 the new ASP-Core-2 language was introduced, but at that time it was not fully supported by most participant solvers, and/or the submitters did not have sufficient time to support new language features in a completely satisfactory way. Thus, an early event can be an opportunity to push the usage of the new standard, and draw a more complete picture about the approaches that can efficiently solve problems with various features. == Call for Participant Systems == Participants of the Answer Set Programming Competition will compete on a selected collection of benchmark problems, taken from a variety of benchmark problem domains as well as real-world applications. These include, but are not limited to: * Classic and application-oriented graph problems * Scheduling, Timetabling, and other resource allocation problems * Sequential and Temporal Planning * Combinatorial Optimization problems * Deductive Database tasks on large data-sets * Puzzles and Combinatorics * Ontology reasoning * Automated Theorem Proving and Model Checking * Constraint Programming problems * Other AI problems The competition consists of a System Track (as called in past competitions), which compares dedicated solvers on ASP benchmarks. Participants compete with solving systems for the ASP-Core-2 language. Some more details are given in the following: - The benchmark domains are taken from past editions. - Systems of the 2013 edition will be considered. (Developers will have the chance of submitting up-to-date versions of their solvers.) - Submissions of new solvers are encouraged. The competition will include sub-tracks not only based on "complexity" of problems (as in past events), but also considering language features. Our aim is to clearly indicate what (combinations of) techniques work for a particular (set of) feature(s), and also widening the participation to teams that cannot (yet) support the full standard. We welcome the submission of parallel and portfolio systems exploiting multiple cores or multiple algorithms for solving the given instances. These solvers will have dedicated tracks, assuming a sufficient number of submissions in each track. Of course, we also welcome the submission of any kind of solvers, e.g., SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, Planning reasoners, or any other that can be adapted/applied to the evaluation of logic programs encoded in ASP-Core-2. == Important Dates == * March 1st, 2014 : Participant registration opens * March 31st, 2014: The competition starts * July 22nd, 2014 : Awards are presented at FLoC For further information and submission instructions please visit the competition web site http://aspcomp2014.mat.unical.it/ or contact us by email: aspcomp2014(a)mat.unical.it

1 0

First call-for-papers - Linearity 2014
by Mário Florido 10 Jan '14

10 Jan '14

[We apologize if you have received multiple copies of this message] ============================================================================== Call for Papers Third International Workshop on Linearity http://vsl2014.at/linearity/ July 13, 2014 Vienna, Austria An associated event of the Joint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th ACM/IEEE Symposium on Logic in Computer Science (LICS), as part of the Vienna Summer of Logic. ============================================================================== Aim and Scope ------------- Ever since the birth of Girard's linear logic, there has been a stream of research where linearity is a key issue, covering both theoretical topics and applications to several areas of Computer Science, such as work on proof technology, complexity classes and more recently quantum computation, program analysis, expressive operational semantics, linear programming languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. Linearity is a key feature in both theoretical and practical approaches to computer science, and the goal of this workshop is to present work exploring linearity both in theory and practice. Topics of interest include new results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Specifically, topics of interest include, but are not limited to: * sub-linear logics * linear term calculi * linear type systems * linear proof-theory * linear programming languages * applications to concurrency * interaction-based systems * verification of linear systems * quantum models of computation * biological and chemical models of computation Important Dates --------------- * April 13, 2014: Submission deadline * May 10, 2014: Author notification * May 28, 2014: Deadline for final versions of accepted papers * July 13, 2014: Workshop Submission and Publication -------------------------- Authors are invited to submit an extended abstract (8 pages max) describing original ideas and recent results not published nor submitted elsewhere, or a 5-page abstract presenting relevant work that has been or will be published elsewhere, or work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PostScript or PDF format, using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/conferences/?conf=linearity2014 After the workshop, authors of the extended abstracts will be invited to submit a longe version of their work (typically a 15-pages paper) for publication in an electronic journal such as EPTCS. These submission will undergo a second round of referring. Furthermore, we envision publication of a special issue of a journal after the event. Programme Committee ------------------- * Sandra Alves (chair) * Iliano Cervesato (chair) * Kaustuv Chaudhuri * Maribel Fernández * Mário Florido * Simon Gay * Simone Martini * Luca Paolini * Simona Ronchi Della Rocca * Carsten Schuermann * Robert Simmons * Vasco Vasconcelos Contact ------- Sandra Alves: sandra(a)dcc.fc.up.pt <mailto:sandra@dcc.fc.up.pt> Iliano Cervesato: iliano(a)cmu.edu <mailto:iliano@cmu.edu>

1 0

Fun in the Afternoon at Facebook London: 12 March 2014
by Simon Marlow 10 Jan '14

10 Jan '14

[ please forward this to anyone who might be interested ] Fun in the Afternoon is a regular(ish) event consisting of talks about Functional Programming and related topics. The next one will be held at the Facebook offices in London on 12 March 2014 As with other Fun in the Afternoon events in the past (see http://sneezy.cs.nott.ac.uk/fun/) the plan is to have an afternoon of talks and meet up with fellow FPers, probably followed by some drinking and food. Facebook is located in Covent Garden, and is easily reachable by public transport (however, it is not so easily reachable by private transport!). I'll send out full details including the program and directions nearer the time. Anyone is welcome to attend - if you'd like to come along, just drop me an email. If you'd like to give a talk, please drop me an email containing a title and abstract. Talks will probably be about 30 minutes, depending on the number of talk proposals. The atmosphere is intended to be Fun and informal, so talks that are not fully-baked are completely fine. Try out your crazy ideas on a not-entirely-unforgiving audience. See you in London! Cheers, Simon

1 0

ICFP 2014: Call for papers
by David Van Horn 08 Jan '14

08 Jan '14

===================================================================== 19th ACM SIGPLAN International Conference on Functional Programming ICFP 2014 Gothenburg, Sweden, 1-3 September 2014 http://www.icfpconference.org/icfp2014 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Saturday, 1 March 2014, 23:59 UTC-11 (anywhere in the world) Author response: Wednesday, 23 April, 2014 Friday, 25 April, 2014 Notification: Monday, 5 May, 2014 Final copy due: Wednesday, 11 June, 2014 Scope ~~~~~ ICFP 2014 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security * Education: teaching introductory programming; parallel programming; mathematical proof; algebra * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Saturday, 1 March 2014, 23:59 UTC-11 (anywhere in the world), submit a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents. The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available: http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web at https://www.easychair.org/conferences/?conf=icfp2014 . Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 72-hour period, starting at 0:00 UTC-11 on Wednesday, 23 April 2014, to read reviews and respond to them. ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking the definitive version of ACM article should reduce user confusion over article versioning. After your article has been published and assigned to your ACM Author Profile page, please visit http://www.acm.org/publications/acm-author-izer-service to learn how to create your links for fee downloads from the ACM DL. General Chair: Johan Jeuring, Utrecht University Program Chair: Manuel Chakravarty, University of New South Wales Program Committee: Edwin Brady, University of St Andrews Derek Dreyer, Max Planck Institute for Software Systems Ralf Hinze, University of Oxford Zhenjiang Hu, National Institute of Informatics Patricia Johann, Appalachian State University Ken Larsen, University of Copenhagen Yukiyoshi Kameyama, University of Tsukuba Anil Madhavapeddy, University of Cambridge Geoffrey Mainland, Drexel University David Mazières, Stanford University Jay McCarthy, Brigham Young University Matthew Might, University of Utah Ulf Norell, Chalmers University of Technology Tiark Rompf, Swiss Federal Institute of Technology in Lausanne Chung-chieh Shan, Indiana University Mary Sheeran, Chalmers University of Technology Matt Sottile, Galois Don Syme, Microsoft Research Jesse Tov, Harvard University

1 0