74 search results - page 13 / 15 » Algebras Versus Coalgebras |
LICS
2008
IEEE
14 years 5 days ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
ALGORITHMICA
2002
13 years 5 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
FOSSACS
2003
Springer
13 years 11 months ago
2003
Springer
We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers h...
ESANN
2003
13 years 7 months ago
2003
Abstract. Recently, a new method intended to realize conformal mappings has been published. Called Locally Linear Embedding (LLE), this method can map high-dimensional data lying o...