Implementing encapsulated search for a lazy functional logic language

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

Volumn 1722, Issue , 1999, Pages 100-113

  Lux, Wolfgang ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING;

ABSTRACT MACHINES; DEPTH FIRST SEARCH; EFFICIENT IMPLEMENTATION; FUNCTIONAL LOGIC LANGUAGES; PARTIAL DATA; PRIMITIVE OPERATOR; SEARCH STRATEGIES; SINGLE-THREADED;

COMPUTER CIRCUITS;

EID: 84957704326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_7     Document Type: Conference Paper

References (19)

1. H. Aït-Kaci, P. Lincoln, and R. Nasr. Le Fun: Logic, Equations, and Functions. Proc. ILPS’87, pp. 17-23, 1987. 101
2. G. Gupta and B. Jayaraman. Analysis of Or-Parallel Execution Models. ACM TOPLAS, 15(4):659-680, Sept. 1993. 112
3. M. Hanus. On the Completeness of Residuation. Proc. JICSLP’92, pp. 192-206. MIT Press, 1992. 101
4. M. Hanus. Curry: An integrated functional logic language, (version 0.5). http://www-i2.informatik.rwth-aachen.de/~hanus/curry, 1999. 100
5. F. Henderson, Th. Conway, and Z. Somogyi. Compiling Logic Programs to C Using GNU C as a Portable Assembler. Proc. of the ILPS’95 Post-conference Workshop on Sequential Implementation Technologies for Logic Programming Languages, pp. 1-15, 1995. 111
6. P. Hudak, S. Peyton Jones, and P. Wadler. Report on the Programming Language Haskell (version 1.2). SIGPLAN Notices, 27(5), 1992. 101
7. M. Hanus and F. Steiner. Controlling Search in Declarative Programs. Proc. PLILP’98, pp. 374-390, 1998. 100, 103
8. T. Johnsson. Efficient Compilation of Lazy Evaluation. Proc. SIGPLAN’84 Symposium on Compiler Construction, pp. 58-69, 1984. 101, 101
9. T. Johnsson. Compiling Lazy Functional Languages. PhD thesis, Chalmers Univ. of Technology, 1987. 105, 112
10. H. Kuchen, R. Loogen, J. Moreno-Navarro, and M. Rodríguez-Artalejo. Graph-Based Implementation of a Functional Logic Language. Proc. ALP 1990, pp. 298-317. Springer LNCS 463, 1992. 101, 101
11. H. Kuchen, R. Loogen, J. Moreno-Navarro, and M. Rodríguez-Artalejo. The Functional Logic Language Babel and its Implementation on a Graph Machine. New Generation Computing, 14:391-427, 1996. 105, 112
12. W. Lux and H. Kuchen. An Abstract Machine for Curry. Technical Report, Univerisity of Münster, 1999. 101
13. M. Mehl, R. Scheidhauer, and Ch. Schulte. An Abstract Machine for Oz. Proc. PLILP’95, pp. 151-168. Springer, LNCS 982, 1995. 112
14. S. Peyton Jones. Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-machine. Journal of Functional Programming, 2(1):73-80, Jan 1992. 111
15. S. Peyton Jones and P. Wadler. Imperative Functional Programming. Proc. 20th POPL’93, pp. 123-137, 1993. 100
16. U. Reddy. Narrowing as the Operational Semantics of Functional Languages. Proc. ILPS’85, pp. 138-151, 1985. 100
17. G. Smolka. The Oz Programming Model. In J. van Leeuwen (ed.), Current Trends in Computer Science. Springer LNCS 1000, 1995. 112
18. Ch. Schulte, G. Smolka, and J. Würtz. Encapsulated Search and Constraint Programming in Oz. Proc. of the Second Workshop on Principles and Practice of Constraint Programming. Springer, 1994. 100
19. D. Warren. An Abstract Prolog Instruction Set. Technical Report 309, SRI, 1983. 112