论文信息 - Semantics preserving transformation rules for Prolog - 字舞流文

Semantics preserving transformation rules for Prolog

Alberto Pettorossi | Maurizio Proietti

[1] Tadashi Kanamori,et al. Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation , 1990, Theor. Comput. Sci..

[2] Saumya K. Debray,et al. Denotational and Operational Semantics for Prolog , 1988, J. Log. Program..

[3] Hisao Tamaki,et al. Unfold/Fold Transformation of Logic Programs , 1984, ICLP.

[4] Alberto Pettorossi,et al. Synthesis of Eureka Predicates for Developing Logic Programs , 1990, ESOP.

[5] Jan Komorowski,et al. Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog , 1982, POPL '82.

[6] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[7] J. Vuillemin. Proof techniques for recursive programs , 1973 .

[8] M. Baudinet. Logic programming semantics: techniques and applications , 1989 .

[9] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[10] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .

[11] Neil D. Jones,et al. Stepwise Development of Operational and Denotational Semantics for Prolog , 1984, International Conference on Spoken Language Processing.