1805 search results - page 177 / 361 » Functional programming with structured graphs |
106
click to vote
LOPSTR
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
236
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
126
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
119
click to vote
DSSCV
2005
Springer
15 years 7 months ago
2005
Springer
We show that the pre-symmetry set of a smooth surface in 3-space has the structure of the graph of a function from R2 to R2 in many cases of interest, generalising known results fo...
106
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...