254 search results - page 19 / 51 » Qualified Computations in Functional Logic Programming |
ICCS
2009
Springer
14 years 5 months ago
2009
Springer
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
TCS
2011
13 years 5 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
ARC
2009
Springer
14 years 5 months ago
2009
Springer
The parallel branching program machine (PBM128) consists of 128 branching program machines (BMs) and a programmable interconnection. To represent logic functions on BMs, we use qua...
AGP
1994
IEEE
14 years 2 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
ICFP
2007
ACM
14 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...