Date of Award

5-2011

Degree Name

MS in Computer Science

Department/Program

Computer Science

Advisor

John Clements

Abstract

Programmers forgo existing solutions to problems in other programming lan- guages where software interoperation proves too cumbersome; they remake so- lutions, rather than reuse them. To facilitate reuse, interoperation must resolve language incompatibilities transparently. To address part of this problem, we present a model of computation that resolves incompatible lazy and eager eval- uation strategies using dual notions of evaluation contexts and values to mirror the lazy evaluation strategy in the eager one. This method could be extended to resolve incompatible evaluation strategies for any pair of languages with common expressions.

defense.pdf (845 kB)
Dissertation defense slides.

Share

COinS