Controlling search in declarative programs

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

Volumn 1490, Issue , 1998, Pages 374-390

  Hanus, Michael ^a   Steiner, Frank ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LOGIC PROGRAMMING;

ABSTRACT NOTIONS; COMPUTATION STEPS; DECLARATIVE LANGUAGES; DECLARATIVE PROGRAMS; NONDETERMINISTIC COMPUTATION; PROGRAMMING ERRORS; SEARCH FACILITIES; SEARCH STRATEGIES;

COMPUTER CIRCUITS;

EID: 22444452448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056627     Document Type: Conference Paper

References (18)

1. S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pp. 268-279, Portland, 1994.
2. M. Hanus. Lazy Narrowing with Simplification. Computer Lanquaqes, Vol. 23, No. 2-4, pp. 61-85, 1997.
3. M. Hanus. A Unified Computation Model for Functional and Logic Programming. In Proc. of the 24 th ACM Symposium on Principles of Programming Languages (Paris), pp. 80-93, 1997.
4. M. Hanus and F. Steiner. Controlling Search in Declarative Programs. Technical Report, RWTH Aachen, 1998
5. M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at http://www-i2. informatik. rwth-aachen. de/~h2mus/curry, 1998.
6. P. Hudak, S. Peyton Jones, and P. Wadler. Report on the Programming Language Haskell (Version 1. 2). SIGPLAN Notices, Vol. 27, No. 5, 1992.
7. J. Hughes. Why Functional Programming Matters. In D. A. Turner, editor, Research Topcis in Functional Programming, pp. 17-42. Addison Wesley, 1990.
8. S. Janson and S. Haridi. Programming Paradigms of the Andorra Kernel Language. In Proc. 1991 International Logic Programming Symposium, pp. 167-183. MIT Press, 1991.
9. J. W. Lloyd. Foundations of Logic Programming. Springer, second, extended edition, 1987.
10. R. Loogen, F. Lopez Fraguas, and M. Rodriguez Artalejo. A Demand Driven Computation Strategy for Lazy Narrowing. In Proc. of the 5th International Symposium on Programming Language Implementation and Logic Programming, pp. 184-200. Springer LNCS 714, 1993.
11. R. Loogen and S. Winkler. Dynamic Detection of Determinism in Functional Logic Languages. Theoretical Computer Science 142, pp. 59-87, 1995.
12. G. Nadathur, B. Jayaraman, and K. Kwon. Scoping Constructs in Logic Programming: Implementation Problems and their Solution. Journal of Logic Programming, Vol. 25, No. 2, pp. 119-161, 1995.
13. G. Nadathur and D. Miller. An overview of λProlog. In Proc. 5th Conference on Logic Programming & 5th Symposium on Logic Programming (Seattle), pages 810-827. MIT Press, 1988.
14. C. Schulte. Programming Constraint Inference Engines. In Proc. of the Third International Conference on Principles and Practice of Constraint Programming, pp. 519-533. Springer LNCS 1330, 1997.
15. C. Schulte and G. Smolka. Encapsulated Search for Higher-Order Concurrent Constraint Programming. In Proc. of the 1994 International Logic Programming Symposium, pp. 505-520. MIT Press, 1994.
16. G. Smolka. The Oz Programming Model. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, pp. 324-343. Springer LNCS 1000, 1995.
17. P. Wadler. How to Replace Failure by a List of Successes. In Functional Programming and Computer Architecture. Springer LNCS 201, 1985.
18. P. Wadler. How to Declare an Imperative. In Proc. of thp 1995 International Logic Programming Symposium, pp. 18-32. MIT Press, 1995.