525 search results - page 68 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
WLP
2004
Springer
14 years 1 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
GPCE
2009
Springer
14 years 9 days ago
2009
Springer
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...
TPHOL
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
ENTCS
2007
13 years 7 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....