论文信息 - Infinite Computation in the Equivalent Transformation Model - 字舞流文

Infinite Computation in the Equivalent Transformation Model

Kiyoshi Akama | Katsunori Miura | Hiroshi Mabuchi | Hidekatsu Koike

[1] Frank S. de Boer,et al. Nondeterminism and Infinite Computations in Constraint Programming , 1995, Theor. Comput. Sci..

[2] Joxan Jaffar,et al. Constraint logic programming , 1987, POPL '87.

[3] William G. Golson. Toward a Declarative Semantics for Infinite Objects in Logic Programming , 1988, J. Log. Program..

[4] Sven-Olof Nyström,et al. Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations , 1993, ILPS.

[5] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.

[6] Prakash Panangaden,et al. The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[7] David Turner. An overview of Miranda , 1986, SIGP.

[8] James Hein. Completions of Perpetual Logic Programs , 1992, Theor. Comput. Sci..

[9] Hidekatsu Koike,et al. Equivalent Transformation of Member Constraints on Interval-Variable Domain , 1998 .

[10] Mathieu Jaume,et al. On Greatest Fixpoint Semantics of Logic Programming , 2002, J. Log. Comput..

[11] Kiyoshi Akama,et al. A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation , 2001, RULE@PLI.

[12] Giorgio Levi,et al. Contributions to the semantics of logic perpetual processes , 2004, Acta Informatica.