Institutional Scholarship

Programming in Algorithms : Generic Programming and its Implementation

Show simple item record

dc.contributor.author Giovannelli, Daniel
dc.date.accessioned 2013-07-26T13:03:01Z
dc.date.available 2013-07-26T13:03:01Z
dc.date.issued 2013
dc.identifier.uri http://hdl.handle.net/10066/11492
dc.description.abstract The decisions which language designers make when implementing new features, and the effects which those decisions have on a finished language, is a fascinating field of study which has been largely overlooked by many programming language researchers. In this paper, we will explore the implementation of generic programming, a powerful programming technique, in four modern programming languages (C++, C#, Java, and Haskell). We discuss the process of designing each implementation and how those design choices affect their use in each language. In doing so, we build a coherent theory of trade-offs in language design and how those trade-offs can be minimized.
dc.description.sponsorship Haverford College. Department of Computer Science
dc.language.iso eng
dc.rights.uri http://creativecommons.org/licenses/by-nc/3.0/us/
dc.subject.lcsh Computer algorithms
dc.subject.lcsh Computer programming
dc.title Programming in Algorithms : Generic Programming and its Implementation
dc.type Thesis
dc.rights.access Haverford users only until 2020-01-01, afterwards Open Access.


Files in this item

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc/3.0/us/ Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc/3.0/us/

Search


Browse

My Account