Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach

DOI10.1016/0020-0190(95)00131-UzbMATH Open0875.68146WikidataQ127866111 ScholiaQ127866111MaRDI QIDQ1350217

O. Diekmann

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Garbage collectionAbstract architecturesClosure reductionTIM

Mathematics Subject Classification ID

Computer system organization (68M99)

Cites Work

• A nonrecursive list compacting algorithm

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Concurrent garbage collection for concurrent rewriting 👍 👎
• Compile-Time Garbage Collection for Higher-Order Functional Languages 👍 👎

This page was built for publication: Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350217)