A Linear Logic Programming Language for Concurrent Programming over Graph Structures

We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, L...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 14; no. 4-5; pp. 493 - 507
Main Authors: CRUZ, FLAVIO, ROCHA, RICARDO, GOLDSTEIN, SETH COPEN, PFENNING, FRANK
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2014
Subjects:
Algorithms
Consumption
Graphs
Logic
Logic programming
Programming
Regular Papers
Semantics
Syntax
Concurrent Programming
Graphs
Language Design
Linear Logic
Semantics
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples.
AbstractList We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples.
Abstract We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples. [PUBLICATION ABSTRACT]
Author PFENNING, FRANK
CRUZ, FLAVIO
GOLDSTEIN, SETH COPEN
ROCHA, RICARDO
Author_xml – sequence: 1
  givenname: FLAVIO
  surname: CRUZ
  fullname: CRUZ, FLAVIO
  email: fmfernan@cs.cmu.edu
  organization: † Carnegie Mellon University, Pittsburgh, PA 15213 (e-mail: fmfernan@cs.cmu.edu, seth@cs.cmu.edu, fp@cs.cmu.edu)
– sequence: 2
  givenname: RICARDO
  surname: ROCHA
  fullname: ROCHA, RICARDO
  email: ricroc@dcc.fc.up.pt
  organization: ‡ CRACS & INESC TEC, Faculty of Sciences, University Of Porto, Rua do Campo Alegre, 1021/1055, 4169-007 Porto, Portugal (e-mail: ricroc@dcc.fc.up.pt)
– sequence: 3
  givenname: SETH COPEN
  surname: GOLDSTEIN
  fullname: GOLDSTEIN, SETH COPEN
  email: fmfernan@cs.cmu.edu
  organization: † Carnegie Mellon University, Pittsburgh, PA 15213 (e-mail: fmfernan@cs.cmu.edu, seth@cs.cmu.edu, fp@cs.cmu.edu)
– sequence: 4
  givenname: FRANK
  surname: PFENNING
  fullname: PFENNING, FRANK
  email: fmfernan@cs.cmu.edu
  organization: † Carnegie Mellon University, Pittsburgh, PA 15213 (e-mail: fmfernan@cs.cmu.edu, seth@cs.cmu.edu, fp@cs.cmu.edu)
