Sciweavers

1882 search results - page 144 / 377
» Transformational Programming and Forests
Sort
View
MPC
2004
Springer
116views Mathematics» more  MPC 2004»
15 years 3 months ago
An Injective Language for Reversible Computation
Abstract. Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use e...
Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi
ECOOP
2010
Springer
15 years 2 months ago
Automatically Extracting Class Diagrams from Spreadsheets
Abstract. The use of spreadsheets to capture information is widespread in industry. Spreadsheets can thus be a wealthy source of domain information. We propose to automatically ext...
Felienne Hermans, Martin Pinzger, Arie van Deursen
HOTOS
2009
IEEE
15 years 1 months ago
FLUXO: A Simple Service Compiler
In this paper, we propose FLUXO, a system that separates an Internet service's logical functionality from the architectural decisions made to support performance, scalability...
Emre Kiciman, V. Benjamin Livshits, Madanlal Musuv...
ALGORITHMICA
2010
164views more  ALGORITHMICA 2010»
14 years 10 months ago
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
Ulrich Lauther, Tamás Lukovszki
ICFP
2009
ACM
15 years 10 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky