2436 search results - page 151 / 488 » Comonadic Notions of Computation |
129
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality betwe...
115
click to vote
DEDS
2008
15 years 4 months ago
2008
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
118
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which i...
137
click to vote
JAIR
2006
15 years 4 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...