The Provision of Non-Strictness, Higher Kinded Types and Higher Ranked Types on an Object Oriented Virtual Machine
Thesis DisciplineComputer Science
Degree GrantorUniversity of Canterbury
Degree NameMaster of Science
We discuss the development of a number of algorithms and techniques to allow object oriented virtual machines to support many of the features needed by functional and other higher level languages. These features include non-strict evaluation, partial function application, higher ranked and higher kinded types. To test the mechanisms that we have developed we have also produced a compiler to allow the functional language Haskell to be compiled to a native executable for the Common Language Runtime. This has allowed us to demonstrate that the techniques we have developed are practically viable.
Showing items related by title, author, creator and subject.
Roberts, P. (University of Canterbury. School of Educational Studies and Human Development, 2008)This paper identifies some of the key concepts in Weil’s thought – gravity, grace, decreation, and attention – and considers their educational implications.
Dixon, K. (University of Canterbury. Department of Accounting and Information Systems, 2009)Purpose – Accounting has been shown to figure variously in New Higher Education. However, despite their infant precursors having been labelled curricular accounting (Theodossin, 1986), accounting researchers have overlooked ...
Stiles, David R. (University of Canterbury. Management, Marketing, and Entrepreneurship, 1992)The result of two years' Doctoral research into linkages between internal organisational processes and strategy implementation, this paper presents an unique methodology developed, piloted and successfully applied in ...