POPL 1996 | Sciweavers

This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...

Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum

claim paper

Read More »

23

click to vote

POPL
1996
ACM

93views Programming Languages» more POPL 1996»

Using Parameterized Signatures to Express Modular Structure

13 years 11 months ago

Download web.cecs.pdx.edu

Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...

Mark P. Jones

claim paper

Read More »

20

click to vote

POPL
1996
ACM

102views Programming Languages» more POPL 1996»

Faster Checking of Software Specifications by Eliminating Isomorphs

13 years 11 months ago

Download www.cs.cmu.edu

Daniel Jackson, Somesh Jha, Craig Damon

claim paper

Read More »

22

click to vote

POPL
1996
ACM

95views Programming Languages» more POPL 1996»

A Provably Time-Efficient Parallel Implementation of Full Speculation

13 years 11 months ago

Download www.cs.cmu.edu

that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...

John Greiner, Guy E. Blelloch

claim paper

Read More »

23

click to vote

POPL
1996
ACM

102views Programming Languages» more POPL 1996»

Iterated Register Coalescing

13 years 11 months ago