Generics

Download

generics@haskell.org

March 2013

2 participants
2 discussions

WGP 2013 Call for Papers
by Jacques Carette 18 Mar '13

18 Mar '13

Dear list subscribers, apologies if you receive multiple copies of this CFP. ====================================================================== CALL FOR PAPERS WGP 2013 9th ACM SIGPLAN Workshop on Generic Programming Boston, Massachusetts, USA Saturday, September 29th, 2013 http://www.wgp-sigplan.org/2013 Co-located with the International Conference on Functional Programming (ICFP 2013) ====================================================================== 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 ----------------- Jeremiah Willcock (co-chair), Indiana University Jacques Carette (co-chair), McMaster University Florian Rabe, Jacobs University Bremen Emilie Balland, INRIA Bordeaux Jeremy Siek, University of Colorado, Boulder Gabriel Dos Reis, Texas A&M University Christophe Raffalli, Savoie University Anya Helene Bagge, Universitetet i Bergen Tiark Rompf, Ecole Polytechnique Federale de Lausanne Andreas Abel, Ludwig-Maximilians-Universitat Munchen Edward Kmett, S&P Capital IQ William Cook, University of Texas, Austin Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy) Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Submission details ------------------ Deadline for submission: Friday 2013-06-14 Notification of acceptance: Wednesday 2013-07-11 Final submission due: Tuesday 2013-07-25 Workshop: Sunday 2013-09-28 Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). The length is restricted to 12 pages. 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 * Copenhagen, Denmark 2012 (affiliated with ICFP12), * Tokyo, Japan 2011 (affiliated with ICFP11), * Baltimore, Maryland, US 2010 (affiliated with ICFP10), * Edinburgh, UK 2009 (affiliated with ICFP09), * 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 ---------------------- Marcin Zalewski (chair) Bruno Oliveira Jaako Järvi Shin-Cheng Mu Andres Löh Ronald Garcia Magne Haveraaen Tim Sheard Stephanie Weirich

1 0

Research Assistantship at Oxford on Bidirectional Transformations
by Jeremy.Gibbons＠cs.ox.ac.uk 05 Mar '13

05 Mar '13

Postdoctoral Research Assistant "A THEORY OF LEAST-CHANGE FOR BIDIRECTIONAL TRANSFORMATIONS" Department of Computer Science, University of Oxford Applications are invited for a Research Fellowship on an EPSRC-funded project "A Theory of Least-Change for Bidirectional Transformations". The project is a collaboration between Professor Jeremy Gibbons in the Department of Computer Science, University of Oxford, and Dr Perdita Stevens and Dr James Cheney in the School of Informatics, University of Edinburgh. The project concerns bidirectional transformations, which are a means of maintaining consistency between multiple information sources: when one source is edited, the others may need updating to restore consistency. There are applications in model-driven engineering, database design, and program development, among others. A bidirectional transformation can be implemented in terms of several unidirectional restoring functions, one per source; but this duplicates information, wasting effort and risking inconsistencies. Bidirectional transformation languages allow one to describe the consistency relationship and the restoring functions with a single declarative specification. Our aim in this project is to study the principle of least change: that a bidirectional transformation should not make unnecessary or unnecessarily large changes when it re-establishes consistency. The primary focus of the Oxford contribution is the development of a theory of alignment for bidirectional transformations on structured data, especially in the case of non-free datatypes such as associative lists and graphs. We conjecture that the mathematics of container datatypes and combinatorial species will be particularly relevant. The Fellowship will be under the supervision of Professor Jeremy Gibbons at Oxford, and is available for three years from 31st August 2013 (or any time before that). The salary is on a standard scale, from £29,541 to £36,298 per annum. For further details, including a job description and information on how to apply, please see the webpage (http://www.cs.ox.ac.uk/news/619-full.html) If you have any questions, please write to me (jeremy.gibbons(a)cs.ox.ac.uk) Please pass this advert on to anyone you think may be interested. 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