Expression transformers in B-GSL

Authors:
Bill Stoddart;Frank Zeyda
Affiliations:
School of Computing and Mathematics, University of Teesside, Middlesbrough, UK;School of Computing and Mathematics, University of Teesside, Middlesbrough, UK
Venue:
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Year:
2003

Citing 5
Cited 1

A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Notions of computation and monads

Information and Computation
A practical theory of programming

A practical theory of programming
A theory of bunches

Acta Informatica
Monads for Functional Programming

Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text

A prospective-value semantics for the GSL

ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

The B concept of generalised substitutions is applied to expressions as well as predicates to obtain "expression transformers", which formalise the idea of speculative computation and form part of the executable subset of our language. We define expression transformers over the syntactic constructs of B-GSL, and show this definition is equivalent to an alternative based on before-after predicates. The use of expression transformers is illustrated by example programs which combine functional and imperative programming styles and exploit backtracking.