- Haskell - Haskell.org

[ANN] FLOPS CFP 2016
by oleg＠okmij.org 27 Apr '15

27 Apr '15

FLOPS 2016: 13th International Symposium on Functional and Logic Programming March 3-6, 2016, Kochi, Japan Call For Papers http://www.info.kochi-tech.ac.jp/FLOPS2016/ Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. Scope FLOPS solicits original papers in all areas of the declarative programming: * functional, logic, functional-logic programming, re-writing systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, submissions must be written to be understandable by the wide audience of declarative programmers and researchers. Submission of system descriptions and declarative pearls are especially encouraged. Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy. The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series, as a printed volume as well as online in the digital library SpringerLink. Post-proceedings: The authors of 4-7 best papers will be invited to submit the extended version of their FLOPS paper to a special issue of the journal Science of Computer Programming (SCP). Important dates Monday, September 14, 2015 (any time zone): Submission deadline Monday, November 16, 2015: Author notification March 3-6, 2016: FLOPS Symposium March 7-9, 2016: PPL Workshop Submission Submissions must be written in English and can be up to 15 pages long including references, though pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a Web page, or an appendix). Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2016 Program Committee Andreas Abel Gothenburg University, Sweden Lindsay Errington USA Makoto Hamana Gunma University, Japan Michael Hanus CAU Kiel, Germany Jacob Howe City University London, UK Makoto Kanazawa National Institute of Informatics, Japan Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Hsiang-Shang Ko National Institute of Informatics, Japan Julia Lawall Inria-Whisper, France Andres Löh Well-Typed LLP, UK Anil Madhavapeddy Cambridge University, UK Jeff Polakow PivotCloud, USA Marc Pouzet École normale supérieure, France Vítor Santos Costa Universidade do Porto, Portugal Tom Schrijvers KU Leuven, Belgium Zoltan Somogyi Australia Alwen Tiu Nanyang Technological University, Singapore Sam Tobin-Hochstadt Indiana University, USA Hongwei Xi Boston University, USA Neng-Fa Zhou CUNY Brooklyn College and Graduate Center, USA Organizers Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Yukiyoshi Kameyama University of Tsukuba, Japan (General Chair) Kiminori Matsuzaki Kochi University of Technology, Japan (Local Chair) flops2016 at logic.cs.tsukuba.ac dot jp

1 0

Final CFP: Workshop on Generic Programming 2015 - Deadline May 15
by Sebastian Erdweg 27 Apr '15

27 Apr '15

====================================================================== CALL FOR PAPERS WGP 2015 11th ACM SIGPLAN Workshop on Generic Programming Vancouver, Canada Sunday, August 30, 2015 http://www.wgp-sigplan.org/2015 Co-located with the International Conference on Functional Programming (ICFP 2015) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- * Patrick Bahr (co-chair), University of Copenhagen * Sebastian Erdweg (co-chair), Technical University of Darmstadt * Edwin Brady, University of St Andrews * Edsko de Vries, Well-Typed LLP * Mauro Jaskelioff, National University of Rosario * Johan Jeuring, Utrecht University * Pieter Koopman, Radboud University Nijmegen * Bruno C. d. S. Oliveira, University of Hong Kong * Nicolas Pouillard, IT University of Copenhagen * Sukyoung Ryu, Korea Advanced Institute of Science and Technology * Sibylle Schupp, Hamburg University of Technology * Sam Tobin-Hochstadt, Indiana University Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance (http://authors.acm.org/main.html) but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). 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. Submission details ------------------ * Submission deadline: Fri, 15th May 2015 * Author notification: Fri, 26th June 2015 * Final version due: Sun, 19th July 2015 * Workshop: Sun, 30th August 2015 Submitted papers should fall into one of two categories: * Regular research papers (12 pages) * Short papers: case studies, tool demos, generic pearls (6 pages) Regular research papers are expected to present novel and interesting research results. Short papers need not present novel or fully polished results. Good candidates for short papers are those that report on interesting case studies of generic programming in open source or industry, present demos of generic programming tools or libraries, or discuss elegant and illustrative uses of generic programming ('pearls'). All submissions should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). Regular research papers must not exceed 12 pages. Short papers must not exceed 6 pages. If applicable, papers should be marked with one of the labels 'case study, 'tool demo' or 'generic pearl' in the title at the time of submission. Papers should be submitted via HotCRP at https://icfp-wgp15.hotcrp.com/ Travel Support -------------- Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://www.sigplan.org/PAC.htm) History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Gothenburg, Sweden 2014 (affiliated with ICFP), * Boston, Massachusetts, US 2013 (affiliated with ICFP), * Copenhagen, Denmark 2012 (affiliated with ICFP), * Tokyo, Japan 2011 (affiliated with ICFP), * Baltimore, Maryland, US 2010 (affiliated with ICFP), * Edinburgh, UK 2009 (affiliated with ICFP), * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop). There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). WGP Steering Committee ---------------------- * Andres Löh * Ronald Garcia * Jacques Carette * Jeremiah Willcock * José Pedro Magalhães * Tiark Rompf * Tarmo Uustalo * Stephanie Weirich * Fritz Henglein

