All issues
Volume 21 (2004)
- Issue 6 Pages 423-
- Issue 5 Pages 340-
- Issue 4 Pages 235-
- Issue 3 Pages 159-
- Issue 2 Pages 83-
- Issue 1 Pages 1-
Volume 21, Issue 5
Displaying 1-8 of 8 articles from this issue
- |<
- <
- 1
- >
- >|
-
Yoshihiko FUTAMURA2004 Volume 21 Issue 5 Pages 340-342
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSDownload PDF (68K) -
Yoshihiko FUTAMURA2004 Volume 21 Issue 5 Pages 343-351
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSThis paper reports the relationship between formal description of semantics (i.e., interpreter) of a programming language and an actual compiler. The paper also describes a method to automatically generate an actual compiler from a formal descriotion, which is, in some sense, the partial evaluation of a computation process.
The compiler-compiler inspired by this method differs from a conventional one in the point that the compiler-compiler based on our method can describe an evaluation procedure (interpreter) in defining the semantics of a programming language, while the conventional one describes a translation process.View full abstractDownload PDF (266K) -
Akinori YONEZAWA2004 Volume 21 Issue 5 Pages 352-363
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSDownload PDF (111K) -
Akinori YONEZAWA, Etsuya SHIBAYAMA, J.-P. BRIOT, Yasuaki HONDA, Toshih ...2004 Volume 21 Issue 5 Pages 364-380
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESS -
Wataru YAMAZAKI, Hiroyuki NISHIYAMA, Fumio MIZOGUCHI2004 Volume 21 Issue 5 Pages 381-396
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSIn this paper, we are proposing GMAL(Grid Multi Agent Language), an agent-based programming language that can easily realize intelligent programming in distributed environments such as GRID. In this language, an agent is defined as a set of rules that consists of the agent's inner states, outer states, and their constraints. Communications for multiagent collaboration are easily defined as a result of special operators for messages and the simple syntax of a concurrent logic programming language. These characteristics enable us to develop an intelligent network and message-passing program, which has previously been difficult for non-expert programmers.View full abstractDownload PDF (265K) -
Hayato KAWASHIMA, Katsuhiko GONDOW2004 Volume 21 Issue 5 Pages 397-402
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSWe developed ACML as an XML-based markup language to describe the syntactic structure and static semantics for ANSI C program. This paper proposes a system called AXES, which has two features: (1) to extract information of static program analysis from an ACML document by syntactical pattern matching; and (2) to generate the information in well-known description formats (e.g. HTML). The program information extracted by the AXES can be used in a cross-referencer with a web browser. But it is difficult for existing cross-referencers (e.g. GNU GLOBAL, LXR, SPIE, and Cxref) to extract program information by syntactical pattern matching (e.g. @if($exp=$exp){}). The AXES produces a framework for advanced and flexible retrieval of program information based on syntactical pattern matching.View full abstractDownload PDF (123K) -
Tetsuo YOKOYAMA, Zhenjiang HU, Masato TAKEICHI2004 Volume 21 Issue 5 Pages 403-408
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSSecond-order patterns and second-order matching play an important role in program transformation, but the second-order matching algorithm is known to be NP-hard and real efficient implementation is out of question. To resolve this problem, we introduced a class of deterministic second-order patterns, and proposed an efficient matching algorithm. In this paper, we further extend this class to cove more deterministic second-order patterns, discuss both sufficient and necessary conditions for a second-order pattern to be deterministic, and demonstrate its usefulness in program transformation.View full abstractDownload PDF (106K) -
Akihiro YAMAMOTO2004 Volume 21 Issue 5 Pages 409-414
Published: September 28, 2004
Released on J-STAGE: April 27, 2009
JOURNAL FREE ACCESSInductive Metalogic Programming means Inductive Logic Programming with metalogic programming. In Inductive Logic Programming, all of training examples, data, background knowledge and hypotheses for inductive inference are represented in the form of logic programs, but inference mechanisms are not always in the form. Inductive Metalogic Programming is the case that inductive inference mechanisms are also represented in logic programs. Since such an inference mechanism takes logic programs as training examples or data and returns logic programs as hypotheses, the logic program representing the mechanism must be founded on metalogic programming. In this paper we point out two problems on the formalization of Inductive Metalogic Programming given in a previous work. We solve one of the problems by introducing refinement operators for hypothesis space, and the other by re-formalizing inductive inference in the new logic, proposed by Martin et al., for unification of induction and deduction.View full abstractDownload PDF (95K)
- |<
- <
- 1
- >
- >|