4757 search results - page 499 / 952 » Monads for Functional Programming |
186
click to vote
AAECC
2007
Springer
15 years 7 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
151
click to vote
COR
2008
15 years 7 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
183
click to vote
ASPDAC
2005
ACM
16 years 12 days ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
149
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
End-user programming tools for creating spreadsheets and webforms offer no data types except "string" for storing many kinds of data, such as person names and street add...
228
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...