Paper Info
Title
A Linear Logic Programming Language for Concurrent Programming over Graph Structures.
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.
Year
DOI
Venue
2014
10.1017/S1471068414000167
THEORY AND PRACTICE OF LOGIC PROGRAMMING
Keywords
DocType
Volume
Language Design,Semantics,Linear Logic,Concurrent Programming,Graphs
Journal
14
Issue
ISSN
Citations 
4-5
1471-0684
9
PageRank 
References 
Authors
0.58
15
4
Name
Order
Citations
PageRank
Flávio Cruz1142.73
Ricardo Rocha2325.84
Seth Copen Goldstein31951232.71
Frank Pfenning43376265.34