479 search results - page 34 / 96 » The theory and calculus of aliasing |
JLP
2007
13 years 7 months ago
2007
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the...
CL
2000
Springer
14 years 4 days ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
KR
2000
Springer
13 years 11 months ago
2000
Springer
The ability to reason about action and change has long been considered a necessary component for any intelligent system. Many proposals have been offered in the past to deal with ...