Experiences with strong moding in concurrent logic/constraint programming

Kazunori Ueda*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationParallel Symbolic Languages and Systems - International Workshop PSLS 1995, Proceedings
EditorsTakayasu Ito, Robert H. Halstead, Christian Queinnec
PublisherSpringer Verlag
Number of pages20
ISBN (Print)3540611436, 9783540611431
Publication statusPublished - 1996 Jan 1
Event3rd International workshop on Parallel Symbolic Languages and Systems, PSLS 1995 - Beaune, France
Duration: 1995 Oct 21995 Oct 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd International workshop on Parallel Symbolic Languages and Systems, PSLS 1995

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Experiences with strong moding in concurrent logic/constraint programming'. Together they form a unique fingerprint.

Cite this