4328 search results - page 131 / 866 » A New Kind of Science |
157
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
167
click to vote
FECS
2010
15 years 4 months ago
2010
This paper describes the experience of teaching robotics at the freshman level, from the conception of the project through the offering of a computer science seminar in robotics, h...
199
click to vote
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a new programming language called BlenX. It is strongly inspired to process calculi and it is an evolution of Betabinders. It has been specifically designed and implem...
179
click to vote
TCS
2011
15 years 1 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
162
Voted
TCS
2011
15 years 1 months ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...