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 20 Issue 4, July 1998

Proofs about a folklore let-polymorphic type inference algorithm
Oukseh Lee, Kwangkeun Yi
Pages: 707-723
DOI: 10.1145/291891.291892
The Hindley/Milner let-polymorphic type inference system has two different algorithms: one is the de factostandard Algorithm W that is bottom-up (or context-insensitive), and...

A region inference algorithm
Mads Tofte, Lars Birkedal
Pages: 724-767
DOI: 10.1145/291891.291894
Region Inference is a program analysis which infers lifetimes of values. It is targeted at a runtime model in which the store consists of a stack of regions and memory management predominantly consists of pushing and popping regions, rather than...

Partial evaluation of functional logic programs
María Alpuente, Moreno Falaschi, Germán Vidal
Pages: 768-844
DOI: 10.1145/291891.291896
Languages that integrate functional and logic programming with a complete operational semantics are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction principle of functional languages and the resolution...

A practical and flexible flow analysis for higher-order languages
J. Michael Ashley, R. Kent Dybvig
Pages: 845-868
DOI: 10.1145/291891.291898
A flow analysis collects data-flow and control-flow information about programs. A compiler can use this information to enable optimizations. The analysis described in this article unifies and extends previous work on flow analysis for...

Automatic data layout for distributed-memory machines
Ken Kennedy, Ulrich Kremer
Pages: 869-916
DOI: 10.1145/291891.291901
The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a simple yet efficient machine-independent parallel programming model. After the algorithm selection, the data layout choice is the key intellectual challenge...