745 search results - page 77 / 149 » The Functional Side of Logic Programming |
136
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
105
click to vote
ALP
1990
Springer
15 years 8 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
124
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
121
Voted
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
138
click to vote
PPDP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...