Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICFP

1999

ACM

1999

ACM

Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequential programs admit the deﬁnition of optimal computation strategies and are the basis of several recent (lazy) functional logic languages. In this paper, we deﬁne a partial evaluator for inductively sequential functional logic programs. We prove strong correctness of this partial evaluator and show that the nice properties of inductively sequential programs carry over to the specialization process and the specialized programs. In particular, the structure of the programs is preserved by the specialization process. This is in contrast to other partial evaluation methods for functional logic programs which can destroy the original program structure. Finally, we present some experiments which highlight the practical advantages of our approach.

Related Content

Added |
02 Aug 2010 |

Updated |
02 Aug 2010 |

Type |
Conference |

Year |
1999 |

Where |
ICFP |

Authors |
María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal |

Comments (0)