Sciweavers

121 search results - page 11 / 25
» Lazy abstraction
Sort
View
ACNS
2005
Springer
81views Cryptology» more  ACNS 2005»
14 years 1 months ago
Searching for High-Value Rare Events with Uncheatable Grid Computing
Abstract. High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (wh...
Wenliang Du, Michael T. Goodrich
GI
2009
Springer
14 years 3 days ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
13 years 11 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
CC
2003
Springer
201views System Software» more  CC 2003»
13 years 11 months ago
Effective Inline-Threaded Interpretation of Java Bytecode Using Preparation Sequences
Abstract. Inline-threaded interpretation is a recent technique that improves performance by eliminating dispatch overhead within basic blocks for interpreters written in C [11]. Th...
Etienne Gagnon, Laurie J. Hendren
PLILP
1995
Springer
13 years 11 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida