1916 search results - page 137 / 384 » Reasoning with class algebra |
96
Voted
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we present an approach to describe uniformly iterated “big” operations, like Pn i=0 f(i) or maxi∈I f(i) and to provide lemmas that encapsulate all the commonly...
139
click to vote
CSFW
2003
IEEE
15 years 6 months ago
2003
IEEE
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal l...
89
Voted
CSL
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
112
click to vote
TPHOL
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
ICFP
1998
ACM
15 years 5 months ago
1998
ACM
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...