1 0

Re: [Haskell] Haskell Digest, Vol 140, Issue 20
by Geraldus 25 Apr '15

25 Apr '15

Will be a video record of talks available? Very interesting stuff, but there is no chance for me to present. сб, 25 апр. 2015 г. в 17:02, <haskell-request(a)haskell.org>: > Send Haskell mailing list submissions to > haskell(a)haskell.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > or, via email, send a message with subject or body 'help' to > haskell-request(a)haskell.org > > You can reach the person managing the list at > haskell-owner(a)haskell.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Haskell digest..." > > > Today's Topics: > > 1. Workshop on Type Inference, May 12 (Frantisek Farka) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Fri, 24 Apr 2015 18:46:44 +0100 > From: Frantisek Farka <frantisek(a)farka.eu> > To: spls(a)dcs.gla.ac.uk, haskell(a)haskell.org > Subject: [Haskell] Workshop on Type Inference, May 12 > Message-ID: <20150424184644.68ccd1ac(a)farka.eu> > Content-Type: text/plain; charset=US-ASCII > > Hello everyone, > > as the 12th of May is getting closer I would like to invite you > yet again for the Workshop on Type Inference and Automated Proving > at University of Dundee. > > Please send me an email if you wish to attend as described bellow. > It helps us with organization. > > For those who have not decided yet, I am please to announce that > we have one more speaker - Conor McBride will give a (revolutionary?) > talk. > > Best regards, > Frantisek Farka > > > The Theory of Computation group at the University of Dundee invites > you for the > > ********************************************************************* > > WORKSHOP ON TYPE INFERENCE AND AUTOMATED PROVING > > Tuesday the 12th of May, 12PM to 6PM > School Of Computing, > University of Dundee > > http://staff.computing.dundee.ac.uk/frantisekfarka/tiap/ > > ********************************************************************* > > Refreshments have been kindly funded by SICSA and will be available > from 12:00, with talks beginning at 12:45. For the detailed programme > please see the above website. > > Talks: > > Tom Schrijvers (Katholieke Universiteit Leuven) > GADTs Meet Their Match: Pattern-matching Warnings that > Account for GADTs, Guards, and Laziness > > Bob Atkey (University of Strathclyde) > An Algebraic Approach to Typechecking and Elaboration > > Edwin Brady (University of St Andrews) > Implementing a Dependently Typed Programming Language > > Peng Fu (University if Dundee) > Nontermination Analysis for Evidence Construction in Type > Class Inference > > Adam Gundry (Well-Typed LLP) > A Typechecker Plugin for Units of Measure: Domain-specific > Constraint Solving in GHC Haskell > > Katya Komendantskaya (University of Dundee) > Structural Resolution and Universal Productivity Checker > > J. Garrett Morris (University of Edinburgh) > Substructural Types with Class > > Connor McBride (University of Strathclyde) > Type Inference needs Revolution > > > After the talks we plan to continue the discussion at the nearby > Duke's Corner bar and then go for dinner, place is yet to be > announced but in the walking distance from both Seagate bus station > and Dundee railway station. > > Please let us know if you are coming by either replying to this email, > or by contacting me at ffarka(a)dundee.ac.uk > > If possible please indicate whether you wish to join us for dinner. > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > > > ------------------------------ > > End of Haskell Digest, Vol 140, Issue 20 > **************************************** >

