Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
 

Summary: Measuring the Effectiveness of Partial
Evaluation in Functional Logic Languages
Elvira Albert1
, Sergio Antoy2
, and Germ´an Vidal1
1
DSIC, Technical University of Valencia, {ealbert,gvidal}@dsic.upv.es
2
Department of Computer Science, Portland State University, antoy@cs.pdx.edu
Abstract. We introduce a framework for assessing the effectiveness of
partial evaluators in functional logic languages. Our framework is based
on properties of the rewrite system that models a functional logic pro-
gram. Consequently, our assessment is independent of any specific lan-
guage implementation or computing environment. We define several cri-
teria for measuring the cost of a computation: number of steps, number of
function applications, and pattern matching effort. Most importantly, we
express the cost of each criterion by means of recurrence equations over
algebraic data types, which can be automatically inferred from the par-
tial evaluation process itself. In some cases, the equations can be solved
by transforming their arguments from arbitrary data types to natural

  

Source: Alpuente, María - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València
Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences