Filters








147 Hits in 3.5 sec

An Abstract Machine for the Kell Calculus [chapter]

Philippe Bidinger, Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
This paper presents an abstract machine for an instance of this calculus, a proof of its correctness, and a prototype OCaml implementation.  ...  The Kell Calculus is a family of process calculi intended as a basis for studying distributed component-based programming.  ...  Conclusion We have presented an abstract machine for an instance of the Kell calculus, and discussed briefly its OCaml implementation.  ... 
doi:10.1007/11494881_3 fatcat:y7zrjbkdfve77jtfvxvplbygsq

The Kell Calculus: A Family of Higher-Order Distributed Process Calculi [chapter]

Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming  ...  The Kell calculus is built around a π-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical localities, local  ...  Acknowledgments This paper has benefited from several discussions on the Kell calculus, over the past year, with David Teller, Daniel Hirschkoff, Tom Hirschowitz, Matthew Hennessy, Vasco Vasconcelos, Eugenio  ... 
doi:10.1007/978-3-540-31794-4_9 fatcat:bbeuy3dikrbghnybn4kpaeeut4

Component-Oriented Programming with Sharing: Containment is Not Ownership [chapter]

Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
Components and the Kell calculus After giving an informal description of the Kell calculus [18] , which is our starting point, we present the main elements of a concrete component model, the Fractal model  ...  The Kell calculus The Kell calculus is a higher-order process calculus with hierarchical localities (called kells), local communication, and locality passivation.  ...  The resulting language, an extension of the Kell calculus [18] , turns out to be an interesting model of component-oriented programming, as we show by encoding key aspects of the Fractal component model  ... 
doi:10.1007/11561347_26 fatcat:itruuuphebcczflrbmt3ktqhja

Components as Location Graphs [chapter]

Jean-Bernard Stefani
2015 Lecture Notes in Computer Science  
This paper presents a process calculus framework for modeling ubiquitous computing systems and dynamic component-based structures as location graphs.  ...  In this paper, we introduce a model of computation, called G-Kells, which meets these requirements. We develop our model at a more concrete  ...  Ackowledgements Damien Pous suggested the move to an early style semantics. The paper was much improved thanks to comments by Ivan Lanese on earlier versions.  ... 
doi:10.1007/978-3-319-15317-9_1 fatcat:t724yiw3qrhx5kqnlsy2f3q3nu

A calculus of Kells

Jean-Bernard Stefani
2003 Electronical Notes in Theoretical Computer Science  
This paper introduces the Kell calculus, a new process calculus that retains the original insights of the M-calculus (local actions, higher-order processes and programmable membranes) in a much simpler  ...  Interestingly, the PAN abstract machine is further simplified by adopting an unconventional interpretation: ambients are considered to represent only logical loci of computation, and not physical locations  ...  P , where is a message pattern (analogous to the join patterns in the Join calculus) and P is an arbitrary kell calculus process.  ... 
doi:10.1016/s1571-0661(05)80087-8 fatcat:x4m6bpvxkfbdxnzrphh53rgesm

The Kell Calculus: Operational Semantics and Type System [chapter]

Philippe Bidinger, Jean-Bernard Stefani
2003 Lecture Notes in Computer Science  
The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus.  ...  This paper 1 presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higher-order  ...  The second one, reported in [13] , describes a Safe Ambients abstract machine, called PAN, that alleviates some of the difficulty inherent in Mobile Ambients implementation by implementing a variant of  ... 
doi:10.1007/978-3-540-39958-2_8 fatcat:odgtnlldj5glbhix45gshwsjoq

Abstract Machines for Safe Ambients in Wide-Area and Mobile Networks [chapter]

Seiji Umatani, Masahiro Yasugi, Taiichi Yuasa
2011 Lecture Notes in Computer Science  
Among these, Pan and GcPan are distributed abstract machines for executing Safe Ambients, a variant of the Ambient calculus.  ...  Finally, we prove the correctness of the proposed machines by using weak barbed bisimulation. these, Pan [12, 7] and GcPan [8, 9] are abstract machines for implementing the Safe Ambients (SA), a variant  ...  This work was partly supported by MEXT Grant-in-Aid for Young Scientists (B) (21700029).  ... 
doi:10.1007/978-3-642-21464-6_12 fatcat:s3iffp4vxbeexfm5hzffd4bscy

