An efficient algorithm for cyclic reference counting. (Q1853056)

From MaRDI portal
Revision as of 10:21, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for cyclic reference counting.
scientific article

    Statements

    title
    An efficient algorithm for cyclic reference counting. (English)
    0 references
    author
    Rafael Dueire Lins
    0 references
    publication date
    21 January 2003
    0 references
    zbMATH Keywords
    Memory management
    0 references
    Garbage collection
    0 references
    Reference counting
    0 references
    Cyclic graphs
    0 references
    describes a project that uses
    Miranda
    0 references
    Haskell
    0 references

    Identifiers

    zbMATH DE Number
    1856400
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1853056&oldid=34330529"
    Powered by MediaWiki