uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Heap garbage collection in XSB: Practice and experience
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
2000 (English)In: PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, ISSN 0302-9743, Vol. 1753, 93-108 p.Article in journal (Refereed) Published
Abstract [en]

Starting from a theoretical understanding of the usefulness logic of a logic programming system with built-in tabling, and from a collector that did not take the characteristics of a tabled abstract machine into account we have build two heap garbage coll

Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 2000. Vol. 1753, 93-108 p.
Keyword [en]
LOGIC PROGRAMS; ALGORITHM; EFFICIENT
Identifiers
URN: urn:nbn:se:uu:diva-36494OAI: oai:DiVA.org:uu-36494DiVA: diva2:64393
Note
Addresses: Demoen B, KU Leuven, Dept Comp Sci, Louvain, Belgium. KU Leuven, Dept Comp Sci, Louvain, Belgium. Univ Uppsala, Dept Comp Sci, S-75105 Uppsala, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 381 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf