Sciweavers

161 search results - page 21 / 33
» Lazy call-by-value evaluation
Sort
View
CG
2006
Springer
13 years 7 months ago
A dynamic bounding volume hierarchy for generalized collision detection
In this paper, we propose a new dynamic and efficient bounding volume hierarchy for breakable objects undergoing structured and/or unstructured motion. Our object
Thomas Larsson, Tomas Akenine-Möller
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 7 months ago
A Sequent Calculus for Modelling Interferences
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in pro...
Christophe Fouqueré
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 2 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
HASKELL
2005
ACM
14 years 1 months ago
Haskell on a shared-memory multiprocessor
Multi-core processors are coming, and we need ways to program them. The combination of purely-functional programming and explicit, monadic threads, communicating using transaction...
Tim Harris, Simon Marlow, Simon L. Peyton Jones
SAC
2008
ACM
13 years 7 months ago
XBird/D: distributed and parallel XQuery processing using remote proxy
In this paper, we focus on an aspect of distributed XQuery processing that involves data exchanges between processor elements. We first address problems of distributed XML query p...
Makoto Yui, Jun Miyazaki, Shunsuke Uemura, Hirokaz...