Ensuring the quasi-termination of needed narrowing computations
www.sciencedirect.com › article › pii
We present a characterization of first-order functional programs which are quasi-terminating with respect to the symbolic execution mechanism of needed ...
Abstract. We present a characterization of first-order functional programs which are quasi-terminating with respect to the symbolic execu-.
We present a characterization of first-order functional programs which are quasi- terminating w.r.t. the symbolic execution mechanism of needed narrowing, ...
Author: Guadalupe Ramos, J. Silva, Josep. Vidal, Germán. Pubdate: 2007. Subject: ...
We present a characterization of first-order functional programs which are quasi-terminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., ...
We present a characterization of first-order functional programs which are quasi-terminating with respect to the symbolic execution mechanism of needed ...
cause the non-quasi-termination of needed narrowing computations. Our method ensures quasi-termination for the class of programs for which NPE is originally ...
Ensuring the quasi-termination of needed narrowing computations. JG Ramos, J Silva, G Vidal. Information processing letters 101 (5), 220-226, 2007. 4, 2007. An ...
sible needed narrowing computation is PE-terminating. Observe that a PE-terminating TRS does not ensure the quasi-termination of its computations. For ...
In this paper, we describe the implementation of a narrowing-driven partial evaluator for Curry programs which follows the offline approach to ensuring ...