Experiences with strong moding in concurrent logic/constraint programming

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

    9 Citations (Scopus)

    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.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    PublisherSpringer Verlag
    Pages134-153
    Number of pages20
    Volume1068
    ISBN (Print)3540611436, 9783540611431
    Publication statusPublished - 1996
    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)
    Volume1068
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other3rd International workshop on Parallel Symbolic Languages and Systems, PSLS 1995
    CountryFrance
    CityBeaune
    Period95/10/295/10/4

    Fingerprint

    Constraint Logic Programming
    Data structures
    Concurrent
    Concurrent Programming
    Programming
    Logic programming
    Graph in graph theory
    Computer programming
    Polymorphism
    Dynamic Data Structures
    Access Structure
    Random Access
    Constraint Programming
    Dynamic Process
    Logic Programming
    Unification
    Data Structures
    Higher Order
    Experience

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Ueda, K. (1996). Experiences with strong moding in concurrent logic/constraint programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1068, pp. 134-153). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1068). Springer Verlag.

    Experiences with strong moding in concurrent logic/constraint programming. / Ueda, Kazunori.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1068 Springer Verlag, 1996. p. 134-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1068).

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

    Ueda, K 1996, Experiences with strong moding in concurrent logic/constraint programming. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1068, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1068, Springer Verlag, pp. 134-153, 3rd International workshop on Parallel Symbolic Languages and Systems, PSLS 1995, Beaune, France, 95/10/2.
    Ueda K. Experiences with strong moding in concurrent logic/constraint programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1068. Springer Verlag. 1996. p. 134-153. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Ueda, Kazunori. / Experiences with strong moding in concurrent logic/constraint programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1068 Springer Verlag, 1996. pp. 134-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @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",
    language = "English",
    isbn = "3540611436",
    volume = "1068",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "134--153",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Experiences with strong moding in concurrent logic/constraint programming

    AU - Ueda, Kazunori

    PY - 1996

    Y1 - 1996

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=84949516092&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84949516092&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 3540611436

    SN - 9783540611431

    VL - 1068

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 134

    EP - 153

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    PB - Springer Verlag

    ER -