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 13 Issue 2, April 1991

Constant propagation with conditional branches
Mark N. Wegman, F. Kenneth Zadeck
Pages: 181-210
DOI: 10.1145/103135.103136
Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that are constant on all possible executions of a program and to propagate these constant values as far foward through the...

INC: a language for incremental computations
Daniel M. Yellin, Robert E. Strom
Pages: 211-236
DOI: 10.1145/103135.103137
An incremental computation is one that is performed repeatedly on nearly identical inputs. Incremental computations occur naturally in many environments, such as compilers, language-based editors, spreadsheets, and formatters. This article...

Dynamic typing in a statically typed language
Martín Abadi, Luca Cardelli, Benjamin Pierce, Gordon Plotkin
Pages: 237-268
DOI: 10.1145/103135.103138
Statically typed programming languages allow earlier error checking, better enforcement of diciplined programming styles, and the generation of more efficient object code than languages where all type consistency checks are performed at run...

Collecting interpretations of expressions
Paul Hudak, Jonathan Young
Pages: 269-290
DOI: 10.1145/103135.103139
A collecting interpretation of expressions is an interpretation of a program that allows one to answer questions of the sort: “What are all possible values to which an expression might evaluate during program...

Practical adaption of the global optimization algorithm of Morel and Renvoise
D. M. Dhamdhere
Pages: 291-294
DOI: 10.1145/103135.214520