BookMark eNp9kM9LwzAUgINMcJv-Ad4KXrxUk6Vt2uMYOoWCwua5pOlLzViT-dIK_ve2bged6CmPvO97vyZkZJ0FQi4ZvWGUidsViwSjSRqxiFLKEnFCxv1XHHKastFXzMIhf0Ym3m8GhM-iMVnPg9xYkBjkrjYqeEZXo2waY-sgl7buZA2BdhgsnFUdItj2B-PeAYMlyt1rsGqxU22H4M_JqZZbDxeHd0pe7u_Wi4cwf1o-LuZ5qHjG2xCAVTqtMqCJzNKExRGtIg06nZWZFkqLFKjkcSarTEeV0lyUIlZSllVSRpyVfEqu93V36N468G3RGK9gu5UWXOcLlsxov_MsET16dYRuXIe2n67o-woaZ0k8UGJPKXTeI-hCmVa2xtkWpdkWjBbDtYtf1-5NdmTu0DQSP_51-MGRTYmmquHbUH9an6emkno
CitedBy_id crossref_primary_10_1145_3473588
crossref_primary_10_1145_2994595
Cites_doi 10.1093/logcom/2.3.297
10.21236/ADA538767
10.1145/1807167.1807184
10.1145/2071368.2071370
10.1016/0304-3975(87)90045-4
10.21236/ADA418538
10.1006/inco.1994.1036
10.1145/2422085.2422086
10.1007/978-3-540-27755-2_14
10.1007/BF01386390
10.1007/978-3-642-02846-5_24
10.1145/1273920.1273924
10.21236/ADA418517
10.1017/S1471068410000438
10.1145/1142473.1142485
10.1145/1069774.1069778
10.1145/1272996.1273005
10.2307/2689192
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2014
Copyright_xml – notice: Copyright © Cambridge University Press 2014
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068414000167
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Computer Science Database

Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate A Linear Logic Programming Language
F. Cruz et al.
EISSN 1475-3081
EndPage 507
ExternalDocumentID 3379190601
10_1017_S1471068414000167
Genre Feature
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
IPYYG
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
PUEGO
ID FETCH-LOGICAL-c393t-ee1df8d9e06a9861540d4fef82b9f7cf78e0a359ad9f4dcf37b75caabd6b431b3
IEDL.DBID K7-
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000343203200007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Fri Sep 05 10:55:08 EDT 2025
Fri Jul 25 03:20:51 EDT 2025
Sat Nov 29 04:58:35 EST 2025
Tue Nov 18 21:04:19 EST 2025
Tue Jan 21 06:20:16 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4-5
Keywords Concurrent Programming
Graphs
Language Design
Linear Logic
Semantics
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c393t-ee1df8d9e06a9861540d4fef82b9f7cf78e0a359ad9f4dcf37b75caabd6b431b3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
OpenAccessLink http://repositorio.inesctec.pt/handle/123456789/3633
PQID 1547059657
PQPubID 43613
PageCount 15
ParticipantIDs proquest_miscellaneous_1620068267
proquest_journals_1547059657
crossref_citationtrail_10_1017_S1471068414000167
crossref_primary_10_1017_S1471068414000167
cambridge_journals_10_1017_S1471068414000167
PublicationCentury 2000
PublicationDate 2014-07-01
PublicationDateYYYYMMDD 2014-07-01
PublicationDate_xml – month: 07
  year: 2014
  text: 2014-07-01
  day: 01
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2014
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S1471068414000167_ref18
S1471068414000167_ref9
S1471068414000167_ref7
S1471068414000167_ref16
S1471068414000167_ref17
S1471068414000167_ref8
S1471068414000167_ref5
S1471068414000167_ref6
S1471068414000167_ref3
S1471068414000167_ref4
S1471068414000167_ref1
S1471068414000167_ref2
S1471068414000167_ref11
López (S1471068414000167_ref19) 2005
S1471068414000167_ref14
S1471068414000167_ref15
S1471068414000167_ref12
S1471068414000167_ref13
S1471068414000167_ref27
De Koninck (S1471068414000167_ref10) 2007
S1471068414000167_ref28
S1471068414000167_ref21
S1471068414000167_ref22
S1471068414000167_ref20
S1471068414000167_ref25
S1471068414000167_ref26
S1471068414000167_ref23
S1471068414000167_ref24
References_xml – ident: S1471068414000167_ref4
– ident: S1471068414000167_ref22
  doi: 10.1093/logcom/2.3.297
– ident: S1471068414000167_ref23
– ident: S1471068414000167_ref8
– ident: S1471068414000167_ref6
– ident: S1471068414000167_ref1
  doi: 10.21236/ADA538767
– ident: S1471068414000167_ref21
  doi: 10.1145/1807167.1807184
– ident: S1471068414000167_ref14
– ident: S1471068414000167_ref5
  doi: 10.1145/2071368.2071370
– ident: S1471068414000167_ref13
  doi: 10.1016/0304-3975(87)90045-4
– ident: S1471068414000167_ref9
  doi: 10.21236/ADA418538
– ident: S1471068414000167_ref15
  doi: 10.1006/inco.1994.1036
– ident: S1471068414000167_ref7
  doi: 10.1145/2422085.2422086
– ident: S1471068414000167_ref12
  doi: 10.1007/978-3-540-27755-2_14
– ident: S1471068414000167_ref24
– ident: S1471068414000167_ref3
– ident: S1471068414000167_ref11
  doi: 10.1007/BF01386390
– ident: S1471068414000167_ref20
– ident: S1471068414000167_ref28
– ident: S1471068414000167_ref26
– ident: S1471068414000167_ref2
  doi: 10.1007/978-3-642-02846-5_24
– start-page: 25
  volume-title: Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
  year: 2007
  ident: S1471068414000167_ref10
  doi: 10.1145/1273920.1273924
– ident: S1471068414000167_ref27
  doi: 10.21236/ADA418517
– ident: S1471068414000167_ref25
  doi: 10.1017/S1471068410000438
– ident: S1471068414000167_ref18
  doi: 10.1145/1142473.1142485
– start-page: 35
  volume-title: Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
  year: 2005
  ident: S1471068414000167_ref19
  doi: 10.1145/1069774.1069778
