Unfolding and fixpoint semantics of concurrent constraint logic programs

DOI10.1016/0304-3975(92)90288-QzbMath0757.68074MaRDI QIDQ1200981

Maurizio Gabbrielli, Giorgio Levi

Publication date: 16 January 1993

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

zbMATH Keywords

unfoldingconcurrent constraint logic languagesreactive trees

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Artificial intelligence (68T99) Logic programming (68N17)

Related Items (4)

A logical semantics for depth-first Prolog with ground negation ⋮ S-semantics for logic programming: a retrospective look ⋮ A compositional semantics for logic programs ⋮ Models and emerging trends of concurrent constraint programming

Uses Software

• PARLOG
• GHC

Cites Work

• Declarative modeling of the operational behavior of logic languages
• Calculi for synchrony and asynchrony
• Unfolding rules for GHC programs
• Truly concurrent constraint programming
• NESTED GUARDED HORN CLAUSES
• PARLOG: parallel programming in logic
• The Semantics of Predicate Logic as a Programming Language
• A Transformation System for Developing Recursive Programs
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unfolding and fixpoint semantics of concurrent constraint logic programs