Sciweavers

1830 search results - page 48 / 366
» Functional Programs as Linked Data
Sort
View
131
Voted
ICFP
2008
ACM
16 years 2 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons
106
Voted
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 8 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
131
Voted
FUIN
2006
85views more  FUIN 2006»
15 years 2 months ago
Higher Order Deforestation
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
Geoff W. Hamilton
118
Voted
TAPSOFT
1997
Springer
15 years 6 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
114
Voted
FSS
2002
125views more  FSS 2002»
15 years 2 months ago
An "orderwise" polynomial regression procedure for fuzzy data
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
Pierpaolo D'Urso, Tommaso Gastaldi