1989 search results - page 198 / 398 » Set functions for functional logic programming |
151
click to vote
SAS
1995
Springer
15 years 7 months ago
1995
Springer
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
124
Voted
CTRS
1987
15 years 7 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
124
Voted
APAL
2008
15 years 3 months ago
2008
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
117
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
114
Voted
ICCAD
2004
IEEE
16 years 11 days ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...