Results 1 
5 of
5
Communication as Fair Distribution of Knowledge
 In Proc. of OOPSLA'91
, 1991
"... We introduce an abstract form of interobject communication for objectoriented concurrent programming based on the proof theory of Linear Logic, a logic introduced to provide a theoretical basis for the study of concurrency. Such a form of communication, which we call forumbased communication, ca ..."
Abstract

Cited by 45 (12 self)
 Add to MetaCart
We introduce an abstract form of interobject communication for objectoriented concurrent programming based on the proof theory of Linear Logic, a logic introduced to provide a theoretical basis for the study of concurrency. Such a form of communication, which we call forumbased communication, can be seen as a refinement of blackboardbased communication in terms of a more local notion of resource consumption. Forumbased communication is introduced as part of a new computational model for the objectoriented concurrent programming language LO, presented at last year OOPSLA/ECOOP (1990), which exploits the prooftheory of Linear Logic also to achieve a powerful form of knowledgesharing.
A Categorial Approach to the Combination of Logics
, 1999
"... LOGICAL SYSTEMS: LOCAL AND GLOBAL LOGICS The concept of possibletranslations semantics (also called nondeterministic semantics) was introduced and discussed in (Carnielli (1990)) and (Carnielli (forthcoming)) as a new semantic approach to general logical systems, based on the idea of defining new ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
LOGICAL SYSTEMS: LOCAL AND GLOBAL LOGICS The concept of possibletranslations semantics (also called nondeterministic semantics) was introduced and discussed in (Carnielli (1990)) and (Carnielli (forthcoming)) as a new semantic approach to general logical systems, based on the idea of defining new forcing relations combining simple semantics by means of translations. Although several ideas on combinations of logics can be found in the literature, as described for example in (Blackburn & Rijke (1997)) and (Caleiro, Sernadas & Sernadas (manuscript)), this approach offers a different perspective to the question, which leads to new semantics for general logics, including several manyvalued, paracomplete and paraconsistent logics. A special form of possibletranslations semantics called society semantics, which is particularly apt for manyvalued logics, has been presented in (Carnielli & LimaMarques (1999)).
Interconnection of Object Specifications
 Formal Methods and Object Technology
, 1996
"... ing yet further from reality, we might proscribe the simultaneous effect of two or more methods on an object's state; doing so, we impose a monoid structure on the fixed set of methods proper to an object class. Applying methods one after the other corresponds to multiplication in the monoid, and ap ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
ing yet further from reality, we might proscribe the simultaneous effect of two or more methods on an object's state; doing so, we impose a monoid structure on the fixed set of methods proper to an object class. Applying methods one after the other corresponds to multiplication in the monoid, and applying no methods corresponds to the identity of the monoid. A monoid is a set M with an associative binary operation ffl M : M \ThetaM ! M , usually referred to as `multiplication', which has an identity element e M 2 M . If M = (M; ffl M ; e M ) is a monoid, we often write just M for M, and e for e M ; moreover for m;m 0 2 M , we usually write mm 0 instead of m ffl M m 0 . For example, A , the set of lists containing elements of A, together with concatenation ++ : A \ThetaA ! A and the empty list [ ] 2 A , is a monoid. This example is especially important for the material in later sections. A monoid homomorphism is a structure preserving map between the carriers of ...
Deriving Parallel Numerical Algorithms using Data Distribution Algebras: Wang's Algorithm
, 1996
"... Parallel and distributed programming are much more difficult than the development of sequential algorithms due to data distribution issues and communication requirements. This paper presents a methodology that enables the abstract description of the distribution of data structures by means of overla ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Parallel and distributed programming are much more difficult than the development of sequential algorithms due to data distribution issues and communication requirements. This paper presents a methodology that enables the abstract description of the distribution of data structures by means of overlapping covers that form data distribution algebras. Algorithms are formulated and derived by transformation in a functional environment using skeletons, i.e. higherorder functions with specific parallel implementations. Communication is specified implicitly through the access to overlapping parts of covers. Such specifications enable the derivation of explicit lowerlevel communication statements. We illustrate the concepts by a complete derivation of Wang's partition algorithm for the solution of tridiagonal systems of linear equations. CONTENTS 2 Contents 1 Introduction 3 1.1 Motivation and Goals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Notation . . . . . . ....
Modeling Interaction by Sheaves and Geometric Logic
 In G. Ciobanu and Gh. Paun eds, Proc. International Conference Fundamentals of Computation Theory (FCT’99), LNCS 1684
, 1999
"... In this paper we show that, given a family of interacting systems, many notions which are important for expressing properties of systems can be modeled as sheaves over a suitable topological space. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper we show that, given a family of interacting systems, many notions which are important for expressing properties of systems can be modeled as sheaves over a suitable topological space.