Interaction Combinators

It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work oninteraction nets, inspired by Girard's proof...

Full description

Saved in:
Bibliographic Details
Published inInformation and computation Vol. 137; no. 1; pp. 69 - 101
Main Author Lafont, Yves
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 25.08.1997
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Theoretical computing
Combinatorial problem
Distributed computing
Distributed computer systems
Online AccessGet full text

Cover

Abstract It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work oninteraction nets, inspired by Girard's proof nets forlinear logic, but no preliminary knowledge of these topics is required for its reading.
AbstractList It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work oninteraction nets, inspired by Girard's proof nets forlinear logic, but no preliminary knowledge of these topics is required for its reading.
Author Lafont, Yves
Author_xml – sequence: 1
  givenname: Yves
  surname: Lafont
  fullname: Lafont, Yves
  organization: Institut de Mathématiques de Luminy, UPR 9016 du CNRS, 163 avenue de Luminy, case 930, 13288, Marseille Cedex 9, Francef1E-mail: lafont@iml.univ-mrs.frf1
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2803362$$DView record in Pascal Francis
BookMark eNp1jz1PwzAQhi1UJNrCCisDa8LZjh1nRBEflSqxwGxd3LNk1NqVHSHx70koYmO6G-55731WbBFTJMauOdQcQN-H6FLNu66thW7kGVty6KASWvEFW4KZdtUAv2CrUj4AOFeNXrKbTRwpoxtDird9Ogwh4phyuWTnHveFrn7nmr0_Pb71L9X29XnTP2wrJ5UaK-Wp42YgYyQqP9VwZAaNSuBgdk40HjkOxJXwqBWojret8IAEzkjltJBrVp9yXU6lZPL2mMMB85flYGctO2vZWcvOWhNwdwKOWBzufcboQvmjhAEpf3LN6Yym8p-Bsi0uUHS0C5ncaHcp_PfhGxVbYWA
CODEN INFCEC
CitedBy_id crossref_primary_10_1162_artl_a_00355
crossref_primary_10_1006_inco_2002_3163
crossref_primary_10_1016_S0304_3975_00_00310_8
crossref_primary_10_2168_LMCS_5_4_6_2009
crossref_primary_10_1016_j_tcs_2004_03_065
crossref_primary_10_2168_LMCS_6_4_6_2010
crossref_primary_10_1007_BF02946493
crossref_primary_10_4204_EPTCS_101_2
crossref_primary_10_1016_S0304_3975_99_00037_7
crossref_primary_10_1016_j_entcs_2006_10_030
crossref_primary_10_1145_291251_289434
crossref_primary_10_1017_S0960129511000661
crossref_primary_10_1145_2914770_2837646
crossref_primary_10_1007_s10990_007_9011_3
crossref_primary_10_1016_S0304_3975_00_00198_5
crossref_primary_10_1016_j_tcs_2006_07_005
crossref_primary_10_1017_S0960129507006135
crossref_primary_10_1016_j_entcs_2008_03_032
crossref_primary_10_1016_j_entcs_2008_03_031
crossref_primary_10_1016_S0304_3975_02_00637_0
crossref_primary_10_1017_S0960129516000402
crossref_primary_10_1016_j_ic_2015_12_013
crossref_primary_10_1016_j_ic_2010_10_002
crossref_primary_10_1016_S0304_3975_02_00011_7
crossref_primary_10_1016_j_entcs_2002_09_006
crossref_primary_10_1016_j_tcs_2003_10_018
crossref_primary_10_1016_S1571_0661_05_82614_3
crossref_primary_10_1016_j_entcs_2002_09_005
crossref_primary_10_1016_j_entcs_2008_03_038
Cites_doi 10.1145/96709.96718
10.1145/143165.143172
10.1145/319838.319868
10.1016/S0049-237X(08)70271-4
10.1145/96709.96711
10.1109/LICS.1992.185535
ContentType Journal Article
Copyright 1997 Academic Press
1997 INIST-CNRS
Copyright_xml – notice: 1997 Academic Press
– notice: 1997 INIST-CNRS
DBID 6I.
AAFTH
IQODW
AAYXX
CITATION
DOI 10.1006/inco.1997.2643
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
Pascal-Francis
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Applied Sciences
EISSN 1090-2651
EndPage 101
ExternalDocumentID 10_1006_inco_1997_2643
2803362
S0890540197926432
GroupedDBID --K
--M
--Z
-~X
.~1
1B1
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
6I.
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABTAH
ABVKL
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADMUD
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
E3Z
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG5
LX9
M41
MHUIS
MO0
N9A
NCXOZ
O-L
OAUVE
OK1
OZT
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDP
SES
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
WH7
XPP
ZMT
ZU3
ZY4
~G-
08R
0R~
ABFNM
ABPIF
ABXDB
AEBSH
G8K
GBLVA
HZ~
H~9
IQODW
MVM
O9-
P-8
RNS
SEW
WUQ
XJT
0SF
AAXKI
AAYXX
ADVLN
AFJKZ
AKRWK
CITATION
ID FETCH-LOGICAL-c355t-5fe918be883a5f100ce8b6a52ab8dc24fa1abe152fa650591772f0ae0c835c623
IEDL.DBID AIKHN
ISSN 0890-5401
IngestDate Wed Sep 25 08:54:51 EDT 2024
Sun Oct 29 17:07:58 EDT 2023
Fri Feb 23 02:30:04 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Combinatorial problem
Distributed computing
Distributed computer systems
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c355t-5fe918be883a5f100ce8b6a52ab8dc24fa1abe152fa650591772f0ae0c835c623
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0890540197926432
PageCount 33
ParticipantIDs crossref_primary_10_1006_inco_1997_2643
pascalfrancis_primary_2803362
elsevier_sciencedirect_doi_10_1006_inco_1997_2643
PublicationCentury 1900
PublicationDate 1997-08-25
PublicationDateYYYYMMDD 1997-08-25
PublicationDate_xml – month: 08
  year: 1997
  text: 1997-08-25
  day: 25
