2000 search results - page 51 / 400 » Program Transformation and Proof Transformation |
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
ADBIS
1995
Springer
15 years 1 months ago
1995
Springer
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
GPCE
2009
Springer
15 years 2 months 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...
IANDC
2000
14 years 9 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
LPNMR
1997
Springer
15 years 2 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...