ACL—a concurrent linear logic programming paradigm
Naoki Kobayashi, Akinori Yonezawa · 1993
We propose a novel concurrent programming framework called ACL. ACL is a variant of linear logic programming, where computation is described in terms of bottom-up proof search of some formula in linear logic. The whole linear sequent calculus is too non-deterministic to be interpreted as an operational semantics for a realistic programming language. We restrict formulas and accordingly refine inference rules for those formulas, hence overcoming this problem. Don't care interpretation of non-determinism in the resulting system yields a very clean and powerful concurrent programming paradigm based on message-passing style communication. It is remarkable that each ACL inference rule has an exact correspondence to some operation in concurrent computation and that non-determinism in proof search just corresponds to an inherent non-determinism in concurrent computation, namely, non-determinism on message arrival order. We demonstrate the power of our ACL framework by showing several programm...