POPL
2003
ACM
13 years 10 months ago
2003
ACM
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
POPL
2003
ACM
14 years 5 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
POPL
2003
ACM
14 years 5 months ago
2003
ACM
The World-Wide Web Consortium (W3C) promotes XML and related standards, including XML Schema, XQuery, and XPath. This paper describes a formalization XML Schema. A formal semantic...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
POPL
2003
ACM
14 years 5 months ago
2003
ACM
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...