Sciweavers

27 search results - page 1 / 6
» Automatic useless-code elimination for HOT functional progra...
Sort
View
JFP
2000
163views more  JFP 2000»
13 years 4 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
BMCBI
2006
116views more  BMCBI 2006»
13 years 4 months ago
HotSwap for bioinformatics: A STRAP tutorial
Background: Bioinformatics applications are now routinely used to analyze large amounts of data. Application development often requires many cycles of optimization, compiling, and...
Christoph Gille, Peter N. Robinson
PADO
2001
Springer
13 years 9 months ago
Deriving Pre-conditions for Array Bound Check Elimination
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
PEPM
2010
ACM
14 years 1 months ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson
FLOPS
2004
Springer
13 years 10 months ago
Derivation of Deterministic Inverse Programs Based on LR Parsing
We present a method for automatic program inversion of functional programs based on methods of LR parsing. We formalize the transformation and illustrate it with the inversion of a...
Robert Glück, Masahiko Kawabe