On the correctness of bubbling

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

Volumn 4098 LNCS, Issue , 2006, Pages 35-49

  Antoy, Sergio ^a   Brown, Daniel W ^a   Chiang, Su Hui ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER SCIENCE; FORMAL LOGIC; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

BACKTRACKING; BUBBLING; REDEXES;

GRAPHIC METHODS;

EID: 33749376916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_4     Document Type: Conference Paper

References (22)

1. M. Alpuente, M. Hanus, S. Lucas, and G. Vidal. Specialization of functional logic programs based on needed narrowing. Theory and Practice of Logic Programming, 5(3):273-303, 2005.
2. S. Antoy. Optimal non-deterministic functional logic computations. In Proceedings of the Sixth International Conference on Algebraic and Logic Programming (ALP'97), pages 16-30, Southampton, UK, September 1997. Springer LNCS 1298.
3. S. Antoy. Constructor-based conditional narrowing. In Proceedings of the Third ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 199-206. ACM Press, 2001.
4. S. Antoy. Evaluation strategies for functional logic programming. Journal of Symbolic Computation, 40(1):875-903, 2005.
5. S. Antoy, D. Brown, and S. Chiang. Lazy context cloning for non-deterministic graph rewriting. In Proc. of the 3rd International Workshop on Term Graph Rewriting, Termgraph'06, pages 61-70, Vienna, Austria, April 2006.
6. S. Antoy and M. Hanus. Overlapping rules and logic variables in functional logic programs. In Proceedings of the 22nd International Conference on Logic Programming (ICLP'06), Seattle, WA, August 2006. To appear.
7. S. Antoy, M. Hanus, J. Liu, and A. Tolmach. A virtual machine for functional logic computations. In Proc. of the 16th International Workshop on Implementation and Application of Functional Languages (IFL 2004), pages 108-125, Lubeck, Germany, Sept. 2005. Springer LNCS 3474.
8. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
9. M. Bezem, J. W. Klop, and R. de Vrijer (eds.). Term Rewriting Systems. Cambridge University Press, 2003.
10. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243-320. Elsevier, 1990.
11. R. Echahed and J.-C. Janodet. On constructor-based graph rewriting systems. Research Report 985-1, IMAG, 1997.
12. R. Echahed and J.-C. Janodet. Admissible graph rewriting and narrowing. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 325 - 340, Manchester, June 1998. MIT Press.
13. J. C. González Moreno, F. J. López Fraguas, M. T. Hortalá González, and M. Rodríguez Artalejo. An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming, 40:47-87, 1999.
14. M. Hanus (ed.). PAKCS 1.7.1: The Portland Aachen Kiel Curry System. Available at http://www.informatik.uni-kiel.de/~pakcs, March 27, 2006.
15. M. Hanus (ed.). Curry: An integrated functional logic language (vers. 0.8.2). Available at http://www.informatik.uni-kiel.de/~curry, March 28, 2006.
16. G. Huet and J.-J. Lévy. Computations in orthogonal term rewriting systems. In J.-L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of Alan Robinson. MIT Press, Cambridge, MA, 1991.
17. H. Hussmann. Nondeterministic algebraic specifications and nonconfluent rewriting. Journal of Logic Programming, 12:237-255, 1992.
18. J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992.
19. F. López-Fraguas and J. Sánchez-Hernández. TOY: A multiparadigm declarative system. In Proceedings of RTA '99, pages 244-247. Springer LNCS 1631, 1999.
20. M. J. O'Donnell. Equational Logic as a Programming Language. MIT Press, 1985.
21. D. Plump. Term graph rewriting. In H.-J. Kreowski H. Ehrig, G. Engels and G. Rozenberg, editors, Handbook of Graph Grammars, volume 2, pages 3-61. World Scientific, 1999.
22. A. Tolmach, S. Antoy, and M. Nita. Implementing functional logic languages using multiple threads and stores. In Proc. of the Ninth International Conference on Functional Programming (ICFP 2004), Pages 90-102, Snowbird, Utah, USA, Sept. 2004. ACM Press.