A debugging scheme for functional logic programs

Electronic Notes in Theoretical Computer Science

Volumn 64, Issue , 2002, Pages 18-55

  Alpuente, María ^a   Correa, Franciso ^b   Falaschi, Moreno ^c  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSIDAD EAFIT   (Colombia)

^c UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL OPERATORS; PROGRAM DEBUGGING; SEMANTICS; SOFTWARE ENGINEERING;

FUNCTIONAL LOGIC PROGRAMMING; LOGIC LANGUAGES; PROGRAM CORRECTNESS; PROGRAM SPECIFICATION;

LOGIC PROGRAMMING;

EID: 11244330102     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80345-1     Document Type: Conference Paper

References (50)

1. Z. Alexin, T. Gyimöthy, and H. Bostrom. Integrating Algorithmic Debugging and Unfolding Transformation in an Interactive Learner. In Proc. ECAI'96. John Wiley & Sons, 1996.
2. M. Alpuente, F. Correa, and M. Falaschi. Declarative Debugging of Functional Logic Programs. In B. Gramlich and S. Lucas, editors, Proc. of the International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001), volume 57 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001.
3. M. Alpuente, F. Correa, and M. Falaschi. A Debugging Scheme for Functional Logic Programs. Technical Report DSIC-II/10/02, UPV, 2002. Available at URL: http://www.dsic.upv.es/users/elp/papers.html.
4. M. Alpuente, F. Correa, M. Falaschi, and S. Marson. The Debugging System BUGGY. Technical Report DSIC-II/1/01, UPV, 2001. Available at URL: http://www.dsic.upv.es/users/elp/papers.html.
5. Alpuente M., Falaschi M., Manzo F. Analyses of Unsatisfiability for Equational Logic Programming. Journal of Logic Programming. 22:(3):1995;221-252
6. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. Safe folding/unfolding with conditional narrowing. In H. Heering M. Hanus and K. Meinke, editors, Proc. of the International Conference on Algebraic and Logic Programming, ALP'97, Southampton (England), pages 1-15. Springer LNCS 1298, 1997.
7. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. A Transformation System for Lazy Functional Logic Programs. In A. Middeldorp and T. Sato, editors, Proc. of the 4th Fuji International Symposyum on Functional and Logic Programming, FLOPS'99, Tsukuba (Japan), pages 147-162. Springer LNCS 1722, 1999.
8. Alpuente M., Falaschi M., Vidal G. A Compositional Semantic Basis for the Analysis of Equational Horn Programs. Theoretical Computer Science. 165:(1):1996;97-131
9. Alpuente M., Falaschi M., Vidal G. Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems. 20:(4):1998;768-844
10. S. Antoy. Definitional trees. In Proc. of the 3rd Int'l Conference on Algebraic and Logic Programming, ALP'92, pages 143-157. Springer LNCS 632, 1992.
11. Antoy S. Evaluation Strategies for Functional Logic Programming. Int'l Workshop on Reduction Strategies in Rewriting and Programming WRS'01. Electronic Notes in Theoretical Computer Science 57:2001
12. Antoy S., Echahed R., Hanus M. A Needed Narrowing Strategy. Journal of the ACM. 47:(4):2000;776-822. Preliminary version appeared in Proc. 21st ACM Symp. on Principles of Programming Languages, pages 268-279. ACM Press, New York, 1994
13. Baader F., Nipkow T. Term Rewriting and All That. 1998;Cambridge University Press
14. D. Bert and R. Echahed. Design and implementation of a generic, logic and functional programming language. In Proc. of First European Symp. on Programming, ESOP'86, pages 119-132. Springer LNCS 213, 1986.
15. Bert D., Echahed R. On the Operational Semantics of the Algebraic and Logic Programming Language LPG. Recent Trends in Data Type Specifications. 1995;132-152 Springer LNCS 906
16. D. Bert, R. Echahed, and B.M. Østvold. Abstract Rewriting. In Proc. of Third Int'l Workshop on Static Analysis, WSA'93, pages 178-192. Springer LNCS 724, 1993.
17. Bosco P., Giovannetti E., Moiso C. Narrowing vs. SLD-resolution. Theoretical Computer Science. 59:1988;3-23
18. Bostrom H., Idestam-Alquist P. Specialization of Logic Programs by Pruning sld-trees. Proc of 4th Int'l Workshop on Inductive Logic Programming (ILP-94). 1994;31-47
19. Bostrom H., Idestam-Alquist P. Induction of Logic Programs by Example-guided Unfolding. Journal of Logic Programming. 40:1999;159-183
20. F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M Hermenegildo, J. Maluszyński, and G. Puebla. On the role of semantic approximations in validation and diagnosis of constraint logic programs. In Proc. of the 3rd. Int'l Workshop on Automated Debugging-AADEBUG'97, pages 155-170. U. of Linkoping Press, 1997.
21. R. Caballero-Roldán, F.J. López-Fraguas, and J. Sánchez-Hernández. User's manual for Toy. Technical Report SIP-5797, UCM, Madrid (Spain), 1997.
22. M. Codish, M. Falaschi, and K. Marriott. Suspension Analysis for Concurrent Logic Programs. In K. Furukawa, editor, Proc. of Eighth Int'l Conf. on Logic Programming, pages 331-345. The MIT Press, Cambridge, MA, 1991.
23. Comini M., Levi G., Meo M.C., Vitiello G. Abstract diagnosis. Journal of Logic Programming. 39:(1 - 3):1999;43-93
24. M. Comini, G. Levi, and G. Vitiello. Declarative Diagnosis Revisited. In John W. Lloyd, editor, Proceedings of the 1995 Int'l Symposium on Logic Programming, pages 275-287. The MIT Press, 1995.
25. R. Echahed. On completeness of narrowing strategies. In Proc. of CAAP'88, pages 89-101. Springer LNCS 299, 1988.
26. R. Echahed. Uniform narrowing strategies. In Proc. of ICALP'92, pages 259-275. Springer LNCS 632, 1992.
27. Falaschi M., Levi G., Martelli M., Palamidessi C. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science. 69:(3):1989;289-318
28. Falaschi M., Levi G., Martelli M., Palamidessi C. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation. 103:(1):1993;86-113
29. Ferrand G. Error Diagnosis in Logic Programming, and Adaptation of E.Y. Shapiro's Method. Journal of Logic Programming. 4:(3):1987;177-198
30. L. Fribourg. SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 172-185. IEEE, New York, 1985.
31. D. Frutos-Escrig and M.I. Fernández-Camacho. On Narrowing Strategies for Partial Non-Strict Functions. In S. Abramsky and T. Maibaum, editors, Proc. TAPSOFT'01, pages 416-437. Springer LNCS 493, 1991.
32. Giovannetti E., Levi G., Moiso C., Palamidessi C. Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences. 42:1991;363-377
33. M. Hanus. Compiling Logic Programs with Equality. In Proc. of 2nd Int'l Workshop on Programming Language Implementation and Logic Programming, pages 387-401. Springer LNCS 456, 1990.
34. Hanus M. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming. 19&20:1994;583-628
35. M. Hanus, H. Kuchen, and J.J. Moreno-Navarro. Curry: A Truly Functional Logic Language. In Proc. ILPS'95 Workshop on Visions for the Future of Logic Programming, pages 95-107, 1995.
36. Hanus M., Prehofer C. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming. 9:(1):1999;33-75.. Preliminary version in Proc. RTA'96, pages 138 - 152. Springer LNCS 1103
37. S. Hölldobler. Foundations of Equational Logic Programming. Springer LNAI 353, 1989.
38. Klop J.W. Term Rewriting Systems. Abramsky S., Gabbay D., Maibaum T. Handbook of Logic in Computer Science. I:1992;1-112 Oxford University Press
39. Lloyd J.W. Programming in an integrated functional and logic language. Journal of Functional and Logic Programming. 3:1999
40. M.J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In Proc. of Third IEEE Symp. on Logic In Computer Science, pages 348-357. Computer Science Press, New York, 1988.
41. Maher M.J. Equivalences of Logic Programs. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;627-658 Morgan Kaufmann, Los Altos, Ca
42. M.J. Maher. On Parameterized Substitutions. Technical Report RC 16042, IBM - T.J. Watson Research Center, Yorktown Heights, NY, 1990.
43. Moreno-Navarro J.J., Rodríguez-Artalejo M. Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming. 12:(3):1992;191-224
44. Muggleton S., de Raedt L. Inductive Logic Programming: Theory and methods. Journal of Logic Programming. 19:(20):1994;629-679
45. Padawitz P. Computing in Horn Clause Theories, volume 16 of EATCS Monographs on Theoretical Computer Science. 1988;Springer-Verlag, Berlin
46. U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138-151. IEEE, New York, 1985.
47. Shaphiro E.Y. Algorithmic Program Debugging. 1982;The MIT Press, Cambridge, Massachusetts. ACM Distinguished Dissertation
48. G. Vidal. Semantics-Based Analysis and Transformation of Functional Logic Programs. PhD thesis, DSIC-UPV, Sept. 1996. En español.
49. You Y.H. Enumerating outer narrowing derivations for constructor-based term rewriting systems. Journal of Symbolic Computation. 7:1989;319-343
50. F. Zartmann. Denotational Abstract Interpretation of Functional Logic Programs. In P. Van Hentenryck, editor, Proc. of the 4th Int'l Static Analysis Symposium, SAS'97, pages 141-159. Springer LNCS 1302, 1997.