PublicationDecade 1990
PublicationPlace San Diego, CA
PublicationPlace_xml – name: San Diego, CA
PublicationTitle Information and computation
PublicationYear 1997
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Girard (IC972643RF5) 1995; 222
Y. Lafont, 1990, Interaction nets, Proceedings of 17th ACM Symposium on Principles of Programming Languages (POPL '90), 95, 108, Assoc. Comput. Mach. New York
I. Mackie, 1994, The Geometry of Implementation (An Investigation into Using the Geometry of Interaction for Language Implementation), Imperial College of Science, Technology, and Medicine, London.
Danos, Regnier (IC972643RF2) 1995; 222
Lafont (IC972643RF9) 1995; 222
J.-Y. Girard, 1989, Geometry of interaction I: Interpretation of system F, Proceedings, Logic Colloquium '88, Ferroet al. 221, 260, North-Holland, Amsterdam
S. J. Gay, 1995, Combinators for interaction nets, Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, C. L. HankinI. C. MackieR. Nagarajan, Imperial College Press
G. Gonthier, M. Abadi, J.-J. Levy, 1992, Linear logic without boxes, Proceedings of 7th Annual Symposium on Logic in Computer Science (LICS '92), IEEE Press, New York
G. Gonthier, M. Abadi, J.-J. Levy, 1992, The geometry of optimal lambda reduction, Proceedings of 19th ACM Symposium on Principles of Programming Languages (POPL '92), Assoc. Comput. Mach. New York
A. Bawden, 1986, Connection graphs, Proceedings of ACM Conference on Lisp and Functional Programming, 258, 265
J. Lamping, 1990, An algorithm for optimal lambda calculus reduction, Proceedings of 17th ACM Symposium on Principles of Programming Languages (POPL '90), 16, 46, Assoc. Comput. Mach. New York
10.1006/inco.1997.2643_IC972643RF8
Danos (10.1006/inco.1997.2643_IC972643RF2) 1995; 222
10.1006/inco.1997.2643_IC972643RF7
10.1006/inco.1997.2643_IC972643RF6
Girard (10.1006/inco.1997.2643_IC972643RF5) 1995; 222
10.1006/inco.1997.2643_IC972643RF4
10.1006/inco.1997.2643_IC972643RF10
10.1006/inco.1997.2643_IC972643RF3
10.1006/inco.1997.2643_IC972643RF11
10.1006/inco.1997.2643_IC972643RF1
Lafont (10.1006/inco.1997.2643_IC972643RF9) 1995; 222
References_xml – volume: 222
  start-page: 225
  year: 1995
  end-page: 247
  ident: IC972643RF9
  article-title: From proof-nets to interaction nets
  publication-title: Advances in Linear Logic
  contributor:
    fullname: Lafont
– volume: 222
  year: 1995
  ident: IC972643RF2
  article-title: Proof-nets and the Hilbert space
  publication-title: Advances in Linear Logic
  contributor:
    fullname: Regnier
– volume: 222
  start-page: 1
  year: 1995
  end-page: 42
  ident: IC972643RF5
  article-title: Linear logic: Its syntax and semantics
  publication-title: Advances in Linear Logic
  contributor:
    fullname: Girard
– ident: 10.1006/inco.1997.2643_IC972643RF8
  doi: 10.1145/96709.96718
– volume: 222
  start-page: 225
  year: 1995
  ident: 10.1006/inco.1997.2643_IC972643RF9
  article-title: From proof-nets to interaction nets
  contributor:
    fullname: Lafont
– volume: 222
  year: 1995
  ident: 10.1006/inco.1997.2643_IC972643RF2
  article-title: Proof-nets and the Hilbert space
  contributor:
    fullname: Danos
– ident: 10.1006/inco.1997.2643_IC972643RF11
– ident: 10.1006/inco.1997.2643_IC972643RF3
– ident: 10.1006/inco.1997.2643_IC972643RF6
  doi: 10.1145/143165.143172
– ident: 10.1006/inco.1997.2643_IC972643RF1
  doi: 10.1145/319838.319868
– ident: 10.1006/inco.1997.2643_IC972643RF4
  doi: 10.1016/S0049-237X(08)70271-4
– ident: 10.1006/inco.1997.2643_IC972643RF10
  doi: 10.1145/96709.96711
– ident: 10.1006/inco.1997.2643_IC972643RF7
  doi: 10.1109/LICS.1992.185535
– volume: 222
  start-page: 1
  year: 1995
  ident: 10.1006/inco.1997.2643_IC972643RF5
  article-title: Linear logic: Its syntax and semantics
  contributor:
    fullname: Girard
SSID ssj0011546
Score 1.7398912
Snippet It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a...
SourceID crossref
pascalfrancis
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 69
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Theoretical computing
Title Interaction Combinators
URI https://dx.doi.org/10.1006/inco.1997.2643
Volume 137
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT8IwGH6DcNEYP_ALFbKDiaextbTbegQiATFcFMNtabc24YJE8Opv9y3rCBy4eF3arnnavs_T7f0AeNIoAWROOz4XVPpMCeYn2hhfhTbVickJVRsH2Uk0nLLXGZ9VoF_Gwli3Smf7C5u-sdbuSeDQDJbzefAeJsLqDSJigazeQTtcQzpirAq17mg8nGx_JhAXr4PtrR8AKXM3hlFgMyDYgL24bYc4xE2nS7lCxExR6mKHfwYXcOaEo9ct5nYJFb2ow3lZlMFzZ7QOJzsZBq_gdvPFrwhe8LAx3oPtLXt1DdPBy0d_6LtaCH6GimDtW58wkiidJB3JDc4904mKJKdSJXlGmZFEKo1kbCRqLo6XsJiaUOowQ4mVoca5geria6HvwGMKFyITSmgRMh1LhX0jmRtkMy2o4Q14LlFIl0XKi7RIbhylFq_U4pVavBpASpDSvUVL0R4f7NPcQ3P7ClsmC9n0_h9jPsBxkVUWDz1_hOr6-0c3USusVQuO2r-khTui9zl-a7mdgU9Hs94f4zXAKA
link.rule.ids 315,786,790,3525,4521,24144,27600,27955,27956,45618,45696,45712,45907
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5VMABCPMqrQCEDEpNJ4sZJPEJFVaB0oZW6WXZiS11KRcv_5y6Pqh26sEaOY32O775L7r4DeLBIAXTOO0xIrllkZMRS6xwzAUmduDzkpkiQHcb9cfQ-EZMGdOtaGEqrrGx_adMLa11d8Ss0_fl06n8FqSS-EcpEolfvoB3ejQTGelTFN3lZ_UoIq2odHE1ZAGGt3BjEPukfULle8kQTbPNMh3O9QLxc2ehizfv0TuCooo3ec7myU2jYWROO65YMXnVCm3Cwpi94BpfF976ydMHDwRgFU4y9OIdx73XU7bOqEwLLkA8sGWWEhamxadrRwuHaM5uaWAuuTZpnPHI61MaiK3YaGZfAECzhLtA2yJBgZchwLmBn9j2zV-BFBrchk0ZaGUQ20QbvjXXu0JdZyZ1owWONgpqXgheqlDaOFeGlCC9FeLUgrEFSG1um0Bpvvae9gebqEdQkC33p9T_mvIe9_uhzoAZvw48b2C_1ZfH4i1vYWf782jayhqW5K96KPyhHvnM
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Interaction+Combinators&rft.jtitle=Information+and+computation&rft.au=Lafont%2C+Yves&rft.date=1997-08-25&rft.issn=0890-5401&rft.volume=137&rft.issue=1&rft.spage=69&rft.epage=101&rft_id=info:doi/10.1006%2Finco.1997.2643&rft.externalDBID=n%2Fa&rft.externalDocID=10_1006_inco_1997_2643
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon