@inproceedings{2ae704777fa14acab796ef66f17f17dc,
title = "Experiences with strong moding in concurrent logic/constraint programming",
abstract = "Strong moding is turning out to play fundamental roles in concurrent logic programming (or in general, concurrent constraint programming) as strong typing does but in different respects. “Principal modes” can most naturally be represented as feature graphs and can be formed by unification. We built a mode analyzer, implementing mode graphs and their operations by means of concurrent processes and streams (rather than records and pointers). This is a non-trivial programming experience with complicated process structures and has provided us with several insights into the relationship between programming with dynamic data structures and programming with dynamic process structures. The mode analyzer was then applied to the analyzer itself to study the characteristics of the mode constraints it imposed and of the form of large mode graphs. Finally, we show how our framework based on principal moding can be extended to deal with (1) random-access data structures, (2) mode polymorphism, (3) higher-order constructs, and (4) various non-Herbrand constraint systems.",
author = "Kazunori Ueda",
year = "1996",
month = jan,
day = "1",
doi = "10.1007/bfb0023059",
language = "English",
isbn = "3540611436",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "134--153",
editor = "Takayasu Ito and Halstead, {Robert H.} and Christian Queinnec",
booktitle = "Parallel Symbolic Languages and Systems - International Workshop PSLS 1995, Proceedings",
note = "3rd International workshop on Parallel Symbolic Languages and Systems, PSLS 1995 ; Conference date: 02-10-1995 Through 04-10-1995",
}