2436 search results - page 159 / 488 » Comonadic Notions of Computation |
116
click to vote
ECAL
2001
Springer
15 years 9 months ago
2001
Springer
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
149
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
120
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
134
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...