A type and effect system for implementing functional arrays with destructive updates

Korfiatis, G; Papakyriakou, M; Papaspyrou, N

dc.contributor.author	Korfiatis, G	en
dc.contributor.author	Papakyriakou, M	en
dc.contributor.author	Papaspyrou, N	en
dc.date.accessioned	2014-03-01T02:52:51Z
dc.date.available	2014-03-01T02:52:51Z
dc.date.issued	2011	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36113
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-83155189126&partnerID=40&md5=022108137b18acd5cf8966e0ad7824b1	en
dc.subject.other	Efficient implementation	en
dc.subject.other	Functional arrays	en
dc.subject.other	Functional languages	en
dc.subject.other	Imperative programming	en
dc.subject.other	Type and effect systems	en
dc.subject.other	Write operations	en
dc.subject.other	Data structures	en
dc.subject.other	Information systems	en
dc.subject.other	Computer science	en
dc.title	A type and effect system for implementing functional arrays with destructive updates	en
heal.type	conferenceItem	en
heal.identifier.secondary	6078196	en
heal.publicationDate	2011	en
heal.abstract	It can be argued that some of the benefits of purely functional languages are counteracted by the lack of efficient and natural-to-use data structures for these languages. Imperative programming is based on manipulating data structures destructively, e.g., updating arrays in-place; however, doing so in a purely functional language violates the language's very nature. In this paper, we present a type and effect system for an eager purely functional language that tracks array usage, i.e., read and write operations, and enables the efficient implementation of purely functional arrays with destructive update. © 2011 Polish Info Processing Soc.	en
heal.journalName	2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011	en
dc.identifier.spage	879	en
dc.identifier.epage	886	en