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

arXiv: https://arxiv.org/abs/1405.3556 · HTML: https://mlsanity.com/paper/1405.3556/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 May 2014.

## Built on by (most cited first, 1 of 1)

- [A Schema-aware Logic Reformulation for Graph Reachability](https://mlsanity.com/paper/2410.02533/) (2024)

## Abstract (arXiv)

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.