5086 search results - page 274 / 1018 » The Power of Comparative Reasoning |
198
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
167
click to vote
ICFP
2001
ACM
16 years 6 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
181
click to vote
CADE
2004
Springer
15 years 12 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
165
click to vote
LOPSTR
1994
Springer
15 years 10 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
167
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...