Name
Abstract | ||
|---|---|---|
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restricts the validity of the argument of getAllValues. This restriction ensures that essential language features like the call-time choice semantics, the independence of the order of evaluation, and the referential transparency of the language are preserved when getAllValues is executed. Up to now, conflicts between these language features and primitives like getAllValues have been seen as one of the main problems for employing such primitives in functional logic languages. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1273920.1273936 | Principles and Practice of Declarative Programming |
Keywords | Field | DocType |
call-time choice semantics,non-de- terminism,essential language feature,referential transparency,non-deterministic expression,subspaces,main problem,language feature,rewrite systems,functional logic program,primitive getallvalues,new definition,functional logic language,functional logic programming languages,functional logic programming,design | Functional logic programming,Fifth-generation programming language,Computational logic,Programming language,Computer science,Description logic,Theoretical computer science,Philosophy of logic,Logic programming,Ontology language,Language primitive | Conference |
Citations | PageRank | References |
6 | 0.52 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergio Antoy | 1 | 896 | 76.13 |
| Bernd Braßel | 2 | 181 | 12.47 |