1 0

Workshop on Type Inference, May 12
by Frantisek Farka 24 Apr '15

24 Apr '15

Hello everyone, as the 12th of May is getting closer I would like to invite you yet again for the Workshop on Type Inference and Automated Proving at University of Dundee. Please send me an email if you wish to attend as described bellow. It helps us with organization. For those who have not decided yet, I am please to announce that we have one more speaker - Conor McBride will give a (revolutionary?) talk. Best regards, Frantisek Farka The Theory of Computation group at the University of Dundee invites you for the ********************************************************************* WORKSHOP ON TYPE INFERENCE AND AUTOMATED PROVING Tuesday the 12th of May, 12PM to 6PM School Of Computing, University of Dundee http://staff.computing.dundee.ac.uk/frantisekfarka/tiap/ ********************************************************************* Refreshments have been kindly funded by SICSA and will be available from 12:00, with talks beginning at 12:45. For the detailed programme please see the above website. Talks: Tom Schrijvers (Katholieke Universiteit Leuven) GADTs Meet Their Match: Pattern-matching Warnings that Account for GADTs, Guards, and Laziness Bob Atkey (University of Strathclyde) An Algebraic Approach to Typechecking and Elaboration Edwin Brady (University of St Andrews) Implementing a Dependently Typed Programming Language Peng Fu (University if Dundee) Nontermination Analysis for Evidence Construction in Type Class Inference Adam Gundry (Well-Typed LLP) A Typechecker Plugin for Units of Measure: Domain-specific Constraint Solving in GHC Haskell Katya Komendantskaya (University of Dundee) Structural Resolution and Universal Productivity Checker J. Garrett Morris (University of Edinburgh) Substructural Types with Class Connor McBride (University of Strathclyde) Type Inference needs Revolution After the talks we plan to continue the discussion at the nearby Duke's Corner bar and then go for dinner, place is yet to be announced but in the walking distance from both Seagate bus station and Dundee railway station. Please let us know if you are coming by either replying to this email, or by contacting me at ffarka(a)dundee.ac.uk If possible please indicate whether you wish to join us for dinner.

1 0

LOLA 2015: Deadline extended to May 11
by Ulrich Schöpp 23 Apr '15

23 Apr '15

CALL FOR TALK PROPOSALS ______________________________________________________________________ LOLA 2015: Syntax and Semantics of Low Level Languages Sunday, 5 July 2015, Kyoto, Japan A satellite workshop of ICALP/LICS http://lola15.tcs.ifi.lmu.de ______________________________________________________________________ /Important Dates/ Abstract submission: Monday, 11 May 2015 (extended) Author notification: Friday, 22 May 2015 (extended) LOLA 2015 workshop: Sunday, 5 July 2015 /Invited Speakers/ Nikos Tzevelekos, Queen Mary University of London, UK Katsuhiro Ueno, Tohoku University, Japan /Workshop Description/ It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with some of the most advanced contemporary research in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and resource bounded programming. The LOLA workshop, affiliated with LICS 2015, will bring together researchers interested in many aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified assembly programming - Certified and certifying compilation - Relaxed memory models - Proof-carrying code - Program optimization - Modal logic and realizability in machine code - Realizability and double orthogonality in assembly code - Parametricity, modules and existential types - General references, Kripke models and recursive types - Continuations and concurrency - Implicit complexity, sublinear programming and Turing machines - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects /Submission Information/ LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The program committee will select the workshop presentations from submitted talk proposals, which may take the form either of a *two page abstract* or of a longer (published or unpublished) paper describing completed work. Abstracts can be submitted using EasyChair at https://www.easychair.org/conferences/?conf=lola2015 /Program Committee/ Ichiro Hasuo (University of Tokyo) Chung-Kil Hur (Seoul National University) Shin-ya Katsumata (RIMS, Kyoto University, co-chair) Damiano Mazza (CNRS, LIPN--University Paris 13) Magnus Myreen (University of Cambridge) Ulrich Schoepp (LMU Munich, co-chair) Nikhil Swamy (Microsoft Research, Redmond) Nicolas Tabareau (CNRS, INRIA) Noam Zeilberger (Microsoft Research--INRIA)

1 0

CfP LPNMR 2015: ***Last call***, registration closes in 33 hours
by Francesco Calimeri 23 Apr '15

23 Apr '15

[apologies for any cross-posting] Call for Papers --------------------------------------------------------------------------- 13th International Conference on Logic Programming and Non-monotonic Reasoning LPNMR 2015 http://lpnmr2015.mat.unical.it/ Lexington, KY, USA September 27-30, 2015 (Collocated with the 4th Conference on Algorithmic Decision Theory 2015) --------------------------------------------------------------------------- AIMS AND SCOPE LPNMR 2015 is the thirteenth in the series of international meetings on logic programming and non-monotonic reasoning. LPNMR is a forum for exchanging ideas on declarative logic programming, non-monotonic reasoning, and knowledge representation. The aim of the conference is to facilitate interactions between researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those working in knowledge representation and nonmonotonic reasoning. LPNMR strives to encompass theoretical and experimental studies that have led or will lead to the construction of systems for declarative programming and knowledge representation, as well as their use in practical applications. This edition of LPNMR will feature several workshops, a special session dedicated to the 6th ASP Systems Competition, and will be collocated with the 4th Algorithmic Decision Theory Conference, ADT 2015. Joint LPNMR-ADT Doctoral Consortium will be a part of the program. Authors are invited to submit papers presenting original and unpublished research on all aspects of non-monotonic approaches in logic programming and knowledge representation. We invite submissions of both long and short papers. TOPICS Conference topics include, but are not limited to: 1. Foundations of LPNMR Systems: * Semantics of new and existing languages; * Action languages, causality; * Relationships among formalisms; * Complexity and expressive power; * Inference algorithms and heuristics for LPNMR systems; * Extensions of traditional LPNMR languages such as new logical connectives or new inference capabilities; * Updates, revision, and other operations on LPNMR systems; * Uncertainty in LPNMR systems. 2. Implementation of LPNMR systems: * System descriptions, comparisons, evaluations; * Algorithms and novel techniques for efficient evaluation; * LPNMR benchmarks. 3. Applications of LPNMR: * Use of LPNMR in formalization of Commonsense Reasoning and other areas of KR; * LPNMR languages and algorithms in planning, diagnosis, argumentation, reasoning with preferences, decision making and policies; * Applications of LPNMR languages in data integration and exchange systems, software engineering and model checking; * Applications of LPNMR to linguistics, psychology, and other sciences * Integration of LPNMR systems with other computational paradigms; * Embedded LPNMR: Systems using LPNMR subsystems. SUBMISSION LPNMR 2015 welcomes submissions of long papers (13 pages) or short papers (6 pages) in the following categories: * Technical papers * System descriptions * Application descriptions The indicated number of pages includes title page, references and figures. All submissions will be peer-reviewed and accepted papers will appear in the conference proceedings published in the Springer-Verlag Lecture Notes in Artificial Intelligence (LNAI/LNCS) series. At least one author of each accepted paper is expected to register for the conference to present the work. Submissions must be formatted according to the Springer LNCS author instructions, http://www.springer.com/comp/lncs/Authors.html must be written in English, and present original research. Paper submission will be electronic through the LPNMR-15 Easychair site: https://www.easychair.org/conferences/?conf=lpnmr2015 Two best papers of general AI interest will be invited for rapid publication in the journal Artificial Intelligence - Journal - Elsevier. Two best papers with narrower logic programming focus will be invited for a rapid publication in the journal Theory and Practice of Logic Programming. MULTIPLE SUBMISSION POLICY LPNMR 2015 will not accept any paper which, at the time of submission, is under review or has already been published or accepted for publication in a journal or another conference. Authors are also required not to submit their papers elsewhere during LPNMR's review period. However, these restrictions do not apply to previous workshops with a limited audience and without archival proceedings. ASSOCIATED EVENTS WORKSHOPS - LPNMR 2015 will include specialized workshops to be held on September 27 prior to the main conference. Currently planned workshops include: - Grounding, Transforming, and Modularizing Theories with Variables Organizers: Marc Denecker, Tomi Janhunen Website: https://sites.google.com/site/gttv2015/ - Action Languages, Process Modeling, and Policy Reasoning Organizer: Joohyung Lee, Gail-Joon Ahn Website: https://sites.google.com/site/alpp2015/ - Natural Language Processing and Automated Reasoning Organizers: Marcello Balduccini, Ekaterina Ovchinnikova, Peter Schueller Website: https://sites.google.com/site/nlpar2015/ - Learning and Nonmonotonic Reasoning Organizers: Alessandra Russo and Alessandra Mileo Website: http://lnmr2015.insight-centre.org/ ASP COMPETITION - A special session dedicated to a discussion of the 6th ASP System Competition, including the methodology of the competition, benchmarks used, lessons learned and, most importantly, the results and the announcement of the winners. ALGORITHMIC DECISION THEORY (ADT) 2015 (collocated - same time and place) Algorithmic Decision Theory is a vibrant and growing area of research concerned with algorithmic aspects of problems arising in social choice and economics that involve optimal ways to aggregate preferences. The area abounds in hard computational problems and may be an axciting area of applications for ASP. The two conferences will seek ways to identify and promote synergies between their respective areas of focus. JOINT LPNMR-ADT DOCTORAL CONSORTIUM: co-Chairs: - Esra Erdem (LPNMR), Sabanci University, Turkey - Nick Mattei (ADT), NICTA, Australia More info: http://lpnmr2015.mat.unical.it/associated-events/adt-lpnmr-2015-doctoral-co… COMPLIMENTARY MEMBERSHIP OFFER FOR CONFERENCE REGISTRANTS NEW TO AAAI LPNMR 2015 is pleased to acknowledge its cooperation with the Association for the Advancement of Artificial Intelligence (AAAI) [http://www.aaai.org] which will be publicizing the conference to its membership. Of special interest to conference attendees is an introductory membership offer from AAAI, which provides a complimentary 1-year online membership to conference participants who are new to AAAI. Please send a message to membership15(a)aaai.org for further details. IMPORTANT DATES * Paper registration: April 24th, 2015, 23:59 PDT (*UPDATED*) * Paper submission: April 30th, 2015, 23:59 PDT (*UPDATED*) * Notification: June 1st, 2015 * Final versions due: June 15th, 2015 VENUE Lexington is a medium size, pleasant and quiet university town. It is located in the heart of the so-called Bluegrass Region in Central Kentucky. The city is surrounded by beautiful horse farms on green pastures dotted with ponds and traditional architecture stables, and small race tracks, and bordered by white or black fences. The Horse Museum is as beautifully located as it is interesting. Overall, the city has a nice feel that mixes well old and new. The conference will be held in the Hilton Lexington Downtown hotel. GENERAL CHAIR Victor Marek, University of Kentucky, KY, USA PROGRAM CHAIRS Giovambattista Ianni, University of Calabria, Italy Mirek Truszczynski, University of Kentucky, KY, USA WORKSHOPS CHAIR Yuliya Lierler, University of Nebrska at Omaha, NE, USA PUBLICITY CHAIR Francesco Calimeri, University of Calabria, Italy PROGRAM COMMITTEE Agostino Dovier, Università di Udine, Italy Agustín Valverde, Universidad de Màlaga, Spain Alessandra Mileo, National University of Ireland, Galway, INSIGHT Centre for Data Analytics, Ireland Andrea Formisano, Dip. di Matematica e Informatica, Università di Perugia, Italy Axel Polleres, Vienna University of Economics and Business, Austria Bart Bogaerts, Department of Computer Science, KU Leuven, Belgium Chiaki Sakama, Wakayama University, Japan Chitta Baral, Arizona State University, USA Christoph Redl, Vienna University of Technology, Austria Daniela Inclezan, Miami University, USA David Pearce, Universidad Politécnica de Madrid, Spain Emilia Oikarinen, Aalto University, Finland Enrico Pontelli, New Mexico State University, USA Esra Erdem, Sabanci University, Istanbul, Turkey Eugenia Ternovska, Simon Fraser University, Canada Fangkai Yang, Schlumberger Ltd Fangzhen Lin, Hong Kong University of Science and Technology, Hong Kong Francesco Calimeri, Università della Calabria, Italy Gerhard Brewka, Leipzig University, Germany Giovanni Grasso, Oxford University, UK Hannes Strass, Leipzig University, Germany Hans Tompits, Vienna University of Technology, Austria James Delgrande, Simon Fraser University, Canada Jia-Huai You, University of Alberta, Canada Joohyung Lee, Arizona State University, USA Jose Julio Alferes, Universidade Nova de Lisboa, Portugal Kewen Wang, Griffith University, Australia Marc Denecker, K.U.Leuven, Belgium Marcello Balduccini, Drexel University, USA Marina De Vos, University of Bath, UK Martin Gebser, Aalto University, Finland Matthias Knorr, NOVA-LINCS, Universidade Nova de Lisboa, Portugal Mauricio Osorio, Fundacion de la Universidad de las Americas, Puebla, Mexico Michael Fink, Vienna University of Technology, Austria Michael Gelfond, Texas Tech University, USA Orkunt Sabuncu, University of Potsdam, Germany Paul Fodor, Stony Brook University, USA Pedro Cabalar, University of Corunna, Spain Saadat Anwar, Arizona State University, USA Stefan Woltran, Vienna University of Technology Stefania Costantini, Dipartimento di Ingegneria e Scienze dell'Informazione, e Matematica, Univ. di L'Aquila, Italy Terrance Swift, CENTRIA, Universidade Nova de Lisboa, Portugal Thomas Eiter, Vienna University of Technology, Austria Tomi Janhunen, Aalto University, Finland Torsten Schaub, University of Potsdam, Germany Tran Cao Son, New Mexico State University, USA Vladimir Lifschitz, University of Texas at Austin, USA Wolfgang Faber, University of Huddersfield, UK Yi Zhou, University of Western Sydney, Australia Yisong Wang, Guizhou University, China Yuliya Lierler, University of Nebraska at Omaha, USA CONTACT lpnmr2015(a)mat.unical.it

