Name
Abstract | ||
|---|---|---|
A distinguishing feature of logic and functional logic lan- guages is their ability to perform computations with partial data and to search for solutions of a goal. Having a built-in search strategy is convenient but not always sucient. For many practical applications the built-in search strategy (usually depth-first search via global back- tracking) is not well suited. Also the non-deterministic instantiation of unbound logic variables conflicts with the monadic I/O concept, which requires a single-threaded use of the world. A solution to these problems is to encapsulate search via a primitive operator try, which returns all possible solutions to a search goal in a list. In the present paper we develop an abstract machine that aims at an ecient implementation of encapsulated search in a lazy functional logic language. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/10705424_7 | Fuji International Symposium on Functional and Logic Programming |
Keywords | Field | DocType |
lazy functional logic language,encapsulated search,abstract machine,depth first search | Incremental heuristic search,Programming language,Functional programming,Computer science,Lazy evaluation,Algorithm,Multimodal logic,Beam search,Theoretical computer science,Logic programming,Linear search,Backtracking | Conference |
Volume | ISSN | ISBN |
1722 | 0302-9743 | 3-540-66677-X |
Citations | PageRank | References |
17 | 0.76 | 14 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wolfgang Lux | 1 | 62 | 6.02 |