3713 search results - page 354 / 743 » Constructing a Calculus of Programs |
284
click to vote
PADL
2009
Springer
16 years 5 months ago
2009
Springer
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
147
click to vote
PLDI
2003
ACM
15 years 10 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
164
click to vote
IASTEDSEA
2004
15 years 6 months ago
2004
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
140
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
259
click to vote
ICFP
2009
ACM
16 years 5 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...