1 0

CFP: FHPC 2015: Workshop on Functional High-Performance Computing [w/ICFP]
by Trevor McDonell 23 Apr '15

23 Apr '15

Apologies if you receive this message more than once. ====================================================================== CALL FOR PAPERS FHPC 2015 The 4th ACM SIGPLAN Workshop on Functional High-Performance Computing Vancouver, British Columbia, Canada, Canada September 3, 2015 https://sites.google.com/site/fhpcworkshops/ Co-located with the International Conference on Functional Programming (ICFP 2015) Submission Deadline: Friday, 15 May, 2015 (anywhere on earth) ====================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where high performance is essential. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as maintainable and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. All aspects of performance critical programming and parallel programming are in-scope for the workshop, irrespective of hardware target. This includes both traditional large-scale scientific computing (HPC), as well as work targeting single node systems with SMPs, GPUs, FPGAs, or embedded processors. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submissions due: Friday, 15 May, 2015 (anywhere on earth) * Author notification: Friday, 26 June, 2015 * Final copy due: Sunday, 19 July, 2015 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (2 column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. Typical papers are expected to be 8 pages (but up to four additional pages are permitted). Contributions to FHPC 2015 should be submitted via Easychair, at the following URL: * https://www.easychair.org/conferences/?conf=fhpc15 The submission site is now open. The FHPC workshops adhere to the ACM SIGPLAN policies regarding programme committee contributions and republication. Any paper submitted must adhere to ACM SIGPLAN's republication policy. PC member submissions are welcome, but will be reviewed to a higher standard. http://www.sigplan.org/Resources/Policies/Review http://www.sigplan.org/Resources/Policies/Republication Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm) Programme Committee: ==================== Tiark Rompf (co-chair) Purdue University, USA Geoffrey Mainland (co-chair) Drexel University, USA Kevin Brown Stanford University, USA James Cheney University of Edinburgh, UK Albert Cohen INRIA, France David Duke University of Leeds, UK Yukiyoshi Kameyama University of Tsukuba, Japan Gabriele Keller University of New South Wales, Australia Paul H J Kelly Imperial College London, UK Trevor L. Mcdonell Indiana University, USA Greg Michaelson Heriot-Watt University, UK Cosmin E. Oancea University of Copenhagen, Denmark Markus Pueschel ETH Zurich, Switzerland Sukyoung Ryu KAIST, Korea Alexander Slesarenko Huawei, Russia Josef Svenningsson Chalmers University of Technology, Sweden

