Semantic models for concurrent logic languages

DOI10.1016/0304-3975(91)90003-KzbMath0744.68087OpenAlexW2077853828MaRDI QIDQ1177921

Catuscia Palamidessi, Jan J. M. M. Rutten, Frank S. de Boer, Joost N. Kok

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90003-k

zbMATH Keywords

metric spacessemanticslogic programmingconcurrency

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (3)

Nondeterminism and infinite computations in constraint programming ⋮ From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic ⋮ A fully abstract semantics for concurrent constraint programming

Uses Software

• PARLOG
• GHC

Cites Work

• Solving reflexive domain equations in a category of complete metric spaces
• Declarative modeling of the operational behavior of logic languages
• Properties of substitutions and unifications
• From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
• Notes on the implementation of PARLOG
• PARLOG: parallel programming in logic
• The Semantics of Predicate Logic as a Programming Language
• Processes and the denotational semantics of concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semantic models for concurrent logic languages