λondon HUG
London Haskell User Group
Jeremy Gibbons: Design Patterns as Higher-Order Datatype-Generic Programs
November 7, 2007 on 5:59 pm | By Neil | In |It’s meeting time again! The next meeting of the HUG will be on 14th November from 6:30PM at City University. Dr Jeremy Gibbons from the Oxford University Computing Laboratory will be giving a talk entitled Design Patterns as Higher-Order Datatype-Generic Programs. Here is the abstract:
Design patterns are reusable abstractions in object-oriented software. However, using current programming languages, these elements can only be expressed extra-linguistically: as prose, pictures, and prototypes. We believe that this is not inherent in the patterns themselves, but evidence of a lack of expressivity in the languages of today. We expect that, in the languages of the future, the code part of design patterns will be expressible as reusable library components. Indeed, we claim that the languages of tomorrow will suffice; the future is not far away. The necessary features are higher-order and datatype-generic constructs; these features are already or nearly available now. We argue the case by presenting higher-order datatype-generic programs capturing Origami, a small suite of patterns for recursive data structures.
See the venue page for details of how to get there. No specific room number has been allocated yet, so look out for signs or other recognisable Haskellers when you get there.
1 Comment
RSS feed for comments on this post. TrackBack URI
Leave a comment
Powered by WordPress and Nifty Cube with Recetas theme design by Pablo Carnaghi.
Entries and comments feeds.
Valid XHTML and CSS.
Having the video of the SPJ talk online was excellent. It would be good if this one was captured also.
Comment by Tim D — November 8, 2007 #