Efficient Intensional Implementation for Lazy Functional Languages

Charalambidis, A; Grivas, A; Papaspyrou, N; Rondogiannis, P

dc.contributor.author	Charalambidis, A	en
dc.contributor.author	Grivas, A	en
dc.contributor.author	Papaspyrou, N	en
dc.contributor.author	Rondogiannis, P	en
dc.date.accessioned	2014-03-01T01:56:41Z
dc.date.available	2014-03-01T01:56:41Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28217
dc.subject	Functional Language	en
dc.subject	Functional Programming	en
dc.subject	Higher-order Functions	en
dc.subject	Higher Order	en
dc.title	Efficient Intensional Implementation for Lazy Functional Languages	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s11786-008-0047-5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s11786-008-0047-5	en
heal.publicationDate	2008	en
heal.abstract	The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional pro- gram by introducing appropriate context manipulation operators. The transformation can be applied to a significant class of higher-order pro- grams and results in equivalent zero-order intensional programs that can be executed in a simple demand-driven way. Despite its simplicity, the	en
heal.journalName	Mathematics in Computer Science	en
dc.identifier.doi	10.1007/s11786-008-0047-5	en