Towards the uniform implementation of declarative languages

Computer Languages

Volumn 23, Issue 2-4, 1997, Pages 121-160

  Chakravarty, Manuel M T ^a   Lock, Hendrik C R ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Abstract machine; Functional programming; Logic programming

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; FORMAL LOGIC; MACHINE ORIENTED LANGUAGES; PROGRAM COMPILERS; PROGRAM TRANSLATORS;

ABSTRACT MACHINES; DECLARATIVE LANGUAGES; FUNCTIONAL PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0031177198     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0096-0551(97)00012-x     Document Type: Article

References (65)

1. Johnsson, T., Efficient compilation of lazy evaluation. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction. ACM Press, New York, 1984.
2. Koopman, P., van Eekelen, M., Nocker, E., Smetsers, J. and Plasmeijer, M., The ABC-machine: A sequential stack-based abstract machine for graph rewriting. Technical Report 90-22, University of Nijmegen, 1990.
3. Peyton Jones, S. L. and Lester, D.R., Implementing Functional languages: A Tutorial. Prentice-Hall, New York, 1992.
4. Peyton Jones, S. L., Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming, 2(2), 1992. Also available as a technical report from the University of Glasgow.
5. Langendoen, K. and Hartel, P. H., FCG: a code generator for lazy functional languages. In Proceedings of the Conference on Compiler Construction. Springer, Berlin, 1992.
6. Warren, D. H. D., An abstract Prolog instruction set. Technical Note 309, SRI International, October 1983.
7. Aït-Kaci, H., Warren's Abstract Machine: A Tutorial Reconstruction. Series in Logic Programming. The MIT Press, Cambridge, MA, 1991.
8. Van Roy. P., Can Logic Programming Execute as Fast as Imperative Programming. Ph.D. thesis, University of California, Berkley, Dec 1990.
9. Taylor, A., High Performance Prolog Implementation. Ph.D. thesis, University of Sydney, 1991.
10. Haygood, R. C., Native code compilation in SICStus Prolog. In Pascal van Hentenryck, editor, Proceedings of the 11th International Conference on Logic Programming, Logic Programming. The MIT Press, Cambridge, MA, 1994.
11. Peyton Jones, S. L. and Launchbury, J., Unboxed values as first class citizens in a non-strict functional language. In J. Hughes, editor, FPCA '91, Springer, Berlin, 1991.
12. Peterson, J. et al. Haskell 1.3: a non-strict, purely functional language. Research Report YALEU/DCS/RR-1106, Yale University, May 1996.
13. Hartel, P., et al. Benchmarking implementations of functional languages with "pseudoknot", a float-intensive benchmark. Journal of Functional Programming, 6(4), 1996.
14. Guo, Y., Definitional Constraint Programming. Ph.D. thesis, Imperial College London, 1994.
15. Lloyd, J. W., Practical advantage of declarative programming. In GULP-PRODE, 1994.
16. Bosco, P.G., Cecchi, C. and Moiso, C., An extension of WAM for K-LEAF: a WAM-based compilation of conditional narrowing. In Proceedings of the 6th International Conference of Logic Programming. The MIT Press, Cambridge, MA, 1989.
17. Hanus, M., Efficient implementation of narrowing and rewriting. In Proceedings of the International Workshop on Processing Declarative Knowledge (PDK '91), volume 567 of INAI, Springer, Berlin, 1991, pp. 344-365.
18. Mück, A., CAMEL: An extension of the categorial abstract machine to compile functional/logic programs. In Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming. Springer, Berlin, 1992.
19. Moreno-Navarro, J. J., Kuchen, H., Loogen, R. and Rodriguez-Artalejo, M., Lazy narrowing in a graph machine. In Proceedings of the Conference on Algebraic and Logic Programming, number 463 in LNCS, 1990.
20. Loogen, R., From reduction machines to narrowing machines. In TAPSOFT'91, Colloquium on Combining Paradigms for Software Development, number 494 in LNCS, Springer, Berlin, 1991, pp. 438-454.
21. Peyton Jones, S. L. and Salkild, J., The spineless tagless G-machine. In Workshop on Implementations of Lazy Functional Languages. ACM Press, New York, Aspensas, Schweden, 1988.
22. Lock, H. C. R., Guarded TermML. In Workshop on Implementations of Lazy Functional Languages. ACM Press, New York, 1988. Aspenas, Univ. Göteborg, Sweden.
23. Chakravarty, M. M. T., The functional logic programming language Guarded TermML: Language definition (in German). Studienarbeit, GMD Research Center Karlsruhe, May 1991.
24. Hudak, P., et al. Haskell special issue. ACM SIGPLAN Notices, May 1992.
25. Sterling and Shapiro. The Art of Prolog. The MIT Press, Cambridge, MA, 1986.
26. Hanus, M., The integration of functions into logic programming: from theory to practice. Journal of Logic Programming, 19, 20, 1994.
27. Millner, R. A theory of type polymorphism in programming. Journal of Computer System Science, 17(3), 1978.
28. Milner, R., Tofte, M. and Harper, R., The Definition of Standard ML. The MIT Press, Cambridge, MA, 1990.
29. Peyton Jones, S. L. The Implementation of Functional Proyramming Languages. Series in Computer Science. Prentice-Hall, New York, 1987.
30. Lock, H. C. R., The Implementation of Functional Logic Programming Languages. Ph.D. thesis, Technische Universität Berlin, FRG, May 1992. Published by Oldenbourg Verlag, München, series GMD Berichte, No 208, June 1993.
31. Antoy, S., Echahed, R. and Hanus, M., A needed narrowing strategy. In Proceedings of the 21st Symposium on Principles of Programming Languages, ACM Press, New York, 1994, pp. 268-279.
32. Hill, P. M. and Lloyd, J. W., The Gödel Programming Language. The MIT Press, Cambridge, MA, 1994.
33. Lloyd, J. W., Foundations of Logic Programming, 2nd ed. Springer, Belrin, 1987.
34. Hölldobler, S., Foundation of Equational Logic Programming. Number 353 in LNAI. Springer, Berlin, 1989.
35. Gallier, J. H. and Raatz, S., Extending SLD-resolution to equational horn clauses using E-unification. Journal of logic Programming, 6, 1989.
36. Hullot, J.-M. Canonical forms and unification. In Proceedings of the 5th Conference on Automated Deduction, number 87 in LNCS. Springer, Berlin, 1980.
37. Reddy, U. S., Narrowing as the operational semantics of functional languages. In Proceedings of the IEEE International Symposium on Logic Programming. IEEE Computer Society Press, New York, 1985.
38. Meijer, E. and Paterson, R., Down with λ-lifting. http://www.cs.ruu.nl/people/erik/down.html, University of Utrecht, The Netherlands, Sept. 1990. Unpublished manuscript.
39. Jaffar, J. and Lassez, J.-L., Constraint logic programming. In Principles of Programming Languages. ACM Press, New York, 1987, pp. 111-119.
40. Lock, H. C. A., Mück R. and Streicher, T., A tiny functional logic constraint language and its continuation semantics. In ESOP '94, Edinburgh, number 788 in LNCS. Springer, Berlin, 1994.
41. Prehofer, C., Higher-order narrowing. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, pp. 507-516. IEEE Computer Society Press, New York, 1994.
42. G. P. Huet. The undecidability of unification in third-order logic. Information and Control 22, 257-267 (1973).
43. Miller, D., A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4), 1991.
44. Smolka, G., A calculus for higher-order concurrent constraint programming with deep guards. Research Report RR-04-03, DFKI, 1994.
45. Guo, Y., Lambda calculus with logical variables. 3rd Workshop on Functional Logic Languages, 1994.
46. Aït-Kaci, H. and Podelski, A., Towards a meaning of LIFE. In J. Maluszynski and M. Wirsing, editors, Programming Language Implementation and Logic Programming. Springer, Berlin, 1991. LNCS 528, pp. 255-274.
47. G. Smolka. Feature-constraint logic for unification grammars. Journal of Logic Programming 12, 51-87 (1992).
48. Hanus, M. Compiling logic programs with equality. In Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming, number 456 in LNCS. Springer, Berlin, 1990.
49. J. J. Moreno-Navarro and M. Rodriguez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming 12, 189-223 (1992).
50. Chakravarty, M. M. T. and Lock, H. C. R., The implementation of lazy narrowing. In Programming Language Implementation and Logic Programming, ed. J. Maluszynski and M. Wirsing, number 528 in LNCS. Springer, Berlin, 1991, pp. 123-134.
51. Sankaran, N., A bibliography on garbage collection and related topics. SIGPLAN Notices, 29(9), 1994.
52. Fairbairn, J. and Wray, S. TIM - a simple lazy abstract machine to execute supercombinators. In Proceedings of the Conference on Functional Programming and Computer Architecture, ed. G. Kahn, number 274 in LNCS. Springer, Berlin, 1987.
53. Hartel, P. H., Benchmarking implementations of lazy functional languages II - two years later. Technical Report CS-94-21, University of Amsterdam, 1994.
54. Hammond, K. and Peyton Jones, S. L., Profiling scheduling strategies on the GRIP parallel reducer. In Proceedings of the 4th International Workshop on the Parallel Implementation of Functional Languages. RWTH Aachen, Germany, 1991.
55. Aho, A. V., Sethi, R. and Ullman, J. D., Compilers-Principles, Techniques, and Tools. Addison-Wesley, Reading, MA 1986.
56. Loogen, R. and Winkler, S., Dynamic detection of determinism in functional logic languages. In Programming Language Implementation and Logic Programming, ed. J. Maluszynski and M. Wirsing, number 528 in LNCS. Springer, Berlin, 1991.
57. Peyton, S., Jones, L., Hall, C. V., Hammond, K., Partain, W. D. and Wadler, P. L., The Glasgow Haskell Compiler: a technical overview. In Proc. of the UK Joint Framework for Information Technology (JFIT) Technical Conference, 1993.
58. P. Van Roy. 1983-1993: The wonder years of sequential Prolog implementations. Journal of Logic Programming 1920, 385-441 (1994).
59. Z. Somogyi, F. J. Henderson and T. C. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming 29, 17-64 (1996).
60. Kuchen, H., Loogen, R., Moreno-Navarro, J.J. and Rodriguez-Artalejo, M., Graph-based implementation of a functional logic language. In Proceedings of European Symposium on Programming '90, number 432 in LNCS, 1990.
61. R. Loogen. Relating the implementation techniques of functional and functional logic languages. New Generation Computing 11, 179-215 (1993).
62. Nakagawa, K., Nishioka, T. and Suzuki, T., Compiling programs of an applicative narrowing calculus. In Mt Fuji International Workshop on Functional and Logic Programming, Singapore, 1995. Japan Society of Software Science and Technology, World Scientific Publishing, pp. 78-91.
63. Goldfarb, W., The undecidability of the second-order unification problem. Theoretical Computer Science, 13, 1981.
64. Qian, Z., Higher-order equational logic programming. In Conference Record of Symposium on Principles of Programming Languages. ACM Press, New York, 1994.
65. Nakahara, K., Middeldorp, A. and Ida, T., A complete narrowing calculus for higher-order functional logic programming. In Proceedings of Seventh International Conference on Programming Languages: Implementations, Logics, and Programming 95 (PLILP '95), number 982 in LNCS. Springer, Berlin, 1995, pp. 97-114.