Design patterns as higher-order datatype-generic programs

WGP'06 - Proceedings of the ACM SIGPLAN 2006 Workshop on Generic Programming

Volumn 2006, Issue , 2006, Pages 1-12

  Gibbons, Jeremy ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Design patterns; Folds; Functional programming; Generic programming; Higher order functions; Unfolds

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; DIGITAL LIBRARIES; LINGUISTICS; OBJECT ORIENTED PROGRAMMING;

DESIGN PATTERNS; FOLDS; FUNCTIONAL PROGRAMMING; GENERIC PROGRAMMING; HIGHER-ORDER FUNCTIONS; UNFOLDS;

COMPUTER SOFTWARE;

EID: 33750906397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159861.1159863     Document Type: Conference Paper

References (50)

1. A. Alexandrescu. Modern C++ Design. Addison-Wesley, 2001.
2. M. H. Austern. Generic Programming and the STL. Addison-Wesley. 1999.
3. R. C. Backhouse, P. Jansson, J. Jeuring, and L. G. L. T. Meertens. Generic programming: An introduction. In Advanced Functional Programming, volume 1608 of Lecture Notes in Computer Science, pages 28-115, 1998.
4. R. Bird. Introduction to Functional Programming Using Haskell. Prentice-Hall, 1998.
5. R. Bird and O. de Moor. The Algebra of Programming. Prentice-Hall, 1996.
6. R. Bird, O. de Moor, and P. Hoogendijk. Generic functional programming with types and relations. Journal of Functional Programming, 6(1):1-28, 1996.
7. J. Cheney and R. Hinze. A lightweight implementation of generics and dynamics. In Haskell Workshop, pages 90-104, 2002.
8. K. Claessen and J. Hughes. Specification-based testing with QuickCheck. In Gibbons and de Moor [20], pages 17-40.
9. G. Dos Reis and J. Järvi. What is generic programming? In Library-Centric Software Design, 2005. OOPSLA workshop.
10. M. M. Fokkinga and E. Meijer. Program calculation properties of continuous algebras. Technical Report CS-R9104, CWI, Amsterdam, Jan. 1991.
11. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.
12. R. Garcia, J. Järvi, A. Lumsdaine, J. G. Siek, and J. Willcock. A comparative study of language support for generic programming. In Object-Oriented Programming, Systems, Languages, and Applications, Oct. 2003.
13. J. Gibbons. Calculating functional programs. In R. Backhouse, R. Croie, and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148-203. Springer-Verlag, 2002.
14. J. Gibbons. Origami programming. In Gibbons and de Moor [20], pages 41-60.
15. J. Gibbons. Design patterns as higher-order datatype-generic programs. http://2005.ecoop.org/8.html. June 2005. Tutorial presented at ECOOP.
16. J. Gibbons. Design patterns as higher-order datatype-generic programs, http://www.oopsla.org/2005/ShowEvent.
17. do?id=121, Oct. 2005. Tutorial presented at OOPSLA.
18. J. Gibbons. Datatype-generic programming. In Spring School on Datatype-Generic Programming. Springer-Verlag, 2006. To appear.
19. J. Gibbons. Design patterns as higher-order datatype-generic programs (full version), http://www.comlab.ox.ac.uk/ jeremy.gibbons/publications/#hodgp, June 2006.
20. J. Gibbons and B. C. d. S. Oliveira. The essence of the Iterator pattern. In T. Uustalu and C. McBride, editors, Mathematically-Structured Functional Programming, 2006.
21. J. Gibbons and O. de Moor, editors. The Fun of Programming. Cornerstones in Computing. Palgrave, 2003. ISBN 1-4039-0772-2.
22. J. Gibbons and G. Jones. The under-appreciated unfold. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, pages 273-279, Baltimore, Maryland, Sept. 1998.
23. A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In Functional Programming Languages and Computer Architecture, 1993.
24. R. Hinze. Polytypic values possess polykinded types. In R. C. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science, pages 2-27. Springer, 2000.
25. R. Hinze. Generics for the masses. Journal of Functional Programming, 2006.
26. R. Hinze and J. Jeuring. Generic Haskell: Practice and theory. In R. Backhouse and J. Gibbons, editors, Summer School on Generic Programming, volume 2793 of Lecture Notes in Computer Science, pages 1-56. Springer-Verlag, 2003.
27. R. Hinze and S. Peyton Jones. Derivable type classes. In G. Hutton, editor, Haskell Workshop, volume 41.1 of Electronic Notes in Theoretical Computer Science. Elsevier Science, Aug. 2000.
28. J. Hughes. Why functional programming matters. Computer Journal, 32(2):198-107, Apr. 1989.
29. G. Hutton. A tutorial on the universality and expressiveness of fold. Journal of Functional Programming, 9(4):355-372, July 1999.
30. P. Jansson and J. Jeuring. PolyP - a polytypic programming language extension. In Principles of Programming Languages, pages 470-482, 1997.
31. B. Jay, G. Bellè, and E. Moggi. Functorial ML. Journal of Functional Programming, 8(6):573-619, 1998.
32. C.B. Jay. A semantics for shape. Science of Computer Programming, 25:251-283, 1995.
33. G. Kiczales, J. Lamping, A. Menhdhekar, C. Maeda, C. Lopes, J.-M. Loingtier, and J. Irwin. Aspect-oriented programming. In M. Akşit and S. Matsuoka, editors. European Conference on Object-Oriented Programming, volume 1241 of Lecture Notes in Computer Science, pages 220-242. Springer-Verlag, Berlin, Heidelberg, and New York, 1997.
34. A. Löh. Exploring Generic Haskell. PhD thesis, Utrecht University, 2004.
35. G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255-279, 1990.
36. C. McBride and R. Paterson. Applicative programming with effects. Journal of Functional Programming, To appear.
37. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, pages 124-144. Springer-Verlag. 1991.
38. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML. MIT Press, revised edition, 1997.
39. P. Norvig. Design patterns in dynamic programming. In Object World, Boston. MA, May 1996. Tutorial slides at http://norvig.com/ design-patterns/.
40. B. C. d. S. Oliveira and J. Gibbons. TypeCase: A design pattern for type-indexed functions. In D. Leijen, editor, Haskell Workshop, 2005.
41. J. Palsberg and C. B. Jay. The essence of the Visitor pattern. In 22nd Annual International Computer Software and Applications Conference, pages 9-15, Vienna, Austria, August 1998.
42. L. C. Paulson. ML for the Working Programmer. Cambridge University Press, second edition, 1996.
43. S. Peyton Jones. The Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
44. G. T. Sullivan. Advanced programming language features for executable design patterns: Better patterns through reflection. Artificial Intelligence Laboratory Memo AIM-2002-005, Artificial Intelligence Lab, MIT, Mar. 2002.
45. The Programatica Team. Programatica tools for certifiable, auditable development of high-assurance systems in Haskell. In High Confidence Software and Systems Conference. National Security Agency, April 2003.
46. P. Wadler. Theorems for free! In Functional Programming and Computer Architecture, 1989.
47. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.
48. P. Wadler. Monads for functional programming. In M. Broy, editor, Program Design Calculi: Proceedings of the Marktoberdorf Summer School, 1992.
49. P. Wadler. The expression problem. Posting to java-genericity mailing list, 12th Nov 1998.
50. P. Wadler. How to solve the reuse problem? Functional programming. In Internal Conference on Software Reuse, pages 371-372. IEEE. 1998.