2436 search results - page 87 / 488 » Comonadic Notions of Computation |
120
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
156
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
112
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
139
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
155
click to vote
ESORICS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...