Static and dynamic type systems

TRICERATOPS

TriCollege Digital Repository

Static and dynamic type systems

Show simple item record

dc.contributor.advisor Wonnacott, David G. en_US
dc.contributor.author Rushton, Matthew V. en_US
dc.date.accessioned 2007-02-28T20:24:00Z
dc.date.available 2007-02-28T20:24:00Z
dc.date.issued 2004 en_US
dc.identifier.uri http://hdl.handle.net/10066/624
dc.description.abstract This paper demonstrates the advantages and disadvantages of static and dynamic type systems. This is done through careful exposition of various implementations. As a motivating example, a subset of the ML language is used to investigate the Hindley-Milner type inference algorithm to which an original extension is made en_US
dc.description.sponsorship Haverford College. Dept. of Computer Science en_US
dc.format.extent 194857 bytes en_US
dc.format.extent 64699 bytes
dc.format.mimetype application/pdf en_US
dc.format.mimetype text/plain
dc.language.iso en_US en_US
dc.rights.uri http://creativecommons.org/licenses/by-nc/3.0/us/
dc.subject.lcsh Type theory
dc.subject.lcsh ML (Computer program language)
dc.subject.lcsh Programming languages (Electronic computers)
dc.title Static and dynamic type systems en_US
dc.type Thesis (B.S.) en_US


Files in this item

Files Description Size Format
2004RushtonM.pdf Thesis 190.2Kb PDF
2004_Rushton_release.pdf ** Archive Staff Only ** 87.41Kb PDF

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/