The polymorphic imperative: A generic approach to in-place update

Jay, CB; Lu, HY; Nguyen, QT

The polymorphic imperative: A generic approach to in-place update

Jay, CB

Lu, HY

Nguyen, QT

Permalink

Publication Type:: Journal Article
Citation:: Electronic Notes in Theoretical Computer Science, 2004, 91 pp. 195 - 211
Issue Date:: 2004-02-16

Closed Access

	Filename	Description	Size
	2006007871OK.pdf		246.19 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Jay, CB https://orcid.org/0000-0001-8654-4305	en_US
dc.contributor.author	Lu, HY https://orcid.org/0000-0001-5655-0237	en_US
dc.contributor.author	Nguyen, QT	en_US
dc.date.issued	2004-02-16	en_US
dc.identifier.citation	Electronic Notes in Theoretical Computer Science, 2004, 91 pp. 195 - 211	en_US
dc.identifier.issn	1571-0661	en_US
dc.identifier.uri	http://hdl.handle.net/10453/10433
dc.description.abstract	The constructor calculus supports generic operations defined over arbitrary data types including abstract data types. This paper extends the basic constructor calculus to handle constructed locations. The resulting calculus is able to define a generic assignment operation that performs in-place whenever appropriate and allocates fresh memory otherwise. This approach may eliminate many of the space overheads associated with higher-order polymorphic languages. In combination with existing generic programming techniques it can express some very powerful algorithms such as the visitor pattern. © 2004 Published by Elsevier B.V.	en_US
dc.relation	http://purl.org/au-research/grants/arc/A10010019
dc.relation.ispartof	Electronic Notes in Theoretical Computer Science	en_US
dc.relation.isbasedon	10.1016/j.entcs.2003.12.013	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	The polymorphic imperative: A generic approach to in-place update	en_US
dc.type	Journal Article
utslib.citation.volume	91	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	1702 Cognitive Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	91	en_US

Abstract:

The constructor calculus supports generic operations defined over arbitrary data types including abstract data types. This paper extends the basic constructor calculus to handle constructed locations. The resulting calculus is able to define a generic assignment operation that performs in-place whenever appropriate and allocates fresh memory otherwise. This approach may eliminate many of the space overheads associated with higher-order polymorphic languages. In combination with existing generic programming techniques it can express some very powerful algorithms such as the visitor pattern. © 2004 Published by Elsevier B.V.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/10433