2013 Proceeding- Program Chairs:
- Jacques Carette,
- Jeremiah Willcock
- Sponsor:
- sigplan
It is our great pleasure to welcome you to the 9th ACM SIGPLAN Workshop on Generic Programming (WGP 2013), held in Boston, Massachusetts, on 28th September 2013. The workshop is sponsored by ACM SIGPLAN and is affiliated with the 18th ACM SIGPLAN International Conference on Functional Programming (ICFP 2013). Previous Workshops on Generic Programming have been held in Copenhagen, Tokyo, Baltimore, Edinburgh, Victoria and Portland (all affiliated with ICFP), as informal workshops in Utrecht, Dagstuhl and Nottingham, and before that, as workshops affiliated with MPC in Ponte de Lima and Marstrand.
The call for papers generated 14 submissions (with one withdrawal), which is a fair bit higher than in recent years. Three members of the programme committee evaluated each paper. We received some excellent papers: 6 were accepted almost immediately. However, these papers represented a somewhat narrower view of generic programming, and so the programme committee eventually chose to accept 2 more papers that were chosen because they were of sufficiently high quality and represented different, interesting views on generic programming.
Proceeding Downloads
Histo- and dynamorphisms revisited
Dynamic programming algorithms embody a widely used programming technique that optimizes recursively defined equations that have repeating subproblems. The standard solution uses arrays to share common results between successive steps, and while ...
Generic datatypes à la carte
Formal reasoning in proof assistants, also known as mechanization, has high development costs. Building modular reusable components is a key issue in reducing these costs. A stumbling block for reuse is that inductive definitions and proofs are closed ...
Dependent type providers
Type providers, pioneered in the F# programming language, are a practical and powerful means of gaining the benefits of a modern static type system when working with data schemas that are defined outside of the programming language, such as relational ...
N queens problem: a metaprogramming stress test for the compiler
A metaprogram solving N queens problem is written using Boost MPL library. The solution is tested using different compilers to examine the level of their practical use for complex metaprogramming tasks. The corresponding benchmark results were obtained.
...Usage of generic programming on hackage: experience report
Generic programming language constructs, tools and libraries have been available in Haskell since the first report on the programming language Haskell. At the beginning of the 1990s generic programming techniques could be used via the deriving construct,...
Multi-polymorphic programming in bondi
The bondi programming language is multi-polymorphic, in that it supports four polymorphic programming styles within a small core of computation, namely a typed pattern calculus. bondi's expressive power is illustrated by considering the problem of ...
Programming macro tree transducers
A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation ...
Generic representations of tree transformations
Applications which deal with editing of structured data over multiple iterations, such as structure editors, exercise assistants, or applications which support incremental computation, need to represent transformations between different versions of ...
Index Terms
- Proceedings of the 9th ACM SIGPLAN workshop on Generic programming