2008 Proceeding- Program Chairs:
- Ralf Hinze,
- Don Syme
- Sponsor:
- sigplan
It is our great pleasure to welcome you to the ACM SIGPLAN Workshop on Generic Programming 2008 - WGP 2008, held in Victoria, Canada, on 20th September 2008. The workshop is sponsored by ACM SIGPLAN and is affiliated with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008). Previous Workshops on Generic Programming have been held in 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) and Portland (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. During a five-day virtual meeting, the programme committee selected 6 papers for presentation at the workshop. The papers cover a variety of topics, including software architectures, data abstraction, and generic programming in a dependently typed setting. We hope that the proceedings will serve as a valuable reference for both researchers and students.
Proceeding Downloads
A functional model-view-controller software architecture for command-oriented programs
Command-oriented functional programs are currently structured in an ad hoc way that makes the development of multiple user-interfaces difficult and error prone, and makes it difficult to abstractly understand a program's command-oriented behavior. To ...
A lightweight approach to datatype-generic rewriting
Previous implementations of generic rewriting libraries have a number of limitations: they require the user to either adapt the datatype on which rewriting is applied, or the rewriting rules are specified as functions, which makes it hard or impossible ...
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as "list of". Most approaches to datatype-generic programming are developed in the lazy functional programming language Haskell. We argue ...
A comparison of c++ concepts and haskell type classes
Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Since each language that meets all criteria is considered generic, those criteria are not fine-grained enough to ...
Polytypic programming in COQ
The aim of our work is to provide an infrastructure for formal proofs over Generic Haskell-style polytypic programs. For this goal to succeed, we must have a definition of polytypic programming which is both fully formal and as close as possible to the ...
Bialgebra views: a way for polytypic programming to cohabit with data abstraction
Polytypic programming and data abstraction are important concepts in designing functional programs, but they do not fit well together. Polytypic programming currently depends on making public a free data type representation, while data abstraction ...
