1147 search results - page 110 / 230 » Termination in language-based systems |
158
Voted
APLAS
2010
ACM
15 years 6 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
154
click to vote
JMM2
2008
15 years 6 months ago
2008
The current heterogeneous world of networks and terminals combined with the generalized mobility of users pose telecommunications operators and service providers the challenge of d...
237
click to vote
SCP
2011
15 years 1 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
147
click to vote
LICS
2009
IEEE
16 years 23 days ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
140
Voted
ICN
2009
Springer
16 years 20 days ago
2009
Springer
— The paper focuses on multi-hop routing mechanism used in relay based WiMAX networks. The proposal how to acquire channel state information (CSI) on relay and access path for de...