921 search results - page 93 / 185 » Expressing Computational Complexity in Constructive Type The... |
PE
2002
Springer
13 years 7 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
VLDB
1992
ACM
14 years 8 hour ago
1992
ACM
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...