1882 search results - page 80 / 377 » Transformational Programming and Forests |
IFIP
1992
Springer
15 years 1 months ago
1992
Springer
In microarchitecure synthesis, early algorithms considered only a single implementation technique for IF -statements. Focus was on scheduling and on maximum hardware sharing. In t...
IJFCS
2008
14 years 9 months ago
2008
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
IPL
2007
14 years 9 months ago
2007
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
FPCA
1995
15 years 1 months ago
1995
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...