While almost all functional languages rely on garbage col- lection for implicit memory management, the needs of efficient array processing are better suited by reference counting. The opportunities to reclaim unused memory immediately and to implement functionally sound array operations by destructive in-place updates turn out to be essential for approaching the performance achieved by imperative lan- guages. In this paper we outline the realization of implicit memory management in the functional array language SaC. Starting with basic schemes for the introduction of memory management and reference counting instructions into SaC code, the emphasis is laid on a range of optimizations that aim at reducing runtime overhead and exploiting memory reuse opportuni- ties.
|Publication status||Published - 01.01.2004|
|Event||16th International Workshop on Implementation and Application of Functional Languages - Lübeck, Germany|
Duration: 08.09.2004 → 10.09.2004
Conference number: 65620
|Conference||16th International Workshop on Implementation and Application of Functional Languages|
|Abbreviated title||IFL 2004|
|Period||08.09.04 → 10.09.04|