8838 search results - page 196 / 1768 » Generalizing Domain Theory |
147
click to vote
MFCS
2001
Springer
15 years 9 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
142
click to vote
TACS
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
141
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
136
click to vote
FTCIT
2007
15 years 4 months ago
2007
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition...
114
click to vote
MLQ
2000
15 years 4 months ago
2000
It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct tran...