|09:10||Bruno C. d. S. Oliveira. //Functional Programming, Object-Oriented Programming and Algebras!// (invited talk)|
|10:30||Larry Diehl and Tim Sheard. //Generic Constructors and Eliminators from Descriptions// (discussant: Alexander Slesarenko)|
|11:00||Thomas Williams, Pierre-Évariste Dagand and Didier Rémy. //Ornaments in Practice// (discussant: Nada Amin)|
|11:30||Matthew Roberts and Tony Sloane. //Type Inference for the Spine View of Data// (discussant: Meng Wang)|
|14:00||Alexander Slesarenko, Alexander Filippov and Alexey Romanov. //First-class Isomorphic Specialization by Staged Evaluation// (discussant: Tiark Rompf)|
|14:30||Sam Lindley. //Algebraic Effects and Effect Handlers for Idioms and Arrows// (discussant: Dominic Orchard)|
|15:00||Larisse Voufo, Marcin Zalewski and Andrew Lumsdaine. //Scoping Rules on a Platter – A Framework for Understanding and Specifying Name Binding// (discussant: Ilya Sergey)|
|16:00||Patrick Bahr. //Composing and Decomposing Data Types – A Closed Type Families Implementation of Data Types à la Carte// (discussant: Wouter Swierstra)|
|16:30||Edsko de Vries and Andres Löh. //True Sums of Products// (discussant: Patrik Jansson)|
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
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.
Submitted papers should fall into one of two categories:
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 EasyChair at https://www.easychair.org/conferences/?conf=wgp2014
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).
The call for papers is available as a text file.
|Deadline for submission||2014-05-15 (Thursday, extended)|
|Notification of acceptance||2014-06-06 (Friday)|
|Final submission due||2014-06-18 (Wednesday)|
José Pedro Magalhães (co-chair), University of Oxford
Tiark Rompf (co-chair), Oracle Labs & EPFL
Peter Achten, Radboud University Nijmegen
Nada Amin, Ecole Polytechnique Fédérale de Lausanne (EPFL)
Pierre-Évariste Dagand, INRIA Paris-Rocquencourt
Fritz Henglein, University of Copenhagen
Andrew Lumsdaine, Indiana University
Alexander Slesarenko, Huawei Labs & Keldysh Institute of Applied Mathematics (KIAM)
Anthony M. Sloane, Macquarie University
Wouter Swierstra, Utrecht University
Meng Wang, Chalmers University of Technology