2436 search results - page 21 / 488 » Comonadic Notions of Computation |
FCSC
2010
13 years 6 months ago
2010
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
JELIA
2004
Springer
14 years 26 days ago
2004
Springer
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
Computer science is necessary but not sufficient to understand and overcome the problems we face in software engineering. We need to understand not only the properties of the soft...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...