Compile-Time Garbage Collection for Higher-Order Functional Languages

DOI10.1093/LOGCOM/2.4.483zbMATH Open0783.68028OpenAlexW2093229225MaRDI QIDQ5285986FDOQ5285986

Authors: Simon Hughes 

Publication date: 29 June 1993

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/2.4.483

Recommendations

• scientific article
• Analysis of functional programs to detect run-time garbage cells
• scientific article; zbMATH DE number 2085272
• scientific article; zbMATH DE number 1332627

zbMATH Keywords

optimizationfunctional languagescompile-time garbage collectiongeneration analysisinheritance analysis

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Usage counting analysis for lazy functional languages
• Automatic Space Bound Analysis for Functional Programs with Garbage Collection
• Garbage Collection for Reversible Functional Languages
• Analysis of functional programs to detect run-time garbage cells
• A fully concurrent garbage collector for functional programs on multicore processors
• Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach
• Title not available (Why is that?)

This page was built for publication: Compile-Time Garbage Collection for Higher-Order Functional Languages

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