Implementing Dynamic-Cut in TOY

This paper presents the integration of the optimization known as dynamic cut within the functional-logic system TOY. The implementation automatically detects deterministic functions at compile time, and includes in the generated code the test for detecting at run-time the computations that can actua...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science Vol. 177; pp. 153 - 168
Main Authors: Caballero, R., García-Ruiz, Y.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.06.2007
Subjects:
determinism
functional-logic Programming
program analysis
programming language implementation
determinism
functional-logic Programming
programming language implementation
program analysis
ISSN:1571-0661, 1571-0661
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents the integration of the optimization known as dynamic cut within the functional-logic system TOY. The implementation automatically detects deterministic functions at compile time, and includes in the generated code the test for detecting at run-time the computations that can actually be pruned. The outcome is a much better performance when executing deterministic functions including either or-branches in their definitional trees or extra variables in their conditions, with no serious overhead in the rest of the computations. The paper also proves the correctness of the criterion used for detecting deterministic functions w.r.t. the semantic calculus CRWL.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2007.01.009