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 14 Issue 2, April 1992

The Euclidean definition of the functions div and mod
Raymond T. Boute
Pages: 127-144
DOI: 10.1145/128861.128862
The definitions of the functions div and mod in the computer science literature and in programming languages are either similar to the Algol of Pascal definition (which is shown to be an unfortunate choice) or based on division by truncation...

Guest editor's introduction to the special section on the third international conference on computer languages
Alexander L. Wolf
Pages: 145-146
DOI: 10.1145/128861.128863

A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics
Carsten K. Gomard
Pages: 147-172
DOI: 10.1145/128861.128864
We describe theoretical and a few practical aspects of an implemented self-applicable partial evaluator for the untyped lambda calculus with constants, conditionals, and a fixed point operator. The purpose of this paper is first to...

Incremental global reoptimization of programs
Lori L. Pollock, Mary Lou Soffa
Pages: 173-200
DOI: 10.1145/128861.128865
Although optimizing compilers have been quite successful in producing excellent code, two factors that limit their usefulness are the accompanying long compilation times and the lack of good symbolic debuggers for optimized code. One approach to...

An object-based programming model for shared data
Gail E. Kaiser, Brent Hailpern
Pages: 201-264
DOI: 10.1145/128861.128866
The classical object model supports private data within objects and clean interfaces between objects, and by definition does not permit sharing of data among arbitrary objects. This is a problem for real-world applications, such as advanced...

Cache behavior of combinator graph reduction
Philip J. Koopman, Jr., Peter Lee, Daniel P. Siewiorek
Pages: 265-297
DOI: 10.1145/128861.128867
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that, for similar kinds of combinator graphs on similar kinds of...