Transforming constraint logic programs

Transforming constraint logic programs

We study “à la Tamaki-Sato” transformations of constraint logic programs. We give an operational and fixpoint semantics of our constraint logic programs; we extend the Tamaki-Sato transformation system into a transformation system for constraint programs including fold-unfold, substitution, thinning...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 1998-10, Vol.206 (1), p.81-125
Hauptverfasser: Bensaou, N., Guessarian, I.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer Science
Computer science
control theory
systems
Constraint logic programs
Correctness
Exact sciences and technology
Language theory and syntactical analysis
Least fixpoint semantics
Logic in Computer Science
Program transformations
Programming Languages
Software
Software engineering
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study “à la Tamaki-Sato” transformations of constraint logic programs. We give an operational and fixpoint semantics of our constraint logic programs; we extend the Tamaki-Sato transformation system into a transformation system for constraint programs including fold-unfold, substitution, thinning and fattening, and constraint simplifications; we give a direct proof of its correctness which is simpler than the Tamaki-Sato proof.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(97)00077-7