Correction of functional logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2618, Issue , 2003, Pages 54-68

  Alpuente, Maria ^a   Ballis, Demis ^b   Correa, Francisco J ^c   Falaschi, Moreno ^b  

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

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSIDAD EAFIT   (Colombia)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM DEBUGGING; WEB SERVICES;

AUTOMATIC CORRECTIONS; BOTTOM UP; EXPERIMENTAL EVALUATION; FUNCTIONAL LOGIC PROGRAMS; INTEGRATED DEVELOPMENT ENVIRONMENT; PROGRAM SYNTHESIS; PROTOTYPICAL IMPLEMENTATION; TOPDOWN;

LOGIC PROGRAMMING;

EID: 35248885168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36575-3_5     Document Type: Article

References (29)

1. M. Alpuente, D. Ballis, F. J. Correa, and M. Falaschi. Correction of Functional Logic Programs. Technical report, DSIC-II/23/02, UPV, 2002. Available at URL: http://www.dsic.upv.es/users/elp/papers.html.
2. M. Alpuente, F. J. Correa, and M. Falaschi. Debugging Scheme of Functional Logic Programs. In Proc. of WFLP'01, vol. 64 of ENTCS, 2002.
3. M. Alpuente, F. J. Correa, M. Falaschi, and S. Marson. The Debugging System BUGGY. Technical report, UPV, 2001. Available at URL: http://www.dsic.upv.es/users/elp/soft.html.
4. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. Safe folding/unfolding with conditional narrowing. In Proc. ALP'97, pp. 1-15. Springer LNCS 1298, 1997.
5. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. A Transformation System for Lazy Functional Logic Programs. In Proc. of FLOPS'99, pp. 147-162. Springer LNCS 1722, 1999.
6. M. Alpuente, F. Correa, and M. Falaschi. Declarative Debugging of Funtional Logic Programs. In Proc. of WRS'01, vol. 57 of ENTCS, 2001.
7. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
8. H. Bostrom and P. Idestam-Alquist. Induction of Logic Programs by Example-guided Unfolding. Journal of Logic Programming, 40:159-183, 1999.
9. Henrik Bostrom. Specialization of recursive predicates. In European Conference on Machine Learning, pp. 92-106, 1995.
10. M. Comini, R. Gori, and G. Levi. Assertion based Inductive Verification Methods for Logic Programs. In Proc. of MFCSIT'00, vol. 40 of ENTCS, 2001.
11. M. Comini, G. Levi, and G. Vitiello. Declarative Diagnosis Revisited. In Proc. of ILP'95, pp. 275-287. The MIT Press, 1995.
12. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. of POPL'77, pp. 238-252, 1977.
13. N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467-494, 1993.
14. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. TCS, 69(3):289-318, 1989.
15. M. Fay. First Order Unification in an Equational Theory. In Proc of 4th Int'l Conf. on Automated Deduction, pp. 161-167, 1979.
16. C. Ferri, J. Hernández, and M.J. Ramírez. The FLIP System Homepage. 2000. Available at http://www.dsic.upv.es/users/elp/soft.ht ml.
17. C. Ferri, J. Hernández, and M.J. Ramírez. Incremental Learning of Functional Logic Programs. In Proc. FLOPS'01, pp. 233-247. LNCS 2024, 2001.
18. E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel Leaf: A Logic plus Functional Language. JCSS, 42:363-377, 1991.
19. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19&20:583-628, 1994.
20. J. Hernández and M.J. Ramírez. Inverse Narrowing for the Induction of Functional Logic Programs. In Proc. of APPIA-GULP-PRODE '98, pp. 379-393, 1998.
21. S. Hölldobler. Foundations of Equational Logic Programming. LNAI 353, 1989.
22. J.W. Klop. Term Rewriting Systems. In Handbook of Logic in Computer Science, vol. I, pp. 1-112. Oxford University Press, 1992.
23. S. Lucas. Context-Sensitive Rewriting Strategies. Information and Computation, 178(1):294-343, 2002.
24. S. Lucas. Termination of Canonical Context-Sensitive Rewriting. In Proc. RTA '02, pp. 296-310. Springer LNCS 2378, 2002.
25. M.J. Maher. Equivalences of Logic Programs. In Foundations of Deductive Databases and Logic Programming, pp. 627-658. Morgan Kaufmann, 1988.
26. J.J. Moreno-Navarro and M. Rodríguez-Artalejo. Logic Programming with Functions and Predicates: The language Babel. JLP, 12(3):191-224, 1992.
27. P. Padawitz. Computing in Horn Clause Theories, vol. 16 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.
28. A. Pettorossi and M. Proietti. Transformation of Logic Programs. In Handbook of Logic in Artificial Intelligence, vol. 5, pp. 697-787. Oxford University Press, 1998.
29. U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pp. 138-151, 1985.