Performance of lazy combinator graph reduction
Performance of lazy combinator graph reduction
299-329
Hartel, P. H.
debf0597-4832-4eb3-8243-177b5a3c44cf
March 1991
Hartel, P. H.
debf0597-4832-4eb3-8243-177b5a3c44cf
Hartel, P. H.
(1991)
Performance of lazy combinator graph reduction.
Software: Practice and Experience, 21 (3), .
This record has no associated files available for download.
More information
Published date: March 1991
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 253165
URI: http://eprints.soton.ac.uk/id/eprint/253165
PURE UUID: a576a31e-5404-4d5a-9d96-6906df3590e2
Catalogue record
Date deposited: 03 May 2000
Last modified: 10 Dec 2021 20:31
Export record
Contributors
Author:
P. H. Hartel
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics