Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms Commons

Open Access. Powered by Scholars. Published by Universities.®

2012

Electronic Theses and Dissertations

Articles 1 - 1 of 1

Full-Text Articles in Theory and Algorithms

Connotational Subtyping And Runtime Class Mutability In Ruby, Ian S. Dillon Dec 2012

Connotational Subtyping And Runtime Class Mutability In Ruby, Ian S. Dillon

Electronic Theses and Dissertations

Connotational subtyping is an approach to typing that allows an object's type to change dynamically, following changes to the object's internal state. This allows for a more precise representation of a problem domain with logical objects that have variable behavior. Two approaches to supporting connotational subtyping in the Ruby programming language were implemented: a language-level implementation using pure Ruby and a modification to the Ruby 1.8.7 interpreter. While neither implementation was wholly successful the language level implementation created complications with reflective language features like self and super and, while Ruby 1.8.7 has been obsoleted by Ruby 1.9 (YARV), the results …