– ident: S1471068414000167_ref17
  doi: 10.1145/1272996.1273005
– ident: S1471068414000167_ref16
  doi: 10.2307/2689192
SSID ssj0016324
Score 2.0089896
Snippet We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is...
Abstract We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 493
SubjectTerms Algorithms
Consumption
Graphs
Logic
Logic programming
Programming
Regular Papers
Semantics
Syntax
Title A Linear Logic Programming Language for Concurrent Programming over Graph Structures
URI https://www.cambridge.org/core/product/identifier/S1471068414000167/type/journal_article
https://www.proquest.com/docview/1547059657
https://www.proquest.com/docview/1620068267
Volume 14
WOSCitedRecordID wos000343203200007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JS8QwFH64Hby4i-NGBE9iMN0m7UlUXEAZBhcQL0NWELSjjvr7fa9Ni4MwFy89pEkpfS95a78PYD82mdYuTrmRkeapEo6rXCTcR10pdOyFVTXZhOz18sfHoh8SbqPQVtmcidVBbYeGcuRHaOolUcVk8vjtnRNrFFVXA4XGNMxGcRyRnl9L3lYRCIq8-rtIUndPnjZVTYKMpkEawwCjasX_ja0wbqPGj-jK7lws_veNl2AheJzspFaRZZhy5QosNmwOLGzuVbg_YRiYouIz4l82rF93br2ibWM3IavJ0MVlZ8PS1KhOY3OoF5RdEv41u6tAab8wkl-Dh4vz-7MrHjgXuEmK5JM7F1mf28KJripydHdSYVPvfB7rwhOEUe6ESrJC2cKn1vhEapkZpbTtavRFdLIOM-WwdBvAcoehnlMVcWEqTFx4i86Wc4mXzgtjO3DYfvFB2DmjQd11Jgd_BNQB0QhlYAJ-OdFovExactAueavBOyZN3m7E-OttWhl2YK-9jTuQyiqqdMMvnNOltAyGaXJz8iO2YB7drbRu9t2GGZSF24E58_35PPrYhdnT817_drdSYbz2s6cfHPn1Kw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LaxRBEC5iFPSSxBfZJMYW9CIO9s70bM8cREI0JmRdFlwheJn0oxoCZjbJ5kH-lL_RqnmRRdhbDl5nupue6ep6dFV_H8Db2KXWYqwip_s2UkZiZDKZRKE_0NLGQXpTk03o0Sg7OsrHS_CnvQvDZZWtTqwUtZ86PiP_SKZeM1VMqj-fnUfMGsXZ1ZZCoxaLQ7y9oZBt9ungC63vuzje-zrZ3Y8aVoHIJXlyGSH2fch8jnJg8owMupJeBQxZbPPAID0ZSpOkufF5UN6FRFudOmOsH1iytjahcR_AQ6UoWKL9M05_dVkLhj6vbjNpribKVJtFZYhqfsjPKKCpSv_vYjnM28R5k1DZub3V_-0PrcFK41GLnXoLPIUlLJ_BastWIRrl9RwmO4ICb5qfYH5pJ8Z1Zdop2W4xbE5tBbnwYndauhq1aq4N17qKb4zvLX5UoLtXFzh7AT_v5dtewnI5LXEdRIYUyqKpiBmVdHEePDmTiEnQGKTzPfjQrXDRaIZZUVfV6eIfgeiBbIWgcA0-O9OE_F7U5X3X5awGJ1nUeKsVmzuz6WSmB2-616RhOG1kSpxeUZsBHztRGKo3Fg_xGh7vT74Pi-HB6HATnpBrqerC5i1YpnXBV_DIXV-ezC62q20j4Pi-pfAvoXtT1g
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=A+Linear+Logic+Programming+Language+for+Concurrent+Programming+over+Graph+Structures&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=CRUZ%2C+FLAVIO&rft.au=ROCHA%2C+RICARDO&rft.au=GOLDSTEIN%2C+SETH+COPEN&rft.au=PFENNING%2C+FRANK&rft.date=2014-07-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=14&rft.issue=4-5&rft.spage=493&rft.epage=507&rft_id=info:doi/10.1017%2FS1471068414000167&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068414000167
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon