Sciweavers

1882 search results - page 228 / 377
» Transformational Programming and Forests
Sort
View
POPL
2007
ACM
16 years 6 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
ICFP
2008
ACM
16 years 6 months ago
Typed iterators for XML
XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore,...
Giuseppe Castagna, Kim Nguyen
ICFP
2008
ACM
16 years 6 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
PEPM
2010
ACM
16 years 3 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
HICSS
2009
IEEE
118views Biometrics» more  HICSS 2009»
16 years 1 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