A theory of totally correct logic program transformations
暂无分享,去创建一个
[1] Zohar Manna,et al. Axiomatic approach to total correctness of programs , 1973, Acta Informatica.
[2] Manolis Gergatsoulis,et al. Unfold/Fold Transformations For Definite Clause Programs , 1994, PLILP.
[3] Marc Bezem,et al. Characterizing Termination of Logic Programs with Level Mappings , 1989, NACLP.
[4] Gordon D. Plotkin,et al. A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..
[5] Krzysztof R. Apt,et al. Introduction to Logic Programming , 1988 .
[6] David Sands. From SOS rules to proof principles: an operational metatheory for functional languages , 1997, POPL '97.
[7] Michael J. Maher. Correctness of a Logic Program Transformation System , 1987 .
[8] Hisao Tamaki,et al. Unfold/Fold Transformation of Logic Programs , 1984, ICLP.
[9] Sandro Etalle,et al. On Safe Folding , 1992, PLILP.
[10] Helmut A. Partsch,et al. Specification and transformation of programs , 1990 .
[11] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.
[12] Alberto Pettorossi,et al. Transforming Inductive Definitions , 1999, ICLP.
[13] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[14] C. R. Ramakrishnan,et al. An unfold/fold transformation framework for definite logic programs , 2004, TOPL.
[15] Sandro Etalle,et al. Simultaneous Replacement in Normal Programs , 1996, J. Log. Comput..
[16] Bruno Courcelle,et al. Infinite trees in normal form and recursive equations having a unique solution , 1979, Mathematical systems theory.
[17] Michael J. Maher,et al. The Semantics of Constraint Logic Programs , 1998, J. Log. Program..
[18] Helmuth Partsch,et al. Specification and Transformation of Programs - A Formal Approach to Software Development , 1990, Texts and Monographs in Computer Science.