85 search results - page 10 / 17 » Specialization of Lazy Functional Logic Programs |
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
PEPM
2004
ACM
14 years 1 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
PPDP
2001
Springer
14 years 8 days ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
WCFLP
2005
ACM
14 years 1 months ago
2005
ACM
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...