A Simple Correctness Proof for Magic Transformation

Details A Simple Correctness Proof for Magic Transformation A Simple Correctness Proof for Magic Transformation

2010-12-10

arxiv.org/abs/1012.2299v1

Computer Science

Logic in Computer Science

Submitted to "Theory and Practice of Logic Programming"

Scientific paper

The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The correctness property concerns the declarative semantics. The proof, however, refers to the operational semantics (LD-resolution) of the source programs. Its conciseness is due to applying a suitable proof method.

Affiliated with

Also associated with

No associations

Rating

A Simple Correctness Proof for Magic Transformation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Simple Correctness Proof for Magic Transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Correctness Proof for Magic Transformation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108030