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.
Savage, E. D. (University of Canterbury. Physics, 1999)This thesis provides primarily a full and frank review of the many roles the SO(3) algebra of quasispin has to play in nuclear, atomic and ligand-field theory. It is shown that the intriguing conclusion drawn by Ceulemans ...
Harvey, Benjamin Manson (University of Canterbury. Biochemistry, 1997)The optimum method of screening for laccase in higher plant leaves was ascertained, and the method used to screen a number of plants. Four fruits from trees of the genus Prunus were also screened for laccase. A novel laccase ...
Moving towards inclusive education : how inclusive education is understood, experienced and enacted in Nepali higher secondary schools. Thapaliya, Mukti Prakash (University of Canterbury, 2018)Inclusive education is the provision of free quality universal education for all children. This includes children who are considered marginalised and oppressed, ethnic minorities and disabled. In line with the philosophy ...