A virtual machine for functional logic computations

Lecture Notes in Computer Science

Volumn 3474, Issue , 2005, Pages 108-125

  Antoy, Sergio ^a   Hanus, Michael ^b   Liu, Jimeng ^a   Tolmach, Andrew ^a  

^a Portland State University   (United States)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; JAVA PROGRAMMING LANGUAGE; LOGIC PROGRAMMING;

LOGIC PROGRAMMING LANGUAGES; MACHINE ARCHITECTURE; NON-DETERMINISTIC PROGRAMS; VIRTUAL MACHINE;

VIRTUAL REALITY;

EID: 24944525928     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11431664_7     Document Type: Conference Paper

References (23)

1. E. Albert, M. Hanus, F. Huch, J. Oliver, and G. Vidai. Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation (to appear), 2005.
2. S. Antoy. Definitional trees. In Proc. 3rd International Conference on Algebraic and Logic Programming (ALP'92), pages 143-157. Springer LNCS 632, 1992.
3. S. Antoy. Optimal non-deterministic functional logic computations. In Proc. Int. Conf. on Algebraic and Logic Programming (ALP'97), pages 16-30. Springer LNCS 1298, 1997.
4. S. Antoy. Constructor-based conditional narrowing. In Proc. of the 3rd International Conference on Principles and Practice of Declarative Programming (PPDP'Ol), pages 199-206, Florence, Italy, Sept. 2001. ACM.
5. S. Antoy. Evaluation strategies for functional logic programming. Journal of Symbolic Computation, 2005. To appear.
6. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. Journal of the ACM, 47(4):776-822, 2000.
7. S. Antoy and M. Hanus. Compiling multi-paradigm declarative programs into Prolog. In Proc. of the 3rd International Workshop on Frontiers of Combining Systems (FroCoS 2000), pages 171-185, Nancy, France, March 2000. Springer LNCS 1794.
8. S. Antoy, M. Hanus, B. Massey, and F. Steiner. An implementation of narrowing strategies. In Proc. of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001), pages 207-217. ACM Press, 2001.
9. S. Antoy and S. Johnson. TeaBag: A functional logic language debugger. In Proc. 13th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2004), pages 4-18, Aachen (Germany), 2004. Technical Report AIB-2004-05, RWTH Aachen.
10. M.M.T. Chakravarty and H.C.R. Lock. Towards the uniform implementation of declarative languages. Computer Languages, 23(2-4): 121-160, 1997.
11. J. C. González Moreno, F. J. López Fraguas, M. T. Hortalá González, and M. Rodríguez Artalejo. An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming, 40:47-87, 1999.
12. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
13. M. Hanus. A unified computation model for functional and logic programming. In Proc. 24st ACM Symposium on Principles of Programming Languages (POPL'97), pages 80-93, 1997.
14. M. Hanus, S. Antoy, M. Engelke, K. Höppner, J. Koj, P. Niederau, R. Sadre, and F. Steiner. PAKCS: The Portland Aachen Kiel Curry System. Available at http://www.informatik.uni-kiel.de/~pakcs/, 2004.
15. M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. Journal of Functional Programming, 9(1):33-75, 1999.
16. 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.
17. 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.
18. M. Hanus (ed.). Curry: An integrated functional logic language (vers. 0.8). Available at http://www.informatik.uni-kiel.de/~curry, 2003.
19. F. López-Fraguas and J. Sánchez-Hernández. TOY: A Multiparadigm Declarative System. In Proc. of RTA'99, pages 244-247. Springer LNCS 1631, 1999.
20. W. Lux and H. Kuchen. An efficient abstract machine for Curry. In K. Beiersdörfer, G. Engels, and W. Schäfer, editors, Informatik '99 - Annual meeting of the German Computer Science Society (GI), pages 390-399. Springer Verlag, 1999.
21. A. Middeldorp. Call by need computations to root-stable form. In Proc. 24th ACM Symposium on Principles of Programming Languages, pages 94-105, Paris, 1997.
22. A. Tolmach, S. Antoy, and M. Nita. Implementing functional logic languages using multiple threads and stores. In Proc. of the Ninth International Conference on Functional Programming (ICFP 2004), pages 90-102, Snowbird, Utah, USA, Sept. 2004. ACM Press.
23. D.H.D. Warren. Higher-order extensions to PROLOG: are they needed? In Machine Intelligence 10, pages 441-454, 1982.