Institutional Scholarship

Static and dynamic type systems

Show simple item record

dc.contributor.advisor Wonnacott, David G. en_US Rushton, Matthew V. en_US 2007-02-28T20:24:00Z 2007-02-28T20:24:00Z 2004 en_US
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.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
dc.rights.access Open Access

Files in this item

This item appears in the following Collection(s)

Show simple item record Except where otherwise noted, this item's license is described as



My Account