ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 26 Issue 6, November 2004

The pattern calculus
C. Barry Jay
Pages: 911-937
DOI: 10.1145/1034774.1034775

There is a significant class of operations such as mapping that are common to all data structures. The goal of generic programming is to support these operations on arbitrary data types without having to recode for each new type. The pattern...

A fast, memory-efficient register allocation framework for embedded systems
Sathyanarayanan Thammanur, Santosh Pande
Pages: 938-974
DOI: 10.1145/1034774.1034776

In this work, we describe a "just-in-time," <i>usage density-based register allocator</i> geared toward embedded systems with a limited general-purpose register set wherein speed, code size, and memory requirements are of equal concern....

Automatic tiling of iterative stencil loops
Zhiyuan Li, Yonghong Song
Pages: 975-1028
DOI: 10.1145/1034774.1034777

Iterative stencil loops are used in scientific programs to implement relaxation methods for numerical simulation and signal processing. Such loops iteratively modify the same array elements over different time steps, which presents opportunities...

A tail-recursive machine with stack inspection
John Clements, Matthias Felleisen
Pages: 1029-1052
DOI: 10.1145/1034774.1034778

Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that...