Equational Reasoning about Object-Oriented Programs

Formal verification of software can be an enormous task. This fact brought some software engineers to claim that formal verification is not feasible in practice. One possible method of supporting the verification process is a programming language that provides powerful abstraction mechanisms combined with intensive reuse of code. In this thesis we present a strongly typed functional object-oriented programming language. This language features type operators of arbitrary kind corresponding to so-called type protocols. Sub classing and inheritance is based on higher-order matching, i.e., utilizes type protocols as basic tool for reuse of code. We define the operational and axiomatic semantics of this language formally. The latter is the basis of the interactive proof assistant VOOP (Verified Object-Oriented Programs) that allows the user to prove equational properties of programs interactively.

Investigation of Theories Supporting Engagement of Resistant Learners in Formal Academic Settings and Curriculum

This study sought to explore ways to work with a group of young people through an arts-based approach to the teaching of literacy. Through the research, the author integrated her own reflexivity applying arts methods over the past decade. The author’s past experiences were strongly informed by theories such as caring theory and maternal pedagogy, which also informed the research design. The study incorporated qualitative data collection instruments comprising interviews, journals, sketches, artifacts, and teacher field notes. Data were collected by 3 student participants for the duration of the research. Study results provide educators with data on the impact of creating informal and alternative ways to teach literacy and maintain student engagement with resistant learners.