Algorithms for traversal-based generic programming

  • Authors:
  • Bryan Chadwick;Karl Lieberherr

  • Affiliations:
  • Northeastern University, Boston, MA, USA;Northeastern University, Boston, MA, USA

  • Venue:
  • Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Polytypic programming is very useful in functional languages to capture generic functionality, but is of little help to programmers in object-oriented languages. We have developed a form of polytypic programming, which is more object-oriented friendly, that we call traversal-based generic programming. The approach involves the use of several algorithms for function set generation, dispatch, and type-checking. In this paper we give an overview of our approach and a detailed account of the various algorithms involved in making traversal-based generic programming useful, safe, and efficient