Sciweavers

1131 search results - page 84 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
98
Voted
PPDP
2007
Springer
15 years 6 months ago
Computing with subspaces
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 restri...
Sergio Antoy, Bernd Braßel
SCCC
1998
IEEE
15 years 4 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
112
Voted
ENTCS
2002
92views more  ENTCS 2002»
15 years 9 days ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...
VL
1996
IEEE
105views Visual Languages» more  VL 1996»
15 years 4 months ago
Enhancing Iconic Program Reusability with Object Sharing
This paper describes how to improve the reusability of iconic program modules. In iconic programming systems, the most important features for reuse are the customization of a modu...
Yuichi Koike, Yasuyuki Maeda, Yoshiyuki Koseki
91
Voted
LOPSTR
1999
Springer
15 years 4 months ago
Roles of Program Extension
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
Ralf Lämmel, Günter Riedewald, Wolfgang ...