Implementing functional logic languages using multiple threads and stores

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2004, Pages 90-102

  Tolmach, Andrew ^a   Antoy, Sergio ^a   Nita, Marius ^a  

^a Portland State University   (United States)

Author keywords

Functional logic languages; Multi versioned stores; Narrowing; Residuation

Indexed keywords

FUNCTIONAL LOGIC LANGUAGES; MULTI-VERSIONED STORES; NARROWING; RESIDUATION;

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; CONSTRAINT THEORY; PROGRAM COMPILERS; PROGRAM INTERPRETERS;

LOGIC PROGRAMMING;

EID: 13344268953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. H. Aït-Kaci. An overview of LIFE. In J. Schmidt and A. Stogny, editors, Proc. Workshop on Next Generation Information System Technology, pages 42-58. Springer LNCS 504, 1990.
2. E. Albert, M. Hanus, F. Huch, J. Oliver, and G. Vidal. Operational semantics for functional logic languages. In M. Comini and M. Falaschi, editors, Proc. Int'l Workshop on Functional and (Constraint) Logic Programming, volume 76 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.
3. S. Antoy, M. Hanus, B. Massey, and F. Steiner. An implementation of narrowing strategies. In PPDP01, pages 207-217. ACM Press, 2001.
4. A. W. Appel. Compiling with Continuations. Cambridge University Press, 1992.
5. K.-F. Faxén. Analysing, Transforming and Compiling Lazy Functional Programs. PhD thesis, Department of Teleinformatics, Royal Institute of Technology, June 1997.
6. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In PLDI'93, pages 237-247, 1993.
7. M. Hanus. Improving control of logic programs by using functional logic languages. In Proc. of the 4th Int. Symp. on Programming Language Implementation and Logic Programming, pages 1-23. Springer LNCS 631, 1992.
8. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
9. M. Hanus. Efficient translation of lazy functional logic programs into Prolog. In Proc. Fifth Int. Workshop on Logic Program Synthesis and Transformation, pages 252-266. Springer LNCS 1048, 1995.
10. M. Hanus. A unified computation model for declarative programming. In Proc. 1997 Joint Conference on Declarative Programming (APPIA-GULP-PRODE'97), pages 9-24, 1997.
11. M. Hanus. A unified computation model for functional and logic programming. In Proc. POPL'97, 24st ACM Symp. on Principles of Programming Languages, pages 80-93, 1997.
12. M. Hanus, S. Antoy, 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/, 2002.
13. M. Hanus, editor. Curry: An integrated functional logic language (version 0.8). Available at http://www.informatik. uni-kiel.de/~curry, Apr. 2004.
14. C. T. Haynes. Logic Continuations. Journal of Logic Programming, 4(2):157-176, June 1987.
15. C. T. Haynes and D. P. Friedman. Engines build process ab stractions. In Proc. 1984 ACM Conference on Lisp and Functional Programming, pages 18-24, Aug. 1984.
16. G. F. Johnson and D. Duggan. First-class stores and partial continuations in a programming language and environment. Computer Languages, 20(1):53-68, Mar. 1994.
17. T. Johnsson. Compiling lazy functional languages. Ph.D. thesis, Chalmers University, 1987.
18. R. E. Jones. Tail recursion without space leaks. Journal of Functional Programming, 2(1):73-79, January 1992.
19. J. Lloyd. Programming in an integrated functional and logic language. Journal of Functional and Logic Programming, 1999(3):1-49, 1999.
20. 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.
21. W. Lux. The Münster Curry compiler. Available at http: //danae.uni-muenster.de/~lux/curry/, 2004.
22. J. McCarthy. A basis for a mathematical theory of computations. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33-70. North-Holland, 1963.
23. R. Miller. A Demand Paging Virtual Memory Manager for System V. In USENIX Association Conference Proceedings, pages 178-182, June 1984.
24. R. Milner, M. Tofte, R. Harper, and D. B. MacQueen. The Standard ML Programming Language (Revised). MIT Press, 1997.
25. J. G. Morrisett. Refining first-class stores. In Proc. Workshop on State in Programming Languages, pages 73-87, Copenhagen, Denmark, June 1993.
26. S. Peyton Jones and S. Marlow. Secrets of the Glasgow Haskell Compiler inliner. Journal of Functional Programming, 12(4):393-434, July 2002.
27. P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Programming, 7(3):231-264, May 1997.
28. E. Shapiro, editor. Concurrent Prolog, Collected Papers, Volumes 1 and 2. MIT Press, Cambridge, Massachusetts, 1987.
29. G. Smolka. The Oz programming model. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, pages 324-343. Springer LNCS 1000, 1995.
30. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17-64, 1996.
31. A. Tolmach and S. Antoy. A monadic semantics for core Curry. In G. Vidal, editor, Electronic Notes in Theoretical Computer Science, volume 86. Elsevier, 2003.
32. A. P. Tolmach and A. W. Appel. A debugger for Standard ML. Journal of Functional Programming, 5(2):155-200, April 1995.