Sciweavers

11214 search results - page 2064 / 2243
» Just-in-time data structures
Sort
View
LISP
2008
96views more  LISP 2008»
14 years 11 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
JNW
2006
86views more  JNW 2006»
14 years 11 months ago
Throughput and Delay Analysis of Unslotted IEEE 802.15.4
The IEEE 802.15.4 standard is designed as a low power and low data rate protocol offering high reliability. It defines a beaconed and unbeaconed version. In this work, we analyze t...
Benoît Latré, Pieter De Mil, Ingrid M...
ENTCS
2007
174views more  ENTCS 2007»
14 years 11 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
ENTCS
2007
113views more  ENTCS 2007»
14 years 11 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
ENTCS
2007
100views more  ENTCS 2007»
14 years 11 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
« Prev « First page 2064 / 2243 Last » Next »