Compact dispatch tables for dynamically typed programming languages

Simple item page
dc.contributor.authorVitek, Janen_US
dc.date.accessioned2024-08-15T20:12:06Z
dc.date.available2024-08-15T20:12:06Z
dc.date.copyright1995en_US
dc.date.issued1995
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractMessage passing is a crucial feature of any object-oriented language implementation. Even more so in dynamically typed languages, where the absence of compile-time type information forces the implementation to perform run-time type checking at each message send. Traditional techniques for the implementation of message passing in those languages favor flexibility and space efficiency over speed. This thesis explores an alternative called compact dispatch tables suited to environments with high requirements in time and space efficiency. Compact dispatch tables are one solution to achieve fast, and constant-time, message passing in dynamically typed languages and to bring them one step closer to the efficiency of statically typed languages.en
dc.format.extent91 pages
dc.identifier.urihttps://hdl.handle.net/1828/20001
dc.rightsAvailable to the World Wide Weben_US
dc.titleCompact dispatch tables for dynamically typed programming languagesen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
VITEK_JAN_MSc_1995_686581.pdf
Size:
2.6 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.