Programming Languages and Systems (TOPLAS)


Search Issue
enter search term and/or author name


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 29 Issue 1, January 2007

A constraint-based approach to guarded algebraic data types
Vincent Simonet, François Pottier
Article No.: 1
DOI: 10.1145/1180475.1180476
We study HMG(X), an extension of the constraint-based type system HM(X) with deep pattern matching, polymorphic recursion, and guarded algebraic data types. Guarded algebraic data types subsume the concepts known in the...

Profile-based pretenuring
Stephen M. Blackburn, Matthew Hertz, Kathryn S. Mckinley, J. Eliot B. Moss, Ting Yang
Article No.: 2
DOI: 10.1145/1180475.1180477
Pretenuring can reduce copying costs in garbage collectors by allocating long-lived objects into regions that the garbage collector will rarely, if ever, collect. We extend previous work on pretenuring as follows: (1) We produce pretenuring advice...

PPMexe: Program compression
Milenko Drinić, Darko Kirovski, Hoi Vo
Article No.: 3
DOI: 10.1145/1180475.1180478
With the emergence of software delivery platforms, code compression has become an important system component that strongly affects performance. This article presents PPMexe, a compression mechanism for program binaries that analyzes their syntax and...

A static type system for JVM access control
Tomoyuki Higuchi, Atsushi Ohori
Article No.: 4
DOI: 10.1145/1180475.1180479
This article presents a static type system for the Java virtual machine (JVM) code that enforces an access control mechanism similar to that found in a Java implementation. In addition to verifying type consistency of a given JVM code, the type...

Type-based publish/subscribe: Concepts and experiences
Patrick Eugster
Article No.: 6
DOI: 10.1145/1180475.1180481
A continuously increasing number of interconnected computer devices makes the requirement for programming abstractions for remote one-to-many interaction yet more stringent. The publish/subscribe paradigm has been advocated as a candidate abstraction...

Program termination analysis in polynomial time
Amir M. Ben-Amram, Chin Soon Lee
Article No.: 5
DOI: 10.1145/1180475.1180480
A size-change termination algorithm takes as input abstract information about a program in the form of size-change graphs and uses it to determine whether any infinite computation would imply that some data decrease in size infinitely....