3713 search results - page 456 / 743 » Constructing a Calculus of Programs |
120
click to vote
LCTRTS
2005
Springer
15 years 9 months ago
2005
Springer
Real-time garbage collection has been shown to be feasible, but for programs with high allocation rates, the utilization achievable is not sufficient for some systems. Since a hi...
144
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
138
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
177
click to vote
SAS
1994
Springer
15 years 8 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
139
click to vote
AOSD
2007
ACM
15 years 8 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...