article

Free access

Communication as fair distribution of knowledge

Authors:

Jean-Marc Andreoli,

Remo PareschiAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 11

Pages 212 - 229

https://doi.org/10.1145/118014.117971

Published: 01 November 1991 Publication History

PDF eReader

References

[1]

S. Abramsky. Computational interpretations of linear logic. Technical report, DOC, Imperial College, London, U.K., 1990.

Google Scholar

[2]

G. Agha and C. Hewitt. Actors: a conceptual foundation for concurrent object-oriented programming. In B. Shriver and P. Wegner, editors, Research Directions in Object-Oriented Programming. MIT Press, 1987.

Digital Library

Google Scholar

[3]

J.M. Andreoli. Proposition pour une synth~se des paradigmes de la programmation logique et de la programmation par objets, 1990. Th~se d'Informatique de l'Universit~ de Paris VI (Paris, France).

Google Scholar

[4]

J.M. Andreoli and R. Pareschi. LO and behold! concurrent structured processes. In Proc. of OOPSLA/ECOOP'90, Ottawa, Canada, 1990.

Digital Library

Google Scholar

[5]

J.M. Andreoli and R. Pareschi. Dynamic programming as multi-agent programming, 1991. ECOOP'91 workshop on Object-based concurrent computing.

Digital Library

Google Scholar

[6]

