Filters








11,132 Hits in 3.5 sec

Inheritance in the join calculus

Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
2003 The Journal of Logic and Algebraic Programming  
We design an extension of the join calculus with class-based inheritance. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages.  ...  Our language and its type system are compatible with the JoCaml implementation of the join calculus.  ...  Cross-encodings to the join calculus In the join calculus of [10] , each definition binds one or several channel names that can be passed independently whereas, in the objective join calculus of Section  ... 
doi:10.1016/s1567-8326(03)00040-7 fatcat:hk5mk333rvadvawbtgidje5xpq

Inheritance in the Join Calculus [chapter]

Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
2000 Lecture Notes in Computer Science  
We design an extension of the join calculus with class-based inheritance. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages.  ...  Our language and its type system are compatible with the JoCaml implementation of the join calculus.  ...  Cross-encodings to the join calculus In the join calculus of [10] , each definition binds one or several channel names that can be passed independently whereas, in the objective join calculus of Section  ... 
doi:10.1007/3-540-44450-5_32 fatcat:xgntzqc5ejdfbovrvumiqkrzpe

Expressive Synchronization Types for Inheritance in the Join Calculus [chapter]

Qin Ma, Luc Maranget
2003 Lecture Notes in Computer Science  
doi:10.1007/978-3-540-40018-9_3 fatcat:neccjtzg7nfl5cwsoaajqnn7sa

Information Hiding in the Join Calculus [chapter]

Qin Ma, Luc Maranget
2007 Lecture Notes in Computer Science  
We study the issue both at the object level and class level, in the context of an object-oriented extension of the Join calculus -a process calculus in the tradition of the π-calculus.  ...  In this extended abstract we focus on the class level and design a new hiding operation on classes, aimed at preventing part of parent classes from being visible in client (inheriting) classes.  ...  They extend the Join calculus with a class language, in which various operations are designed to support a variety of inheritance paradigms.  ... 
doi:10.1007/978-3-540-77505-8_19 fatcat:2n3o2ebszngulit5i65ij4bumu

Calculi for Concurrent Objects [chapter]

Cosimo Laneve
1999 Formal Methods for Open Object-Based Distributed Systems  
As a result, the semantics is often crisp and one stumbles into anomalies (cft inheritance anomaly [8]) or typing flaws [10].  ...  On the other hand the concepts of processes and objects seem strongly related. The formers are entities that interact with the environment, possibly with a dynamically P. Ciancarini et al.  ...  Some progress in this direction is done in [5] , where a class based calculus has been developed out of a well known process calculus -the join-calculus -and a formal analysis of inheritance and possible  ... 
doi:10.1007/978-0-387-35562-7_27 fatcat:voouacz54nevzmou5gsj576soq

On Implementing High Level Concurrency in Java [chapter]

G. Stewart Itzstein, Mark Jasiunas
2003 Lecture Notes in Computer Science  
We describe how, whilst the Join calculus is non-deterministic, a form of determinism can and should be specified in Join Java.  ...  We also give reasons why inheritance of Join patterns is restricted in our initial implementation.  ...  Inheritance in Join Java is supported by the standard Java language. However, we do not allow Join patterns to be inherited.  ... 
doi:10.1007/978-3-540-39864-6_13 fatcat:cngdywze25da3lcsgj7v2n5ibu

Fuzzy database query languages and their relational completeness theorem

Y. Takahashi
1993 IEEE Transactions on Knowledge and Data Engineering  
A fuzzy calculus query language is constructed based on the relational calculus and a fuzzy algebra query language is also constructed based on the relational algebra.  ...  In addition, this paper proves a fuzzy relational completeness theorem such that both the languages have equivalent expressive power to each other.  ...  For example, the &join and the natural join are defined as follows. 6) 0-Join: The &join of R and 5' is defined as a combination of two fundamental fuzzy algebraic operations: the Cartesian product and  ... 
doi:10.1109/69.204096 fatcat:ymk7eyqfrrasvddy7jiwoctyba

The Semijoin Algebra [chapter]

