J.J. Lukkien. Operational semantics and generalized weakest preconditions. Science of Computer Programming, 22:137--155, 1994. 64  Home/Search   Document Not in Database   Summary   Related Articles   Check

....lambda abstractions only for state independent expressions, so such functions are referentially transparent. The procedure mechanism is independent from the 1 And with an eye towards concurrency, where some transformers have quite different healthiness conditions [CS95, JKR89] but see also [Luk94]. Some studies of transformers have used the opposite extreme essentially allowing only total, deterministic programs to be stored because it arises naturally by a span construction [Mar91] 2 C, C and Java have no local procedures. Oberon does not allow local procedures to be assigned ....

J.J. Lukkien. Operational semantics and generalized weakest preconditions. Science of Computer Programming, 22:137--155, 1994. 64

....is the issue of full abstractness or, more restrictedly, of the adequacy of linear models for L 2 and L 3 . Since no such feature as message passing is present in the languages we may expect that a mixture of the sequences of pairs techniques of [BHR90] and the linear semantics of Lukkien (cf. [Luk91, Luk94]) will provide a more abstract model. Probably the isomorphism of the domains of predicate transformers vs. state transformers may be of help in the comparison. Acknowledgments We wish to thank Jaco de Bakker for suggesting us to apply the general framework of [BK94a] to a concurrent language. ....

J.J. Lukkien. Operational Semantics and Generalized Weakest Precondition. Science of Computer Programming, 22:137--155, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC