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 39 Issue 1, March 2017

Foreword
Andrew Myers
Article No.: 1
DOI: 10.1145/3052720

Limitations of Partial Compaction: Towards Practical Bounds
Nachshon Cohen, Erez Petrank
Article No.: 2
DOI: 10.1145/2994597

Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation...

Polymorphic Manifest Contracts, Revised and Resolved
Taro Sekiyama, Atsushi Igarashi, Michael Greenberg
Article No.: 3
DOI: 10.1145/2994594

Manifest contracts track precise program properties by refining types with predicates—for example, {x:Int∣ x > 0} denotes the positive integers. Contracts and polymorphism make a natural combination:...

On Subtyping-Relation Completeness, with an Application to Iso-Recursive Types
Jay Ligatti, Jeremy Blackburn, Michael Nachtigal
Article No.: 4
DOI: 10.1145/2994596

Well-known techniques exist for proving the soundness of subtyping relations with respect to type safety. However, completeness has not been treated with widely applicable techniques, as far as we’re aware.

This article develops...

SPL: An Extensible Language for Distributed Stream Processing
Martin Hirzel, Scott Schneider, Buğra Gedik
Article No.: 5
DOI: 10.1145/3039207

Big data is revolutionizing how all sectors of our economy do business, including telecommunication, transportation, medical, and finance. Big data comes in two flavors: data at rest and data in motion. Processing data in motion is stream...