Sciweavers

2944 search results - page 338 / 589
» On Well Quasi-orders on Languages
Sort
View
MCMASTER
1993
15 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ICFP
2007
ACM
15 years 10 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
VISUALIZATION
1991
IEEE
15 years 10 months ago
A Scientific Visualization Synthesizer
or vectors at every mesh point may lead to a very cluttered image. Continuous coloring or data mapping, on the other hand, provide a smooth representation of the data. The use of t...
Roger Crawfis, M. J. Allison
ASPLOS
2008
ACM
15 years 8 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz
DLS
2005
176views Languages» more  DLS 2005»
15 years 8 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers