Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Non-determinism in functional languages
The Computer Journal - Special issue on formal methods: part 1
Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
Heterogeneous relation algebra
Relational methods in computer science
Relational semantics of functional programs
Relational methods in computer science
A Discipline of Programming
Polynomial Relators (Extended Abstract)
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Semantics of Nondeterministic and Noncontinuous Constructs
Program Construction, International Summer Schoo
Concepts, Techniques, and Models of Computer Programming
Concepts, Techniques, and Models of Computer Programming
Non-termination in unifying theories of programming
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
| Hi-index | 0.00 |
We present a relational model of non-strict computations in an imperative, non-deterministic context. Undefinedness is represented independently of non-termination. The relations satisfy algebraic properties known from other approaches to model imperative programs; we introduce additional laws that model dependence in computations in an elegant algebraic form using partial orders. Programs can be executed according to the principle of lazy evaluation, otherwise known from functional programming languages. Local variables are treated by relational parallel composition.