The suitability of CRSX for transformations on Haskell

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	van Oostrom, V.
dc.contributor.advisor	Rose, K.H.
dc.contributor.author	Rutten, K.A.
dc.date.accessioned	2012-09-26T17:01:45Z
dc.date.available	2012-09-26
dc.date.available	2012-09-26T17:01:45Z
dc.date.issued	2012
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/11657
dc.description.abstract	When compiling a program, the code is transformed several times, optimizing the code or translating to another language. Some of these transformations are, or almost are, CRSs (Combinatory Reduction Systems). CRSs are abstract systems with a lot of theoretical background: fitting a transformation in CRS can for example help prove correctness of the transformation. In recognition of the benefit CRSs can have to the compilation process, CRSX was developed: a practical implementation of CRS with extensions. This paper investigates the suitability of CRS and CRSX for transformations on programs written in Haskell.
dc.description.sponsorship	Utrecht University
dc.format.extent	479366 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.title	The suitability of CRSX for transformations on Haskell
dc.type.content	Bachelor Thesis
dc.rights.accessrights	Open Access
dc.subject.keywords	rewriting, CRS, CRSX, lambda calculus, Haskell
dc.subject.courseuu	Kunstmatige Intelligentie