J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, To appear, 1991. (Special issue, Selected papers from ICLP'90).

Google Scholar

[7]

A. Brogi and P. Ciancarini. The concurrent language shared prolog. A CM Transactions on Programming Languages and Systems, To appear, 1991.

Digital Library

Google Scholar

[8]

M. Clemente. Forthcoming Ms Thesis, TU Miinchen.

Google Scholar

[9]

J. Earley. An efficient context-free parsing algorithm. Communications of the A CM, 13(2), 1970.

Digital Library

Google Scholar

[10]

D. Gelernter. Generative communication in linda. A CM Transactions on Programming Languages and Systems, 7, 1985.

Digital Library

Google Scholar

[11]

J.Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.

Digital Library

Google Scholar

[12]

S. Gregory. Parallel Logic Programming in Parlog. Addison-Wesley, 1987.

Digital Library

Google Scholar

[13]

D. Harel and A. Pnueli. On the development of reactive systems. In K.R. Apt, editor, Logic and Models of Concurrent Systems. Springer Verlag, 1985.

Digital Library

Google Scholar

[14]

J.S Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. In Proc. of LICS'91, 1991. To appear.

Digital Library

Google Scholar

[15]

K. Kahn and V.A. Saraswat. Actors as a special case of concurrent constraint logic programming. In Proc. of OOPSLA/ECOOP'90, Ottawa, Canada, 1990.

Digital Library

Google Scholar

[16]

M. Kay. Algorithm schemata and data structure in syntactic processing. Technical report, Xerox Pare, Palo Alto, U.S.A., 1980.

Google Scholar

[17]

Y. Lafont. Interaction nets. In Proc. of 17th A CM Symposium on Principles of Programruing Languages, San Francisco, U.S.A., 1990.

Digital Library

Google Scholar

[18]

H. Lieberman. Concurrent object oriented programming in ACT1. In A. Yonezawa and M. Tokoro, editors, Object Oriented Concurrent Programming. MIT Press, 1987.

Digital Library

Google Scholar

[19]

A. Matsuoka and S. Kawai. Using tuple space communication in distributed object oriented languages. In Proc. of OOPSLA '88, San Diego, U.S.A., 1988.

Digital Library

Google Scholar

[20]

J. Meseguer. A logical theory of concurrent objects. In Proc. of OOPSLA/ECOOP'90, 1990.

Digital Library

Google Scholar

[21]

D. Miller. Lexical scoping as universal quantification. In Proc. of the 6th International Conference on Logic Programming, Lisboa, Portugal, 1989.

Google Scholar

[22]

L. Monteiro and F.C.N. Pereira. A sheaftheoretic model of concurrency. Technical report, CSLI, Menlo Park, U.S.A., 1986.

Google Scholar

[23]

C. Numaoka and M. Tokoro. A decentralized parsing method using communicating multiple concurrent objects. In Proc. of 2nd International Conference of Technology of Object Oriented Languages and Systems, Paris, France, 1990.

Google Scholar

[24]

V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie- Mellon University, Pittsburg, U.S.A., 1989.

Digital Library

Google Scholar

[25]

V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. Technical report, Xerox Pare, Palo Alto, U.S.A., 1990.

Google Scholar

[26]

E. Shapiro. A subset of concurrent prolog and its interpreter. Technical report, Institute for New Generation Computer Technology, Tokyo, Japan, 1983.

Google Scholar

[27]

E. Shapiro. The family of concurrent logic programming languages. Technical report, The Weizmann Institute of Science, Rehovot, Israel, 1989.

Google Scholar

[28]

R. Trehan and P.F. Wilk. A parallel chartparser for the commited choice logic languages. In Proc. of the 5th International Conference on Logic Programming, Seattle, U.S.A., 1988.

Google Scholar

[29]

K. Ueda. Guarded IIorn Clauses. PhD thesis, Dept of Information Engineering, University of Tokyo, japan, 1986.

Google Scholar

[30]

A. Yonezawa and I. Ohsawa. Object-oriented parallel parsing for context-free gramars. In Proc. of COLING'88, Budapest, Hungary, 1988.

Digital Library

Google Scholar

Cited By

View all

Rossi D(2012)A social software-based coordination platformProceedings of the 14th international conference on Coordination Models and Languages10.1007/978-3-642-30829-1_2(17-28)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30829-1_2
Fournet CGonthier GBoehm HSteele G(1996)The reflexive CHAM and the join-calculusProceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/237721.237805(372-385)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237721.237805
Kobayashi NYonezawa A(1995)Toward Foundations of Concurrent Object‐Oriented Programming‐Types and Language DesignTheory and Practice of Object Systems10.1002/j.1096-9942.1995.tb00020.x1:4(243-268)Online publication date: Jan-1995
https://doi.org/10.1002/j.1096-9942.1995.tb00020.x
Show More Cited By

Index Terms

Communication as fair distribution of knowledge

Recommendations

Guiding knowledge communication in CSCL via group knowledge awareness

Computer-mediated collaboration is not in and of itself a beneficial setting for learning. Environments for computer-mediated collaboration need to trigger learning-productive interactions. In this paper, we propose to implement tools providing group ...
Heterogeneous knowledge distribution in MMO player behavior

Current examinations of expertise in the Massively Multiplayer Online (MMO) domain focus primarily on player performance; explorations of player knowledge, however, have the opportunity to meaningfully supplement these studies. Including player ...
Fair $ω$ -Regular Games
Foundations of Software Science and Computation Structures
Abstract
We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph $G = (V, E)$ and a set of fair moves $E_{f} \subseteq E$ a player is said to play fair in G if they choose an ... $_{}$

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 11

Nov. 1991

362 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/118014

Editor:
Andreas Paepcke

Issue’s Table of Contents

OOPSLA '91: Conference proceedings on Object-oriented programming systems, languages, and applications
November 1991
384 pages
ISBN:0201554178
DOI:10.1145/117954
Editor:
Andreas Paepcke

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1991

Published in SIGPLAN Volume 26, Issue 11

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
447
Total Downloads

Downloads (Last 12 months)99
Downloads (Last 6 weeks)16

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rossi D(2012)A social software-based coordination platformProceedings of the 14th international conference on Coordination Models and Languages10.1007/978-3-642-30829-1_2(17-28)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30829-1_2
Fournet CGonthier GBoehm HSteele G(1996)The reflexive CHAM and the join-calculusProceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/237721.237805(372-385)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237721.237805
Kobayashi NYonezawa A(1995)Toward Foundations of Concurrent Object‐Oriented Programming‐Types and Language DesignTheory and Practice of Object Systems10.1002/j.1096-9942.1995.tb00020.x1:4(243-268)Online publication date: Jan-1995
https://doi.org/10.1002/j.1096-9942.1995.tb00020.x
Kobayashi NYonezawa A(2019)Type-theoretic foundations for concurrent object-oriented programingACM SIGPLAN Notices10.1145/191081.19108829:10(31-45)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/191081.191088
Kobayashi NYonezawa A(2015)Asynchronous communication model based on linear logicFormal Aspects of Computing10.1007/BF012116027:2(113-149)Online publication date: 21-Apr-2015
https://doi.org/10.1007/BF01211602
Rossi D(2012)A social software-based coordination platformProceedings of the 14th international conference on Coordination Models and Languages10.1007/978-3-642-30829-1_2(17-28)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30829-1_2
Kobayashi NYonezawa A(2005)Higher-order concurrent linear logic programmingTheory and Practice of Parallel Programming10.1007/BFb0026568(137-166)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0026568
Andreoli JGallaire HPareschi R(2005)Rule-based object coordinationObject-Based Models and Languages for Concurrent Systems10.1007/3-540-59450-7_1(1-13)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59450-7_1
Volpe P(2005)Concurrent logic programming as uniform linear proofsAlgebraic and Logic Programming10.1007/3-540-58431-5_11(133-149)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-58431-5_11
Andreoli JLeth LPareschi RThomsen B(2005)True concurrency semantics for a linear logic programming language with broadcast communicationTAPSOFT'93: Theory and Practice of Software Development10.1007/3-540-56610-4_64(182-198)Online publication date: 28-May-2005
https://doi.org/10.1007/3-540-56610-4_64
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Guiding knowledge communication in CSCL via group knowledge awareness

Heterogeneous knowledge distribution in MMO player behavior

Fair ω-Regular Games

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations

Fair $ω$ -Regular Games