An integration of reduction and logic for programming languages

dc.contributor.advisor	Riordan, Denis
dc.contributor.author	Wright, David A
dc.date.accessioned	2026-03-04T08:21:57Z
dc.date.issued	1988
dc.description.abstract	A new declarative language is presented which captures the expressibility of both logic programming languages and functional languages. This is achieved by conditional graph rewriting, with full unification as the parameter passing mechanism. The syntax and semantics are described both formally and informally, and examples are offered to support the expressibility claim made above. The language design is of further interest due to its uniformity and the inclusion of a novel mechanism for type inference in the presence of derived type hierarchies
dc.description.degree	Master's thesis
dc.description.degree	MSc
dc.format.extent	67 pages
dc.format.mimetype	application/pdf
dc.identifier.other	http://hdl.handle.net/10962/d1002035
dc.identifier.uri	https://researchrepository.ru.ac.za/handle/123456789/5781
dc.language	English
dc.publisher	Rhodes University, Faculty of Science, Department of Computer Science
dc.rights	Wright, David A
dc.subject	Logic programming languages
dc.subject	Programming languages (Electronic computers)
dc.title	An integration of reduction and logic for programming languages
dc.type	Academic thesis

Files

Now showing 1 - 1 of 1