An implementation of narrowing strategies

Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2001, Pages 207-217

  Antoy, Sergio ^a   Hanus, Michael ^b   Massey, Bart ^a   Steiner, Frank ^b  

^a Portland State University   (United States)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Curry; Functional logic; Java; Narrowing; XML

Indexed keywords

JAVA PROGRAMMING LANGUAGE; SEMANTICS; XML;

FUNCTIONAL LOGIC;

LOGIC PROGRAMMING;

EID: 0035790287     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773206     Document Type: Conference Paper

References (35)

1. H. Aït-Kaci, P. Lincoln, and R. Nasr. Le Fun: Logic, equations, and functions. In Proc. 4th IEEE Internat. Symposium on Logic Programming, pages 17-23, San Francisco, 1987.
2. E. Albert, M. Hanus, and G. Vidal. A practical partial evaluator for a multi-paradigm declarative language. In Proc. 5th Intl. Symposium on Functional and Logic Programming (FLOPS '01), pages 326-342. Springer LNCS 2024, 2001.
3. S. Antoy. Definitional trees. In Proc. 3rd Intl. Conference on Algebraic and Logic Programming, pages 143-157. Springer LNCS 632, 1992.
4. S. Antoy. Needed narrowing in Prolog. Technical report 96-2, Portland State University, 1996.
5. S. Antoy. Optimal non-deterministic functional logic computations. In Proc. Intl. Conference on Algebraic and Logic Programming (ALP '97), pages 16-30. Springer LNCS 1298, 1997.
6. S. Antoy. Constructor-based conditional narrowing. In Principles and Practice of Declarative Programming, (PPDP'01), Sept. 2001. (In this volume).
7. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. Journal ACM, 47(4):776-822, 2000. Previous version in Proc. 21st ACM Symposium on Principles of Programming Languages, pp. 268-279, 1994.
8. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. Journal ACM, 47(4):776-822, 2000. Previous version in Proc. 21st ACM Symposium on Principles of Programming Languages, pp. 268-279, 1994.
9. S. Antoy and Mo Hanus. Compiling multi-paradigm declarative programs into Prolog. In Proc. 3rd Intl. Workshop on Frontiers of Combining Systems (FroCoS '00), pages 171-185. Springer LNCS 1794, 2090.
10. F. Bander and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
11. S. Bonnier and J. Maluszynski. Towards a clean amalgamation of logic programs with external procedures. In Proc. 5th Conference on Logic Programming & 5th Symposium on Logic Programming (Seattle), pages 311-326. MIT Press, 1988.
12. M. Chakravarty and H. Lock. Towards the uniform implementation of declarative languages. Computer Languages, 23(2-4):121-160, 1997.
13. P. Cheong and L. Fribourg. Implementation of narrowing: The Prolog-based approach. In K. Apt, J. de Bakker, and J. Rutten, editors, Logic programming languages: constraints, functions, and objects, pages 1-20. MIT Press, 1993.
14. E. Denti, A. Omicini, and A. Ricci. tuProlog: A light-weight Prolog for Internet applications and infrastructures. In Practical Aspects of Declarative Languages (PADL), pages 184-198. Springer LNCS 1990, 2001.
15. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
16. M. Hanus. Efficient translation of lazy functional logic programs into Prolog. In Proc. Fifth Intl. Workshop on Logic Program Synthesis and Transformation, pages 252-266. Springer LNCS 1048, 1995.
17. M. Hanus. A unified computation model for functional and logic programming. In Proc. 24th ACM Symposium on Principles of Programming Languages (Paris), pages 80-93, 1997.
18. M. Hanus, S. Antoy, J. Koj, R. Sadre, and F. Steiner. PAKCS 1.3: The Portland Aachen Kiel Curry System User Manual. Technical report, University of Kiel, Germany, 2000. Available at http://www.informatik.uni-kiel.de/̃pakcs.
19. M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. Journal of Functional Programming, 9(1):33-75, 1999.
20. M. Hanus and R. Sadre. An abstract machine for Curry and its concurrent implementation in Java. Journal of Functional and Logic Programming, 1999(6), 1999.
21. M. Hanus and F. Steiner. Controlling search in declarative programs. In Principles of Declarative Programming (Proc. Joint Intl. Symposium PLILP/ALP '98), pages 374-390. Springer LNCS 1490, 1998.
22. M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at http://www.informatik.uni-kiel.de/̃curry, 2000.
23. T. Hortala-Gonzalez and E. Ullan. An abstract machine based system for a lazy narrowing calculus. In Proc. 5th Intl. Symposium on Functional and Logic Programming (FLOPS '01), pages 216-232. Springer LNCS 2024, 2001.
24. G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 395-443. MIT Press, 1991.
25. S. Janson. AKL - A Multiparadigm Programming Language. PhD thesis, Swedish Institute of Computer Science, 1994.
26. J. Lloyd. Programming in an integrated functional and logic language. Journal of Functional and Logic Programming, 1999(3):1-49, 1999.
27. R. Loogen. Relating the implementation techniques of functional and functional logic languages. New Generation Computing, 11:179-215, 1993.
28. R. Loogen, F. Lopez Fraguas, and M. Rodríguez Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. 5th Intl. Symposium on Programming Language Implementation and Logic Programming, pages 184-200. Springer LNCS 714, 1993.
29. 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.
30. W. Lux. Implementing encapsulated search for a lazy functional logic language. In Proc. 4th Fuji Intl. Symposium on Functional and Logic Programming (FLOPS '99), pages 100-113. Springer LNCS 1722, 1999.
31. A. Middeldorp. Call by need computations to root-stable form. In Proc. 24th ACM Symposium on Principles of Programming Languages (Paris), pages 94-105, 1997.
32. C. Schulte and G. Smolka. Encapsulated search for higher-order concurrent constraint programming. In Proc. 1994 Intl. Logic Programming Symposium, pages 505-520. MIT Press, 1994.
33. J. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM, 21(4):622-642, 1974.
34. P. Taran. Jinni. Available at http://www.binnetcorp.com/Jinni/, 2001.
35. D. Warren. Higher-order extensions to Prolog: are they needed? In Machine Intelligence 10, pages 441-454, 1982.