References

1

S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268-279, Portland, 1994.

2

L. Cardelli. Type systems. In Allen B. Tucker, Jr. (Editor-in-Chief), The Computer Science and Engineering Handbook. CRC Press, in cooperation with ACM, 1997.

3

L. Damas and R. Milner. Principal type-schemes for functional programs. In Proc. 9th Annual Symposium on Principles of Programming Languages, pages 207-212, 1982.

4

S. K. Debray and D. S. Warren. Detection and optimization of functional computations in Prolog. In Proceedings of the Third International Conference on Logic Programming, Lecture Notes in Computer Science, pages 490-504. Springer-Verlag, 1986.

5

B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriott, and P. Stuckey. Herbrand constraint solving in HAL. Not published. Available at http://www.cs.kuleuven.ac.be/~bmd/pubs/, 1999.

6

J.C. Gonzáles-Moreno, M.T. Hortalá-Gonzáles, F.J. López-Fraguas, and M. Rodríguez-Artalejo. A rewriting logic for declarative programming. In Proc. ESOP'96, pages 156-172. Springer LNCS 1058, 1996.

7

M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.

8

M. Hanus. A unified computation model for functional and logic programming. In Proc. of the 24th ACM Symposium on Principles of Programming Languages (Paris), pages 80-93, 1997.

9

M. Hanus and C. Prehofer. Higher-Order Narrowing with Definitional Trees. In Journal of Functional Programming, 9(1):33-75, 1999.

10

M. Hanus and R. Sadre. An Abstract Machine for Curry and its Concurrent Implementation in Java. Journal of Functional and Logic Programming, 1999(6).

11

M. Hanus and F. Steiner. Controlling search in declarative programs. In Principles of Declarative Programming (Proc. Joint International Symposium PLILP/ALP'98), pages 374-390. Springer LNCS 1490, 1998.

12

M. Hanus (ed.). Curry: An integrated functional logic language. Available at http://www-i2.informatik.rwth-aachen.de/~hanus/curry, 1998.

13

M. Hanus, S. Antoy, J. Koj, R. Sadre, and F. Steiner. PACS: The Portland Aachen Curry System. Available at http://www-i2.informatik.rwth-aachen.de/~hanus/pacs/, 1999.

14

M. Hanus. Distributed programming in a multi-paradigm declarative language. In Proc. of the International Conference on Principles and Practice of Declarative Programming (PPDP'99). Springer LNCS (to appear), 1999.

15

F. Henderson and T. Somogyi, Z. Conway. Determinism analysis in the Mercury compiler. In Proc. of the Nineteenth Australasian Computer Science Conference, pages 337-346, 1996.

16

P. Hudak, S. Peyton Jones, and P. Wadler. Report on the programming language Haskell (Version 1.2). SIGPLAN Notices, 27(5), 1992.

17

F. Liu. Towards lazy evaluation, sharing and non-determinism in resolution based functional logic languages. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 201-209, New York, NY, USA, 1993. ACM Press.

18

R. Loogen and S. Winkler. Dynamic detection of determinism in functional logic languages. Theoretical Computer Science, 142(1):59-87, 1995.

19

F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer (to appear), 1999.

20

H. R. Nielson and F. Nielson. Communication analysis for Concurrent ML. In ML with Concurrency, Monographs in Computer Science, pages 185-235. Springer-Verlag, 1997.

21

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, January 20-22, 1999, San Antonio, TX, pages 276-290. ACM Press, 1999.

22

C. Schulte and G. Smolka. Encapsulated search for higher-order concurrent constraint programming. In Proc. of the 1994 International Logic Programming Symposium, pages 505-520. MIT Press, 1994.

23

P. Van Roy, B. Demoen, and Y.D. Willems. Improving the execution speed of compiled Prolog with modes, clause selection, and determinism. In Proc. of the TAPSOFT '87, pages 111-125. Springer LNCS 250, 1987.

24

P. Wadler. How to declare an imperative. ACM Computing Surveys, 29(3)240-263, 1997.