8766 search results - page 74 / 1754 » Functional logic programming |
SSR
2001
13 years 10 months ago
2001
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
SIAMCOMP
2008
13 years 9 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...
CORR
2004
Springer
13 years 8 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...
LOPSTR
2004
Springer
14 years 2 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 ...
PPDP
2004
Springer
14 years 2 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...