Kazunori Ueda, Koichi Furukawa  Home/Search
Context Related
Links: DBLP | ueda.info.waseda.ac....fgcs88finala4.ps ueda.info.waseda.ac....fgcs88finala4.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ueda.info.waseda.ac.jp...papers_j (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Transformation rules for (Flat) GHC programs are presented, which refine the previous rules proposed by one of the authors (Furukawa et al. 1987). The rules are based on unfolding/folding and are novel in that they are stated in terms of idempotent substitutions with preferred directions of bindings. They are more general than the old rules in that no mode system is assumed and that the rule of folding is included. The presentation of the rules suggests that idempotent substitutions with... (Update)
Context of citations to this paper: More
...2. 1 The Language To further investigate constraint based communication, let us consider a concrete language, a subset of Flat GHC [38] whose syntax is given in Fig. 1. program) P : set of R s (1) program clause) R : A : B (2) body) B : multiset of G s (3)...
...based on GHC by featuring (among others) mapping constructs for concurrent processes. To be precise, KL1 is based on Flat GHC [28], a subset of GHC that restricts guard goals to calls to test predicates. The mathematical theory of these languages came later in the...
Cited by: More
Specialization of Concurrent Guarded Multi-Set - Transformation Rules Thom (Correct)
Declarative Semantics of Input Consuming Logic Programs - Bossi, Cocco, Etalle, Rossi (Correct)
Parallelism In Logic Programming - Ueda (1989) (Correct)
Active bibliography (related documents): More All
0.2: Technical Annex for the ACCLAIM Project (PE7195) - Haridi (1992) (Correct)
0.2: Proving Termination of GHC Programs - Rao, Kapur, Shyamasunder (1993) (Correct)
0.2: Making Exhaustive Search Programs Deterministic, Part II - Ueda (Correct)
Similar documents based on text: More All
0.8: Guarded Horn Clauses - Ueda (1986) (Correct)
0.7: Guarded Horn Clauses: A Parallel Logic Programming Language with.. - Ueda (1987) (Correct)
0.7: Moded Flat GHC for Data-Parallel Programming (Extended Abstract) - Ueda (Correct)
Related documents from co-citation: More All
7: Guarded Horn Clauses - Ueda - 1986
6: Concurrent Constraint Programming (context) - Saraswat - 1990
5: Predicate logic as a language for parallel programming (context) - van Emden, Filho - 1982
BibTeX entry: (Update)
Ueda, K. and Furukawa, K. 1988. Transformation rules for GHC Programs. In Proc. Int'l Conf. on Fifth Generation Computer Systems (1988), pp. 582--591. Institute for New Generation Computer Technology, Tokyo. http://citeseer.ist.psu.edu/ueda88transformation.html More
@inproceedings{ ueda88transformation,
author = "Kazunori Ueda and Koichi Furukawa",
title = "Transformation Rules for {GHC} Programs",
booktitle = "Proc. Int. Conf. on Fifth Generation Computer Systems 1988 (FGCS'88)",
pages = "582-591",
year = "1988",
url = "citeseer.ist.psu.edu/ueda88transformation.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984 ACM
166 Unification Revisited (context) - Lassez, Maher et al. - 1987 ACM DBLP
139 Fold Transformation of Logic Programs (context) - Tamaki, Sato - 1984
121 Guarded Horn Clauses - Ueda - 1985 ACM DBLP
78 Scenarios: A Model of Non-determinate Computation (context) - Brock, Ackerman - 1981 DBLP
65 Concurrent Prolog: Collected Papers (context) - Shapiro - 1987 ACM
5 Introduction to Guarded Horn Clauses (context) - Ueda
4 Unfolding Rules for GHC programs (context) - Furukawa, Okumura et al. - 1987 ACM DBLP
1 Representation and Enumeration of Flat Concurrent Prolog Com.. (context) - Lichtenstein, Codish et al. - 1987 ACM
1 Program Transformation in Logic Programming Languages (context) - Tamaki - 1987
1 Forthcoming paper to appear as ICOT Tech (context) - Ueda, Furukawa - 1989
1 Logic: Form and Function (context) - Robinson - 1979
1 GHC Process Fusion by Program Transformation (context) - Furukawa, Ueda - 1985
1 fold Transformation of Logic Programs with Counters (context) - Soc, Sci et al. - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ueda.info.waseda.ac.jp/~ueda/papers_j.html):
Guarded Horn Clauses - Ueda (1986) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC