Gupta, Jai Prakash and Kumar, Padam and Winter, Stephen and Wilson, Derek R. (1990) Implementing pattern-matching function definitions in CTDNet - a multiprocessor architecture. Microprocessing & Microprogramming, 28 (1). pp. 151-155. ISSN 0165-6074
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/0165-6074(90)90165-6
Functional languages use a construct known as pattern-matching, for defining functions. The function definition can be translated into pattern-matching lambda abstraction — a construct in enriched lambda calculus. In this paper a semantics for pattern-matching has been developed and implemented in a multiprocessor architecture — CTDNet. Most general case of pattern-matching with multiple equations and multiple arguments has been discussed. A formal strategy employing parallel execution rather than sequential has been developed to exploit the multiprocessor environment. At the same time the dynamic graph size is kept under check by postponing the work of substitution of arguments into various abstraction bodies until a succesful match is obtained. All the pattern-matching work is thus taken up in parallel but only the matched body is evaluated, the rest being discarded.
|Research Community:||University of Westminster > Electronics and Computer Science, School of|
|Deposited On:||20 Sep 2011 14:16|
|Last Modified:||20 Sep 2011 14:16|
Repository Staff Only: item control page