Rewriting and call-time choice: The HO case

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

Volumn 4989 LNCS, Issue , 2008, Pages 147-162

  López Fraguas, Francisco Javier ^a   Rodríguez Hortalá, Juan ^a   Sánchez Hernández, Jaime ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CASE BASED REASONING; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; TRANSLATION (LANGUAGES);

NON DETERMINISTIC FUNCTIONS; REDUCTION NOTIONS; REWRITING SYSTEMS;

SEMANTICS;

EID: 43149102735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78969-7_12     Document Type: Conference Paper

References (29)

1. Albert, E., Hanus, M., Huch, F., Oliver, J., Vidal, G.: Operational semantics for declarative multi-paradigm languages. J. of Symb. Comp. 40(1), 795-829 (2005)
2. Antoy, S., Brown, D., Chiang, S.: On the correctness of bubbling. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 35-49. Springer, Heidelberg (2006)
3. Antoy, S., Brown, D., Chiang, S.: Lazy context cloning for non-deterministic graph rewriting. In: Proc. Termgraph 2006. ENTCS, vol. 176(1), pp. 61-70 (2007)
4. Antoy, S., Tolmach, A.P.: Typed higher-order narrowing without higher-order strategies. In: Middeldorp, A. (ed.) FLOPS 1999. LNCS, vol. 1722, pp. 335-353. Springer, Heidelberg (1999)
5. Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. In: Proc. POPL 1995, pp. 233-246 (1995)
6. Echahed, R., Janodet, J.-C.: Admissible graph rewriting and narrowing. In: Proc. JICSLP 1998, pp. 325-340. MIT Press, Cambridge (1998)
7. González-Moreno, J., Hortalá-González, M., Rodríguez-Artalejo, M.: A higher order rewriting logic for functional logic programming. In: Proc. ICLP 1997, pp. 153-167. MIT Press, Cambridge (1997)
8. González-Moreno, J., Hortalá-González, T., Rodríguez-Artalejo, M.: Polymorphic types in functional logic programming. J. of Functional and Logic Programming 2001/S01, 1-71 (2001)
9. González-Moreno, J.C.: A correctness proof for warren's ho into fo translation. In: Proc. GULP 1993, pp. 569-584 (1993)
10. González-Moreno, J.C., Hortalá-González, M.T., Rodríguez-Artalejo, M.: On the completeness of narrowing as the operational semantics of functional logic programming. In: Martini, S.. Börger, E.. Kleine Büning. H., Jäger, G., Richter. M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 216-230. Springer. Heidelberg (1993)
11. González-Moreno, J.C, Hortalá-González, T., López-Fraguas, F., Rodríguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. J. of Logic Programming 40(1), 47-87 (1999)
12. Hanus, M.: The integration of functions into logic programming: From theory to practice. J. of Logic Programming 19&20, 583-628 (1994)
13. Hanus, M.: Curry mailing list (March, 2007), http://www.informatik.uni- kiel.de/~ curry/listarchive/0497.html
14. Hanus, M.: Multi-paradigm declarative languages. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 45-75. Springer, Heidelberg (2007)
15. Hanus, M., Prehofer, C.: Higher-order narrowing with definitional trees. J. of Functional Programming 9(1), 33-75 (1999)
16. Hanus. M. (ed.): Curry: An integrated functional logic language (version 0.8.2) (March, 2006), http://www.informatik.uni-kiel.de/~curry/report.html
17. Hussmann, H.: Non-Determinism in Algebraic Specifications and Algebraic Programs. Birkhauser, Basel (1993)
18. López-Fraguas, F., Rodríguez-Hortalá, J.. Sánchez-Hernández. J.: Narrowing for non-determinism with call-time choice semantics. In: Proc. WLP 2007 (2007)
19. López-Fraguas, F., Rodríguez-Hortalá. J.. Sánchez-Hernández, J.: A simple rewrite notion for call-time choice semantics. In: Proc. PPDP 2007, pp. 197-208. ACM Press, New York (2007)
20. López-Fraguas, F., Rodríguez-Hortalá, J., Sánchez-Hernández, J.: Rewriting and call-time choice: the HO case (extended version). Tech. Rep. SIC-3-08 (2008). http://gpd.sip.ucm.es/fraguas/ papers/flops081ong.pdf
21. López-Fraguas, F., Sánchez-Hernández, J.: TOY: A multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 244-247. Springer, Heidelberg (1999)
22. Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. J. Funct. Program. 8(3), 275-317 (1998)
23. Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Log. Comput. 1(4), 497-536 (1991)
24. Nakahara, K., Middeldorp, A., Ida, T.: A complete narrowing calculus for higher-order functional logic programming. In: Leopold, H., Coulson, G., Danthine, A., Hutchison, D. (eds.) COST-237 1994. LNCS, vol. 882, pp. 97-114. Springer, Heidelberg (1994)
25. Peyton Jones. S.L. (ed.): Haskell 98 Language and Libraries. The Revised Report. Cambridge University Press, Cambridge (2003)
26. Plump, D.: Essentials of term graph rewriting. ENTCS 51 (2001)
27. van Raamsdonk, F.: Higher-order rewriting. In: Term Rewriting Systems, Cambridge University Press, Cambridge (2003)
28. Rodríguez-Artalejo, M.: Functional and constraint logic programming. In: Comon, H., Marché. C., Treinen. R. (eds.) CCL 1999. LNCS, vol. 2002. pp. 202-270. Springer, Heidelberg (2001)
29. Warren, D.H.: Higher-order extensions to prolog: Are they needed? Machine Intelligence 10, 441-454 (1982)