1 0

Extended Deadline (May 1), VSTTE'15
by Daniel Bundala 23 Apr '15

23 Apr '15

********************************************************************** 7th Working Conference on Verified Software: Theories, Tools, and Experiments July 18 - 19, 2015 San Francisco, California, USA http://www.eecs.berkeley.edu/vstte15 Co-located with 25th Conference on Computer Aided Verification (http://i-cav.org/2015) ********************************************************************** Abstract submission: Extended to April 27, 2015 Full Paper Submission Deadline: Extended to May 1, 2015 SCOPE: The Seventh Working Conference on Verified Software: Theories, Tools, and Experiments follows a successful inaugural working conference at Zurich in 2005 followed by conferences in Toronto (2008), Edinburgh (2010), Philadelphia (2012), Atherton (2013), and Vienna (2014). The goal of this conference is to advance the state of the art in the science and technology of software verification, through the interaction of theory development, tool evolution, and experimental validation. We welcome submissions describing significant advances in the production of verified software, i.e., software that has been proved to meet its functional specifications. We are especially interested in submissions describing large-scale verification efforts that involve collaboration, theory unification, tool integration, and formalized domain knowledge. We welcome papers describing novel experiments and case studies evaluating verification techniques and technologies. Topics of interest include education, requirements modeling, specification languages, specification/verification case-studies, formal calculi, software design methods, automatic code generation, refinement methodologies, compositional analysis, verification tools (e.g., static analysis, dynamic analysis, model checking, theorem proving, satisfiability), tool integration, benchmarks, challenge problems, and integrated verification environments. PAPER SUBMISSION Papers will be evaluated by at least three members of the Program Committee. We are accepting both long (limited to 16 pages) and short (limited to 10 pages) paper submissions, written in English. Short submissions also cover Verification Pearls describing an elegant proof or proof technique. Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions must be in LNCS format and must include a cogent and self-contained description of the ideas, methods, results, and comparison to existing work. Submissions of theoretical, practical, and experimental contributions are equally encouraged, including those that focus on specific problems or problem domains. Papers should be submitted through: https://www.easychair.org/conferences/?conf=vstte2015. Submissions that arrive late, are not in the proper format, or are too long will not be considered. The post-conference proceedings of VSTTE 2015 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. The use of LaTeX and the Springer LNCS class files, obtainable fromhttp://www.springer.de/comp/lncs/authors.html, is strongly encouraged. PUBLICATION Accepted papers will be published as post-Proceedings, to appear in Springer's Lectures Notes in Computer Science. IMPORTANT DATES: Abstract submission: Extended to April 27, 2015 Full paper submission: Extended to May 1, 2015 Notification: June 8, 2015 ORGANIZATION: General Chair: Martin Schaef (SRI International) Program Chairs: Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University) Sanjit A. Seshia (University of California, Berkeley) Publicity Chair: Daniel Bundala (University of California, Berkeley) PROGRAM COMMITTEE: Elvira Albert (Complutense University of Madrid) Nikolaj Bjorner (Microsoft Research) Evan Chang (University of Colorado, Boulder) Ernie Cohen (University of Pennsylvania) Jyotirmoy Deshmukh (Toyota) Jin Song Dong (National University of Singapore) Vijay D'Silva (Google) Vijay Ganesh (University of Waterloo) Alex Groce (Oregon State) Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University) (co-chair) Bill Harris (Georgia Institute of Technology) Chris Hawblitzel (Microsoft Research) Bart Jacobs (Katholieke Universiteit Leuven, Belgium) Susmit Jha (United Technologies) Rajeev Joshi (Laboratory for Reliable Software, Jet Propulsion Laboratory) Vladimir Klebanov, Karlsruhe Institute of Technology, DE Akash Lal (Microsoft Research India) Ruzica Piskac (Yale) Zvonimir Rakamaric (University of Utah) Kristin Yvonne Rozier (University of Cincinnati) Sanjit A. Seshia (UC Berkeley) (co-chair) Natarajan Shankar (SRI) Carsten Sinz (KIT) Nishant Sinha (IBM Research Labs) Alexander Summers (ETH Zurich) Zachary Tatlock (University of Washington) Sergey Tverdyshev (Sysgo AG) Arnaud Venet (CMU / NASA Ames Research Center) Karen Yorav (IBM Haifa Research Lab) ********************************************************************** Please contact vstte2015(a)easychair.org for further information **********************************************************************

