TOPLAS: Vol 13, No 4

Volume 13, Issue 4Oct. 1991

Volume 13, Issue 4

Oct. 1991

Editor:

Susan L. Graham
Univ. of California at Berkeley, Berkeley

Publisher:

Association for Computing Machinery
New York
NY
United States

ISSN:0164-0925

EISSN:1558-4593

Tags:

Bibliometrics

Select All

Export Citations Save to Binder

article

Open Access

Efficiently computing static single assignment form and the control dependence graph

Pages 451–490https://doi.org/10.1145/115372.115320

article

Open Access

Techniques for debugging parallel programs with flowback analysis

Pages 491–530https://doi.org/10.1145/115372.115324

article

Open Access

Automatic generation and use of abstract structure operators

Tim Sheard

Pages 531–557https://doi.org/10.1145/115372.115369

article

Open Access

A first-come-first-served mutual-exclusion algorithm with small communication variables

Pages 558–576https://doi.org/10.1145/115372.115370

article

Open Access

A fully abstract semantics for a first-order functional language with logic variables

Pages 577–625https://doi.org/10.1145/115372.115371

article

Open Access

Type-extension type test can be performed in constant time

Norman H. Cohen

Pages 626–629https://doi.org/10.1145/115372.115297

article

Open Access

Reply to “Type-extension tests can be performed in constant time”

N. Wirth

Page 630https://doi.org/10.1145/115372.214521

article

Open Access

Subtypes and quantification

Dennis M. Volpano

Pages 631–632https://doi.org/10.1145/115372.214523

Subjects

Comments

Please enable JavaScript to view thecomments powered by Disqus.

ACM Transactions on Programming Languages and Systems

Sections

Efficiently computing static single assignment form and the control dependence graph

Techniques for debugging parallel programs with flowback analysis

Automatic generation and use of abstract structure operators

A first-come-first-served mutual-exclusion algorithm with small communication variables

A fully abstract semantics for a first-order functional language with logic variables

Type-extension type test can be performed in constant time

Reply to “Type-extension tests can be performed in constant time”

Subtypes and quantification