WestminsterResearch will not be accepting deposits until 9th March 2015. This is to allow for a system upgrade and server migration.

CTDNet III-An eager reduction model with laziness features

Kumar, Padam and Gupta, Jai Prakash and Winter, Stephen (1995) CTDNet III-An eager reduction model with laziness features. Future Generation Computer Systems, 11 (3). pp. 273-282. ISSN 0167-739X

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/0167-739X(95)00004-C


A message passing multiprocessor model for computation based on functional languages has been suggested. The model follows the applicative (eager) order of reduction, giving it an edge in exploiting parallelism over those following normal order. However, the applicative strategy is prone to being unsafe and is incapable of handling recursion. A concept of Partial task has been introduced whose sluggishness in reduction is utilised to achieve a controlled version of recursion. The model has certain other features which make it selectively lazy so that the reduction tends to be more need-based and hence more safe.

Item Type:Article
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:9774
Deposited On:20 Sep 2011 12:39
Last Modified:20 Sep 2011 12:39

Repository Staff Only: item control page