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 31 Issue 4, May 2009

Sequent calculi and abstract machines
Zena M. Ariola, Aaron Bohannon, Amr Sabry
Article No.: 13
DOI: 10.1145/1516507.1516508

We propose a sequent calculus derived from the λ―μμ˜-calculus of Curien and Herbelin that is expressive enough to directly represent the fine details of program evaluation using typical abstract machines. Not only does...

Program transformations using temporal logic side conditions
Sara Kalvala, Richard Warburton, David Lacey
Article No.: 14
DOI: 10.1145/1516507.1516509

This article describes an approach to program optimization based on transformations, where temporal logic is used to specify side conditions, and strategies are created which expand the repertoire of transformations and provide a suitable level of...

On the origins of bisimulation and coinduction
Davide Sangiorgi
Article No.: 15
DOI: 10.1145/1516507.1516510

The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory.

Bisimulation and bisimilarity are...

Term transformers: A new approach to state
Joseph M. Morris, Alexander Bunkenburg, Malcolm Tyrrell
Article No.: 16
DOI: 10.1145/1516507.1516511

We present a new approach to adding state and state-changing commands to a term language. As a formal semantics it can be seen as a generalization of predicate transformer semantics, but beyond that it brings additional opportunities for...

Editorial: Remembrances of things past
Keshav Pingali, Kathryn McKinley
Article No.: 17.1
DOI: 10.1145/1538824.1538825