2272 search results - page 289 / 455 » A Calculus for |
133
click to vote
IWFM
2003
15 years 5 months ago
2003
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
146
click to vote
KRDB
2003
15 years 5 months ago
2003
Flat transactions with savepoints are a variation of the classical flat transactions that allows the user to go undo work done so far back to a certain point within the transacti...
160
click to vote
SNPD
2003
15 years 5 months ago
2003
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms in so-called direct mode. In a directmode BSP algorithm...
144
click to vote
AIML
1998
15 years 5 months ago
1998
Abstract. This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered ch...
140
click to vote
WOA
2000
15 years 5 months ago
2000
ogramming are evaluated along three different guidelines: the programming abstractions the calculus suggests; the underlying programming model; the security mechanisms provided. Th...