Jan Van den Bussche
2006 Lecture Notes in Computer Science  
Whereas the relational algebra is equivalent to the relational calculus, i.e., first-order logic, we show that when we only consider equi-semijoins, the semijoin algebra is equivalent in expressive power  ...  The semijoin algebra is the fragment of the classical relational algebra obtained by replacing the join operator by the semijoin operator.  ...  Whereas the relational algebra is equivalent to the relational calculus, i.e., first-order logic, we show that when we only consider equi-semijoins, the semijoin algebra is equivalent in expressive power  ... 
doi:10.1007/11663881_1 fatcat:ownxxpwyjfcgjbnoe4dtu2lsli

A theory of distributed aspects

Nicolas Tabareau
2010 Proceedings of the Eighth International Conference on Aspect-Oriented Software Development - AOSD '10  
In this way, we provide a well-defined version of a weaving algorithm which constitutes the main step towards an implementation of the aspect join calculus directly in JoCaml.  ...  We also give a translation of the aspect join calculus into the core join calculus. The translation is proved to be correct by a bisimilarity argument.  ...  Note that if we add inheritance in the join calculus, as done in [6] , then most of Java can be encoded.  ... 
doi:10.1145/1739230.1739246 dblp:conf/aosd/Tabareau10 fatcat:xelumhbrrzg33bx2rdq3dr3uui

An extension of path expressions to simplify navigation in object-oriented queries [chapter]

Jan Bussche, Gottfried Vossen
1993 Lecture Notes in Computer Science  
We present and study an extended mechanism for path expressions which resembles the omission of joins in universal relation interfaces.  ...  The semantics of our mechanism is given in the general framework of a calculus-like query language. Techniques from semantic query optimization are employed to obtain e cient speci cations.  ...  The authors are grateful to Catriel Beeri and Michael Schre for helpful comments on an earlier version of this paper.  ... 
doi:10.1007/3-540-57530-8_17 fatcat:wmbd6adp4rc4nag6lqbyazwbqi

The reflexive CHAM and the join-calculus

Cédric Fournet, Georges Gonthier
1996 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96  
It can also be seen as a process calculus, the join-calculus, which we prove equivalent to the -calculus of Milner, Parrow and Walker. * ) 'readyhlaseri j jobh1i jobh2i Denoted D or J .  ...  P , a reaction consumes compound molecules that have a speci c join pattern J, and produces new molecules in the solution that are copies of P where the formal parameters of J have been instantiated to  ...  Acknowledgments This works started from a seminar on \distributing the -calculus" held in 1995 at INRIA, with the participation of Damien Doligez, Florent Guillaume, Jean-Jacques L evy, Luc Maranget, and  ... 
doi:10.1145/237721.237805 dblp:conf/popl/FournetG96 fatcat:3qgfhojuofhxzebzgbga5gy4me

JEScala

Jurgen M. Van Ham, Guido Salvaneschi, Mira Mezini, Jacques Noyé
2014 Proceedings of the 13th international conference on Modularity - MODULARITY '14  
However, with current approaches the coordination logic involved in complex coordination schemas is fragmented into several pieces including join patterns, data emissions triggered in different places  ...  of the application, and the application logic that implicitly creates dependencies among communication channels, hence indirectly among join patterns.  ...  We have already mentioned the objective join calculus [14] , which deals with objects and inheritance.  ... 
doi:10.1145/2577080.2577082 dblp:conf/aosd/HamSMN14 fatcat:xcpq5nkl45cqzb7jmvliqlvkdm

Page 5147 of Mathematical Reviews Vol. , Issue 97H [page]

1997 Mathematical Reviews  
Nodes in the join-tree are cliques of variables and tree-inference is exponential in w*, the size of the maximal clique in the join-tree.  ...  More recently, the event calculus has been defined to describe actual action, i.e., those that have occurred in the past, and their effects on the domain.  ... 

Page 1776 of Mathematical Reviews Vol. , Issue 92c [page]

1992 Mathematical Reviews  
We show how a simple model of object-oriented programming, including hidden instance variables and multiple inheritance, may be coded in this calculus.  ...  This paper answers the question of which functions on binary trees are definable by terms in the typed lambda calculus.  ... 

Page 1776 of Mathematical Reviews Vol. , Issue 92d [page]

1992 Mathematical Reviews  
We show how a simple model of object-oriented programming, including hidden instance variables and multiple inheritance, may be coded in this calculus.  ...  This paper answers the question of which functions on binary trees are definable by terms in the typed lambda calculus.  ... 
« Previous Showing results 1 — 15 out of 11,132 results