A transformation system for CLP with dynamic scheduling and CCP
In this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (CCP). We define suitable applicability conditions for these transformations which guarantee that the original and the transformed program have the...
Gespeichert in:
Veröffentlicht in: | Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'97 : Amsterdam, The Netherlands, June 12-13, 1997 PEPM'97 : Amsterdam, The Netherlands, June 12-13, 1997, 1997-12, Vol.32 (12), p.137-150 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!