Usage counting analysis for lazy functional languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4014021 (Why is no real title available?)
- scientific article; zbMATH DE number 4016173 (Why is no real title available?)
- scientific article; zbMATH DE number 3907750 (Why is no real title available?)
- scientific article; zbMATH DE number 48517 (Why is no real title available?)
- scientific article; zbMATH DE number 177786 (Why is no real title available?)
- scientific article; zbMATH DE number 3628341 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- Analysis of functional programs to detect run-time garbage cells
- Compile-Time Garbage Collection for Higher-Order Functional Languages
- Linear logic
Cited in
(7)- scientific article; zbMATH DE number 177786 (Why is no real title available?)
- Accurate Step Counting
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Modular, higher-order cardinality analysis in theory and practice
- Storage use analysis and its applications
- Order-of-demand analysis for lazy languages
- Modular, higher order cardinality analysis in theory and practice
This page was built for publication: Usage counting analysis for lazy functional languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275747)