2171 search results - page 138 / 435 » A Generic Process Algebra |
129
click to vote
ECSQARU
2009
Springer
15 years 1 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
109
click to vote
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
124
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors and effect deconstructors; it also provides a link wit...
137
click to vote
ESOP
2001
Springer
15 years 7 months ago
2001
Springer
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
134
click to vote
JAR
1998
15 years 2 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...