33 search results - page 3 / 7 » Adjoint Folds and Unfolds |
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
ASIAN
1999
Springer
13 years 11 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
CL
2000
Springer
13 years 12 months ago
2000
Springer
SAS
1998
Springer
13 years 11 months ago
1998
Springer
