1989 search results - page 80 / 398 » Set functions for functional logic programming |
FPCA
1989
14 years 2 months ago
1989
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...
ITA
2007
13 years 10 months ago
2007
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...
POPL
2009
ACM
14 years 11 months ago
2009
ACM
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...
RECSYS
2009
ACM
14 years 5 months ago
2009
ACM
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 ...
PPDP
2009
Springer
14 years 5 months ago
2009
Springer
“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...