Abstract
It is our great pleasure to welcome you to the 7th ACM SIGPLAN Workshop on Generic Programming (WGP 2011), held in Tokyo, Japan, on 18th September 2011. The workshop is sponsored by ACM SIGPLAN and is affiliated with the 16th ACM SIGPLAN International Conference on Functional Programming (ICFP 2011). Previous Workshops on Generic Programming have been held in Baltimore (affiliated with ICFP), Marstrand (affiliated with MPC), Ponte de Lima (affiliated with MPC), Nottingham (informal workshop), Dagstuhl (IFIP TC2/IFIP WG2.1 Working Conference), Oxford (informal workshop), Utrecht (informal workshop), Portland (affiliated with ICFP), Victoria (affiliated with ICFP), and Edinburgh (affiliated with ICFP). The call for papers generated 10 submissions. Each paper was evaluated by at least three members of the programme committee with the help of additional reviewers. The quality of the submissions was very high: during a five-day virtual meeting, the programme committee selected 9 papers for presentation at the workshop. The papers cover a variety of generic programming topics, including dependently typed programming, datatype-generic programming, universe construction, generalized algebraic datatypes, category theory, and C++ concepts. We hope that the proceedings will serve as a valuable reference for both researchers and students. We note that one of the papers presented in the workshop is not included in the proceedings. This paper, "Functor is to Lens as Applicative is to Biplate: Introducing Multiplate" by Russell O'Connor, is accessible as arXiv:1103.2841v2 [cs.PL].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.