Sciweavers

349 search results - page 57 / 70
» Garbage Collection Hints
Sort
View
CL
2000
Springer
14 years 2 days ago
Promoting Constraints to First-Class Status
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...
Tobias Müller
ICFP
1999
ACM
14 years 1 days 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
14 years 1 days 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»
14 years 2 hour 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
13 years 12 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...