« 1988-10 | メイン | 1989-04 »

1989-01 アーカイブ

1989-01-01

Kanada, Y., 未出版, 1989.

[ English page ]
[ 論文 PDF ファイル ]

要約: A loop-like control structure without using backtracking, or conjunctive iteration, is expressed using recursion in Prolog. However, recursion is too powerful to express an iteration, which needs more restrictive syntax and semantics. This paper presents a general-purpose iteration predicate do. Predicate do enables a programmer to write most iterations, such as arithmetical iterations, append, member, mapcar or reduce, and so on, more easily and in more readable way, in combination with the extended λ term, which is a concept similar to the λ expression in Lisp. Unification and logical variables in Prolog enables some extensive usage of the control structure compared with those of other programming languages, such as Lisp.

1988-10

1989-04

(C) 2007 by Yasusi Kanada
Powered by
Movable Type 3.36