239 search results - page 29 / 48 » Partial Evaluation of Functional Logic Programs |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Algorithmic skeletons can be used to write architecture independent programs, shielding application developers from the details of a parallel implementation. In this paper, we pre...
SIAMCOMP
2008
13 years 7 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...
LCTRTS
1998
Springer
13 years 11 months ago
1998
Springer
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
CONCUR
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...