Jump to content

Talk:Predicate transformer semantics

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by PJTraill (talk | contribs) at 18:14, 3 December 2009 (wlp merged). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A more in-depth discussion of if and do is required, as well as nondeterminism. Also, an example of how to use predicate transformers to derive a non-trivial algorithm might be good, as long as it doesn't conflict with policy. Also, the references section could use some filling out, specifically to the Gries' and Backhous' newer books on the subject. The relationship to predicate calculus could also be filled out. --jayinbmore 23:58, 31 Jan 2005 (UTC)

Also needs accounting of the wlp "weakest liberal precondition" predicate transformer. --jayinbmore 07:53, 1 Feb 2005 (UTC)

Have merged wlp into this article, as suggested in that article, but it could do with more detail PJTraill (talk) 18:14, 3 December 2009 (UTC)[reply]

The link of "predicate" to Assertion (computing) is rather unhelpful, but the article Predicate (mathematical logic), though more relevant is a mess, and perhaps not much more helpful. Can somebody do better? PJTraill (talk) 00:10, 23 November 2009 (UTC)[reply]