136 search results - page 23 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
150
click to vote
ECOOP
2006
Springer
15 years 10 months ago
2006
Springer
A session takes place between two parties; after establishing a connection, each party interleaves local computations and communications (sending or receiving) with the other. Ses...
185
click to vote
JDA
2006
15 years 6 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
173
click to vote
MP
1998
15 years 6 months ago
1998
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
161
click to vote
CTRS
1987
15 years 10 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...
160
click to vote
JAR
2008
15 years 6 months ago
2008
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...