1 0

Associate Professorship in Data Science at Oxford (Continuing Education)
by Jeremy Gibbons 22 Apr '15

22 Apr '15

ASSOCIATE PROFESSORSHIP IN DATA SCIENCE DEPARTMENT OF CONTINUING EDUCATION UNIVERSITY OF OXFORD Grade 36S: £44,620 - £59,914 p.a. (pro rata) The University is seeking to appoint an Associate Professor in Data Science, to commence in October 2015 or as soon as possible thereafter. The post will be held in the Department for Continuing Education, University of Oxford. The postholder will benefit from a fellowship at Linacre College. The successful candidate must have a doctorate in data science or a cognate field, with a proven high standard of expertise in data science and appropriate knowledge of computer science, demonstrable experience of teaching and organising data science or similar programmes at university level, a proven record of research and publication, including evidence of research grant activity, academic leadership ability in the field of data science, and experience of public engagement. The postholder will have the opportunity to contribute to a wide range of provision, as appropriate to their expertise, including directing and overseeing the department's current activity and future development this disciplinary area. The postholder will be Director of Studies in Data Science, responsible for the established and well-subscribed Advanced Diploma in Data and Systems Analysis, together with the open access programmes and day/weekend schools in computer science, and will also seek to develop short/online courses for professional groups, such as school teachers, and for the wider public. The Department for Continuing Education is the leading Continuing Education department in the UK. Committed to public engagement, the department is multidisciplinary and encourages interdisciplinary teaching and research. The closing date for applications is 12.00 noon on 11 May 2015. For more information, see https://www.ox.ac.uk/about/jobs/academic/index/ac17923j/ I would be very happy to answer any questions. Jeremy 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

