A Linear Logic Programming Language for Concurrent Programming over Graph Structures release_jjvj47b7bbcp5danrqetys2rqa

by Flavio Cruz, Ricardo Rocha, Seth Copen Goldstein, Frank Pfenning

Released as a article .

2014  

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.
In text/plain format

Archived Files and Locations

application/pdf  230.0 kB
file_svo7tbelrvdxvmrbywrdad6d7m
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-05-14
Version   v1
Language   en ?
arXiv  1405.3556v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 971b7f2f-850c-4a52-87d8-fb8299aca1b0
API URL: JSON