Interoperation for Lazy and Eager Evaluation

<p>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.</p>

Name thesis:degree_name

MS in Computer Science

Discipline thesis:degree_discipline

Computer Science

Year dc:date.available

2011

Author dc:creator

• Faught, William Jeffrey

Contributors dc:contributor

• John Clements

• lazy
• eager
• interoperation
• evaluation
• strategy
• transparency
• Computational Engineering

Identifier

10.15368/theses.2011.51

OAI identifier oai:identifier

oai:digitalcommons.calpoly.edu:theses-1524