Sciweavers

318 search results - page 41 / 64
» Garbage-first garbage collection
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 8 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
IFL
1999
Springer
108views Formal Methods» more  IFL 1999»
14 years 28 days ago
Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
John H. G. van Groningen
ICFP
1998
ACM
14 years 27 days ago
Intensional Polymorphism in Type-Erasure Semantics
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
IWMM
1998
Springer
115views Hardware» more  IWMM 1998»
14 years 26 days ago
One-Bit Counts between Unique and Sticky
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies. The first, suited to pure register transactions, is a cache of ref...
David J. Roth, David S. Wise
PLDI
1990
ACM
14 years 21 days ago
Representing Control in the Presence of First-Class Continuations
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
Robert Hieb, R. Kent Dybvig, Carl Bruggeman