Sciweavers

1805 search results - page 63 / 361
» Functional programming with structured graphs
Sort
View
COCOA
2007
Springer
14 years 4 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
ENTCS
2000
154views more  ENTCS 2000»
13 years 10 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 10 months ago
Realizing evaluation strategies by hierarchical graph rewriting
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
Petra Hofstedt
APLAS
2006
ACM
14 years 4 months ago
Automatic Testing of Higher Order Functions
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...
Pieter W. M. Koopman, Rinus Plasmeijer
CP
2003
Springer
14 years 3 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...