论文信息 - Towards a Formal Semantics for Concurrent Logic Programming Languages

Towards a Formal Semantics for Concurrent Logic Programming Languages

A method for giving a formal semantics of concurrent logic programming languages is proposed. It is shown how the semantics can be defined in terms of a concurrent execution model, based on Milner's CCS (Calculus of Communicating Systems). The method is illustrated by describing the main features of Relational Language, Concurrent Prolog and Guarded Horn Clauses.

Lennart Beckman | L. Beckman

[1] James Lyle Peterson,et al. Petri net theory and the modeling of systems , 1981 .

[2] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[3] Keith L. Clark,et al. A relational language for parallel programming , 1981, FPCA '81.

[4] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[5] Rune Gustavsson,et al. An Algebraic Model of Parallel Execution of Logic Programs , 1986, LICS.