Sciweavers

1989 search results - page 80 / 398
» Set functions for functional logic programming
Sort
View
FPCA
1989
14 years 2 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
ITA
2007
153views Communications» more  ITA 2007»
13 years 10 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
POPL
2009
ACM
14 years 11 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
RECSYS
2009
ACM
14 years 5 months ago
Uncovering functional dependencies in MDD-compiled product catalogues
A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of ...
Tarik Hadzic, Barry O'Sullivan
PPDP
2009
Springer
14 years 5 months ago
Scrap your boilerplate: prologically!
“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the un...
Ralf Lämmel