DSpace Repository

An investigation of non-determinism in functional programming languages

Show simple item record

dc.contributor.author Graham GC en
dc.date.accessioned 2016-09-22T08:10:57Z
dc.date.available 2016-09-22T08:10:57Z
dc.date.submitted 1997 en
dc.identifier.uri http://hdl.handle.net/20.500.11892/21886
dc.description.abstract This thesis investigates nondeterminism in functional programming languages. To establish a precise understanding of nondeterministic language properties, Sondergaard and Sestoft's analysis and definitions of functional language properties are adopted, as are the characterisations of weak and strong non-determinism. This groundwork is followed by a denotational semantic description of a nondeterministic language (suggested by Sondergaard and Sestoft). In this manner, a precise characterisation of the effects of strong nondeterminism is developed. Methods used to hide nondeterminism to in order to overcome or side-step the problem of strong nondeterminism in pure functional languages are defined. These different techniques ensure that functional languages remain pure but also include some of the advantages of nondeterminism. Lastly, this discussion of nondeterminism is applied to the area of functional parallel language implementation to indicate that the related problem and the possible solutions are not purely academic. This application gives rise to an interesting discussion on optimisation of list parallelism. This technique relies on the ability to decide when a bag may be used instead of a list. en
dc.language English en
dc.subject Computer Science en
dc.subject Computer programming en
dc.title An investigation of non-determinism in functional programming languages en
dc.type Masters degree en
dc.description.degree MSc en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record