Encapsulation and Dynamic Modularity in the π-calculus

Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous
2009 Electronical Notes in Theoretical Computer Science  
We propose an extension of the higher-order pi-calculus intended to capture several important mechanisms related to component-based programming, such as dynamic update, reconfiguration and code migration  ...  We describe a process calculus featuring high level constructs for component-oriented programming in a distributed setting.  ...  We have already mentioned [1] , which introduces an abstract machine for the Kell calculus.  ... 
doi:10.1016/j.entcs.2009.06.005 fatcat:7fc4bss3vvdltb7n2nkjmfbg2q

Oz/K

Michael Lienhardt, Alan Schmitt, Jean-Bernard Stefani
2007 Proceedings of the 6th international conference on Generative programming and component engineering - GPCE '07  
Specifically, we introduce in this paper OZ/K, a kernel programming language, that adds to the OZ computation model a notion of locality borrowed from the Kell calculus.  ...  We present an operational semantics for the language and several examples to illustrate how OZ/K supports open distributed programming.  ...  Acknowledgments This research has been partially funded by the European Commission FP6 IST Project Selfman, and FP6 NoE CoreGrid.  ... 
doi:10.1145/1289971.1289980 dblp:conf/gpce/LienhardtSS07 fatcat:4d3z5yq6gjdctgorwxofix5664

Pict Correctness Revisited [chapter]

Philippe Bidinger, Adriana Compagnoni
2007 Lecture Notes in Computer Science  
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine.  ...  After defining fairness for the π-calculus, we show that the Pict abstract machine executions implement fair π-calculus executions.  ...  Acknowledgments We are grateful to Healfdene Goguen, Benjamin Pierce, Alan Schmitt and Jean-Bernard Stefani, as well as the anonymous reviewers, for their comments on earlier drafts.  ... 
doi:10.1007/978-3-540-72952-5_13 fatcat:aslci3catzfidbmqljs7yckgyy

Pict correctness revisited

Philippe Bidinger, Adriana Compagnoni
2009 Theoretical Computer Science  
machine Fairness Pict a b s t r a c t The Pict programming language is an implementation of the π -calculus in which executions of π-calculus terms are specified via an abstract machine.  ...  After defining fairness for the π-calculus, we show that Pict abstract machine executions implement fair π-calculus executions.  ...  for the Kell calculus [1] .  ... 
doi:10.1016/j.tcs.2008.09.014 fatcat:6tudre6zwffbzabyz62wpxnd4a

Page 276 of The American Mathematical Monthly Vol. 61, Issue 4 [page]

1954 The American Mathematical Monthly  
The Mathematics Division of the American Society for Engineering Educa- tion has planned an instructive program for the A.S.E.E. meetings to be held at the University of Illinois, Urbana, Illinois, June  ...  First Course in Abstract Algebra. By R. E. Johnson. New York, Prentice-Hall, Inc., 1953. 8+257 pages. $5.50. Calculus. By G. B. Thomas.  ... 

A Correct Abstract Machine for Safe Ambients [chapter]

Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
2005 Lecture Notes in Computer Science  
We describe an abstract machine, called GcPan, for the distributed execution of Safe Ambients (SA), a variant of the Ambient Calculus (AC).  ...  In this paper, we introduce GcPan, an abstract machine for SA that is more efficient than Pan.  ...  An original aspect of our analysis w.r.t. the proof in [11] is that we compare two abstract machines, rather than an abstract machine and a calculus.  ... 
doi:10.1007/11417019_2 fatcat:6ilb3wncwfenfc6iwzpphctf5q

Structuring Operational Semantics: Simplification and Computation

Eugenio Moggi
2007 Electronical Notes in Theoretical Computer Science  
Computation is induced by chemical reactions, like those in the Join-calculus. The language can serve as metalanguage for defining the operational semantics of other languages.  ...  The paper describes a language consisting of two layers, terms and computation rules, whose operational semantics is given in terms of two relations: simplification and computation.  ...  , which relates T S c to the reflexive chemical abstract machine for the Join-calculus.  ... 
doi:10.1016/j.entcs.2007.02.016 fatcat:zqyvmtj73vharljqao5fyqmaia

Recent Publications

Nelson Dunford, R. P. Boas, W. R. Hutcherson, K. J. Arnold
1948 The American mathematical monthly  
To the reviewer, who is accustomed to teaching “theory” to freshmen, it appears that there is no place in the text where the student gets an overdose of the abstract and more difficult parts of the calculus  ...  Kells. New York, McGraw-Hill Book Co., 1947. 14+311 pages. $3.00. An Introduction to Analytical Geometry. Vol. I1. By A. Robson.  ... 
doi:10.1080/00029890.1948.11991917 fatcat:uc2dmiysbbgkfaivmravbrrl7a
« Previous Showing results 1 — 15 out of 147 results