[2011/09/05] Programme updated with discussants.
[2011/08/29] All talks in the programme are moved 30 minutes later, due to the opening time of the venue.
[2011/07/13] Programme announced.
[2011/07/01] List of accepted papers announced.
[2011/06/05] In case you have questions about the deadline, and possibilities for further extensions, please contact the PC chairs.
[2011/06/01] Added a link to the submission page on Easy Chair.
[2011/05/30] The submission deadline has been extended, by two days, to Wednesday, 8th June, 2011, at Samoa time 23:59.
Each presentation slot is 40 minutes using a discussant format (25m presentation + 5m for the discussant + 10m for general discussion).
10:50 - 11:10 Tea Break
12:30 - 14:10 Lunch Break
15:30 - 16:00 Tea Break
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
programming with (C++) concepts,
programming with type classes,
programming with modules,
programming with dependent types,
object-oriented generic programming,
adaptive object-oriented programming,
and so on.
and versions of our Call-For-Paper are available online.
Dave Abrahams, BoostPro Computing, USA.
Magne Haveraaen, Universitetet i Bergen, Norway.
Akimasa Morihata, Tohoku University, Japan.
Pablo Nogueira, Universidad Politécnica de Madrid, Spain.
Ulf Norell, Chalmers University of Technology and University of Gothenberg, Sweden.
Ross Paterson, City University London, UK.
Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands.
Sibylle Schupp, Technische Universität Hamburg-Harburg, Germany.
Andrew Sutton, Texas A&M University, USA.
Tarmo Uustalu, Institute of Cybernetics, Estonia.
Here is the submission page.
We plan to have formal proceedings, published by the ACM.
Deadline for submission: Monday 2011-06-06
Notification of acceptance: Tuesday 2011-07-01
Final submission due: Monday 2011-07-25
Workshop: Sunday 2011-09-18
Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP11 EasyChair instance by the above deadline. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Each submission must adhere to SIGPLAN’s republication policy. Accepted papers are published by the ACM and will additionally appear in the ACM digital library.
Earlier Workshops on Generic Programming have been held in
Baltimore, 2010 (affiliated with ICFP 2010)
Edinburgh, UK, 2009 (affiliated with ICFP09)
Victoria, BC, Canada, 2008 (affiliated with ICFP08),
Portland, 2006 (affiliated with ICFP06),
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).
The WGP steering committee consists of J. Gibbons, R. Hinze, P. Jansson, J. Järvi, J. Jeuring, B. Oliveira, S. Schupp, and M. Zalewski. Visit the WGP Permanent Home Page for general information about WGP.