[Second call for participation] Spring School about Proofs of Programs using Coq
by Yann Régis-Gianas 22 Apr '15

22 Apr '15

*** Call for participation, please distribute. *** EPIT'2015 (http://www.epit2015.website) Spring School in Theoretical Computer Science Mechanizing Proofs of Programs in Coq May 25 to May 29, 2015, Frejus, France * Presentation The french spring school in theoretical computer science (EPIT) is a recurrent school which was created 40 years ago by Maurice Nivat. This year, the school is about the mechanization of proofs of programs using the proof assistant Coq. As no prerequisite is needed, the school targets any computer scientist that is curious about what a proof assistant is and how it can be integrated in its daily research work. * Program The school will take place between May 24 and May 29 and it will be divided into eight sessions. A session will consist in a (rather short) lecture (given in english) followed by practical exercises on computer. The five first sessions will be dedicated to a presentation of the main concepts and techniques used to mechanize proofs on a computer. The two next sessions will focus on the mechanization of two classical domains of theoretical computer science: the theory of rational languages and the computational combinatorics. Finally, during the last session, participants will work on the mechanization of their specific research domain with the help of the pedagogical team of the school. * Registration To get more information and to register, please go to http://www.epit2015.website Registration deadline : April 30, 2015 You can register directly by following https://www.azur-colloque.fr/DR01/AzurInscription/?&iColId=19&NaiveForm_id=… * Pedagogical committee - Pierre Letouzey (University Paris-Diderot) ; - Arthur Charguéraud (INRIA) ; - Matthieu Sozeau (INRIA) ; - Damien Pous (CNRS) ; - Assia Mahboubi (INRIA) ; - Benjamin Grégoire (INRIA). The school is organized by: - Pierre Letouzey (University Paris-Diderot) ; - Matthieu Sozeau (INRIA) ; - Yann Régis-Gianas (University Paris-Diderot) ; - Pierre-Marie Pédrot (University Paris-Diderot). If you need any information, please contact Yann Régis-Gianas (yrg at pps.univ-paris-diderot.fr).

1 0