Implementing Dynamic-Cut in TOY

Spanish Open Consortia

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback Report a problem Satisfaction survey

Implementing Dynamic-Cut in TOY

Source

Electronic Notes in Theoretical Computer Science (ENTCS) archive
Volume 177 , (June 2007) table of contents

Pages: 153-168

Year of Publication: 2007

ISSN:1571-0661

Authors

R. Caballero	Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Madrid, Spain
Y. García-Ruiz	Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Madrid, Spain

Publisher

Elsevier Science Publishers B. V. Amsterdam, The Netherlands, The Netherlands

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Find similar Articles Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	10.1016/j.entcs.2007.01.009

ABSTRACT

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	[1]	Antoy, S., Definitional trees. In: LNCS, number 632. pp. 143-157.
	[2]	Antoy, S., Echahed, R. and Hanus, M., A needed narrowing strategy. Journal of the ACM. v47. 776-822.
	[3]	Caballero, R. and López-Fraguas, F., Dynamic-cut with definitional trees. In: LNCS, number 2441. pp. 245-258.
	[4]	Caballero, R. and López-Fraguas, F., Improving deterministic computations in lazy functional logic languages. Journal of Functional and Logic Programming. v2003.
	[5]	González-Moreno, J., Hortalá-González, M., López-Fraguas, F. and Rodríguez-Artalejo, M., An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming. v40. 47-87.
	[6]	http://www.informatik.uni-kiel.de/curry/papers/report.pdf
	[7]	citeseer.ist.psu.edu/henderson96determinism.html
	[8]	Loogen, R., López-Fraguas, F. and Rodríguez-Artalejo, M., A demand driven computation strategy for lazy narrowing. In: LNCS, number 714. pp. 184-200.
	[9]	Loogen, R., López-Fraguas, F. and Rodríguez-Artalejo, M., Toy: a multiparadigm declarative system. In: LNCS, number 1631. pp. 244-247.
	[10]	Loogen, R. and Winkler, S., Dynamic detection of determinism in functional-logic languages. In: LNCS, number 528. pp. 335-346.
	[11]	Loogen, R. and Winkler, S., Dynamic detection of determinism in functional logic languages. In: Maluszynski, J., Wirsing, M. (Eds.), Programming Language Implementation and Logic Programming: Proc. of the 3rd International Symposium PLILP'91, Passau, Springer, Berlin, Heidelberg. pp. 335-346.
	[12]	Peòa, R. and Segura, C., Non-determinism analyses in a parallel-functional language. Journal of Logic Programming. v2004. 67-100.
	[13]	Sawamura, H. and T. Takeshima, Recursive Unsolvability of Determinacy, Solvable Cases of Determinacy and Their Applications to Prolog Optimization, in: Proceedings of the Symposium on Logic Programming, 1985, pp. 200--207