20 search results - page 2 / 4 » Solvability in Resource Lambda-Calculus |
113
Voted
FUIN
2010
15 years 29 days ago
2010
We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...
112
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
145
Voted
TCS
2010
14 years 10 months ago
2010
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
123
Voted
FORMATS
2003
Springer
15 years 8 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
174
Voted
JSA
2010
14 years 10 months ago
2010
In this paper we study multi-level dynamically reconfigurable architectures. These are extensions of standard reconfigurable architectures where ordinary reconfiguration operation...