Sciweavers

2000 search results - page 279 / 400
» Program Transformation and Proof Transformation
Sort
View
143
Voted
ICFP
2008
ACM
16 years 3 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
121
Voted
PEPM
2010
ACM
16 years 17 days 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
120
Voted
HICSS
2009
IEEE
118views Biometrics» more  HICSS 2009»
15 years 10 months ago
FXplorer: Exploration of Computed Software Behavior - A New Approach to Understanding and Verification
The craft of software understanding and verification can benefit from technologies that enable evolution toward a true engineering discipline. In current practice, software develo...
Luanne Burns, Timothy Daly
126
Voted
IPSN
2009
Springer
15 years 10 months ago
Automating rendezvous and proxy selection in sensornets
As the diversity of sensornet use cases increases, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We in...
David Chu, Joseph M. Hellerstein
128
Voted
APLAS
2006
ACM
15 years 9 months ago
A Pushdown Machine for Recursive XML Processing
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
Keisuke Nakano, Shin-Cheng Mu