Fully abstract compositional semantics for an algebra of logic programs
type: Item
instance of: scholarly article
title: Fully abstract compositional semantics for an algebra of logic programs
zbMATH Open document ID: 0874.68192
DOI: 10.1016/0304-3975(95)00012-L
author: Antonio Brogi
author: Franco Turini
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 985144
zbMATH Keywords: program composition operations
MaRDI profile type: Publication
cites work: Q4385536
cites work: Reasoning about termination of pure Prolog programs
cites work: Compositional model-theoretic semantics for logic programs
cites work: Q4028774
cites work: Declarative modeling of the operational behavior of logic languages
cites work: Enumeration operators and modular logic programming
cites work: On the efficiency of subsumption algorithms
cites work: Closures and fairness in the semantics of programming logic
cites work: Q3339245
cites work: Q3725521
cites work: Fully abstract models of typed \(\lambda\)-calculi
cites work: LCF considered as a programming language
cites work: The Semantics of Predicate Logic as a Programming Language
description: scientific article; zbMATH DE number 985144