Evaluation strategies for functional logic programming

Journal of Symbolic Computation

Volumn 40, Issue 1 SPEC. ISS., 2005, Pages 875-903

  Antoy, Sergio ^a  

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

Author keywords

Constructor based rewrite systems; Definitional trees; Evaluation strategies; Functional logic programming; Narrowing

Indexed keywords

EID: 18144362796     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2004.12.007     Document Type: Article

References (56)

1. H. Aït-Kaci An overview of life In: J. Schmidt A. Stogny (Eds.) Proc. Workshop on Next Generation Information System Technology In: LNCS vol. 504 1990 Springer 42-58
2. E. Albert M. Hanus F. Huch J. Oliver G. Vidal Operational semantics for functional logic languages In: M. Comini M. Falaschi (Eds.) Electronic Notes in Theoretical Computer Science vol. 76 2002 Elsevier Science Publishers Available at http://www.elsevier.nl/locate/entcs/volume76.html
3. J. Anastasiadis H. Kuchen Higher order Babel: Language and implementation In: R. Dyckhoff H. Herre P. Schroeder-Heister (Eds.) Proc. of the 5th International Workshop on Extensions of Logic Programming. ELP'96 March In: LNCS vol. 1050 1996 Springer Leipzig, Germany
4. S. Antoy Non-determinism and lazy evaluation in logic programming In: T.P. Clement K.-K. Lau (Eds.) Logic Programming Synthesis and Transformation. LOPSTR'91 July 1991 Springer-Verlag Manchester, UK 318-331
5. S. Antoy Definitional trees In: Proc. of the 4th Intl. Conf. on Algebraic and Logic Programming In: LNCS vol. 632 1992 Springer 143-157
6. S. Antoy Optimal non-deterministic functional logic computations In: Proc. of the 6th International Conference on Algebraic and Logic Programming. ALP'97 In: LNCS vol. 1298 1997 Springer 16-30
7. Antoy S. 2001 Constructor-based conditional narrowing. In: Proc. of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming. PPDP'01, September, Florence, Italy. pp. 199-205
8. S. Antoy R. Echahed M. Hanus Parallel evaluation strategies for functional logic languages In: Proc. of the 14th International Conference on Logic Programming. ICLP'97 1997 MIT Press 138-152
9. S. Antoy R. Echahed M. Hanus A needed narrowing strategy Journal of the ACM 47 4 2000 776-822
10. S. Antoy M. Hanus Compiling multi-paradigm declarative programs into Prolog In: Proc. of the 3rd International Workshop on Frontiers of Combining Systems. FroCoS 2000 March LNCS vol. 1794 2000 Springer Nancy, France 171-185
11. S. Antoy A. Tolmach Typed higher-order narrowing without higher-order strategies In: 4th Fuji International Symposium on Functional and Logic Programming. FLOPS'99 LNCS vol. 1722 1999 Springer, Tsukuba Japan 335-350
12. F. Baader T. Nipkow Term Rewriting and All That 1998 Cambridge University Press
13. Barry B. 1996 Needed narrowing as the computational strategy of evaluable functions in an extension of GödEl. Master's Thesis, Portland State University
14. J.A. Bergstra J.W. Klop Conditional rewrite rules: Confluence and termination Journal of Computer and System Sciences 32 3 1986 323-362
15. M. Bezem J.W. Klop R. de Vrijer 2003 (Eds.), Term Rewriting Systems Cambridge University Press
16. P. Bosco E. Giovanetti C. Moiso Narrowing vs. sld-resolution Theoretical Computer Science 59 1-2 1988 3-23
17. G. Boudol Computational semantics of term rewriting systems In: M. Nivat J.C. Reynolds (Eds.) Algebraic Methods in Semantics 1985 Cambridge University Press Cambridge, UK (Chapter 5)
18. Brand M.v.d. Klint P. 2003 ASF+SDF Meta-Environment User Manual Revision: 1:134. Centrum voor Wiskunde en Informatica (CWI), 18 September, The Netherlands
19. N. Dershowitz 33 examples of termination In: H. Comon J.-P. Jouannaud (Eds.) French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting. May 1993, Font Romeux, France vol. 909 1995 Springer-Verlag Berlin 16-26
20. N. Dershowitz J. Jouannaud Rewrite systems In: J. van Leeuwen (Ed.) Handbook of Theoretical Computer Science B: Formal Methods and Semantics 1990 North Holland Amsterdam 243-320 (Chapter 6)
21. E.W. Dijkstra A Discipline of Programming 1976 Prentice-Hall
22. E. Giovannetti G. Levi C. Moiso C. Palamidessi Kernel LEAF: A logic plus functional language The Journal of Computer and System Sciences 42 1991 139-185
23. González-Moreno J.C. 1993 A correctness proof for Warren's HO into FO translation. In: Proc. GULP'93. October, Gizzeria Lido, Italy. pp. 569-585
24. J.C. González-Moreno F.J.L. Fraguas M.T.H. González M.R. Artalejo An approach to declarative programming based on a rewriting logic The Journal of Logic Programming 40 1999 47-87
25. González-Moreno J.C. González M.T.H. Artalejo M.R. 1997 A higher order rewriting logic for functional logic programming. In: Proc. of the 14th International Conference on Logic Programming. ICLP'97, July, Leuven, Belgium. pp. 153-167
26. J.C. González-Moreno M.T.H. González M.R. Artalejo Polymorphic types in functional logic programming Journal of Functional and Logic Programming 2001 (1) 2001
27. M. Hanus The integration of functions into logic programming: From theory to practice The Journal of Logic Programming 19-20 1994 583-628
28. Hanus M. 2003 Curry: An integrated functional logic language (vers. 0.8). Available at http://www.informatik.uni-kiel.de/~curry
29. Hanus M. Antoy S. Engelke M. Höppner K. Koj J. Niederau P. Sadre R. Steiner F. 2003 PAKCS: The Portland Aachen Kiel Curry System. Available at http://www.informatik.uni-kiel.de/~pakcs
30. M. Hanus S. Lucas A. Middeldorp Strongly sequential and inductively sequential term rewriting systems Information Processing Letters 67 1 1998 1-8
31. M. Hanus C. Prehofer Higher-order narrowing with definitional trees In: Proc. 7th International Conference on Rewriting Techniques and Applications. RTA'96 In: LNCS vol. 1103 1996 Springer 138-152
32. G. Huet J.-J. Lévy Computations in orthogonal term rewriting systems In: J.-L. Lassez G. Plotkin (Eds.) Computational Logic: Essays in Honour of Alan Robinson 1991 MIT Press Cambridge, MA 395-443
33. H. Hussmann Nondeterministic algebraic specifications and nonconfluent rewriting Journal of Logic Programming 12 1992 237-255
34. T. Ida K. Nakahara Leftmost outside-in narrowing calculi Journal of Functional Programming 7 2 1997 129-161
35. J.R. Kennaway Sequential evaluation strategies for parallel-or and related reduction systems Annals of Pure and Applied Logic 43 1989 31-56
36. J.W. Klop Term rewriting systems In: S. Abramsky D. Gabbay T. Maibaum (Eds.) Handbook of Logic in Computer Science vol. II 1992 Oxford University Press 1-112
37. J. Lloyd Programming in an integrated functional and logic language Journal of Functional and Logic Programming 3 1999 1-49
38. R. Loogen F.L. Fraguas M.R. Artalejo A demand driven computation strategy for lazy narrowing In: Proc. 5th International Symposium on Programming Language Implementation and Logic Programming. PLILP'93 In: LNCS vol. 714 1993 Springer 184-200
39. F.J. López-Fraguas J. Sánchez-Hernández TOY: A multiparadigm declarative system In: Proc. RTA'99 In: LNCS vol. 1631 1999 Springer 244-247
40. F.J. López-Fraguas J. Sánchez-Hernández Functional logic programming with failure: A set-oriented view In: R. Nieuwenhuis A. Voronkov(Eds.) Proc. 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning In: Lecture Notes in Computer Science vol. 2250 2001 Springer 455-469
41. J. Marino J. Moreno-Navarro Using static analysis to compile non-sequential functional logic programs In: E. Pontelli V.S. Costa (Eds.) Practical Aspects of Declarative Languages, Second International Workshop. PADL 2000, Proceedings January 2000, Boston, MA, USA In: Lecture Notes in Computer Science vol. 1753 2000 Springer 63-80
42. Middeldorp A. 1997 Call by need computations to root-stable form. In: Proc. 24th ACM Symposium on Principles of Programming Languages. Paris. pp. 94-105
43. A. Middeldorp S. Okui A deterministic lazy narrowing calculus Journal of Symbolic Computation 25 6 1998 733-757
44. A. Middeldorp S. Okui T. Ida Lazy narrowing: Strong completeness and eager variable elimination Theoretical Computer Science 167 1-2 1996 95-130
45. J.J. Moreno-Navarro M. Rodríguez-Artalejo Logic programming with functions and predicates: The language BABEL Journal of Logic Programming 12 1992 191-223
46. G. Nadathur D. Miller An overview of λprolog In: Proc. 5th Conference on Logic Programming & 5th Symposium on Logic Programming. Seattle 1988 MIT Press 810-827
47. K. Nakahara A. Middeldorp T. Ida A complete narrowing calculus for higher-order functional logic programming In: Proc. 7th International Symposium on Programming Languages, Implementations, Logics and Programs. PLILP'95 In: LNCS vol. 982 1995 Springer 97-114
48. M.J. O'Donnell Computing in Systems Described by Equations In: LNCS vol. 58 1977 Springer
49. R.A. O'Keefe The Craft of Prolog 1990 The MIT Press Cambridge, MA
50. K. Petersson J.M. Smith Program derivation in type theory: A partitioning problem Computer Languages 11 3-4 1986 161-172
51. S.L. Peyton Jones J. Hughes Haskell 98: A non-strict, purely functional language 1999 http://www.haskell.org
52. C. Prehofer Higher-order narrowing In: Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science 1994 IEEE Computer Society Press Paris, France 507-516
53. R.C. Sekar I.V. Ramakrishnan Programming in equational logic: Beyond strong sequentiality Information and Computation 104 1 1993 78-109
54. A. Tolmach S. Antoy A monadic semantics for core curry In: G. Vidal (Ed.) Electronic Notes in Theoretical Computer Science vol. 86 2003 Elsevier Available at http://www.elsevier.nl/locate/entcs/volume86.html
55. F. van Raamsdonk Higher-order rewriting In: Proceedings of the 10th International Conference on Rewriting Techniques and Applications. RTA '99 In: LNCS vol. 1631 1999 Springer 220-239
56. Warren D. 1982 Higher-order extensions to PROLOG: Are they needed? In: Machine Intelligence, vol. 10. pp. 441-454