Sciweavers

319 search results - page 56 / 64
» Age-Based Garbage Collection
Sort
View
ICFP
1999
ACM
15 years 1 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
EUROMICRO
1999
IEEE
15 years 1 months ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen
IFL
1999
Springer
108views Formal Methods» more  IFL 1999»
15 years 1 months 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
81
Voted
ICFP
1998
ACM
15 years 1 months 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»
15 years 1 months 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