| Abstract: | Abstract The Σλ-calculus is an extension of an applied λ-calculus designed to abstract parallel and non-deterministic function application evaluation. The abstraction is extended to include Landin's closure, and constant terms and a special form of the conditional allows the regular logics to be developed along the lines of the Hilbert-Ackermann approach. The regular logics are used to characterize derived conditionals in extensions to Dijkstra's weakest preconditions. It is shown that various styles of programming—top-down, bottom-up, recursive and iterative—axe expressible in the Σλ-calculus. Lists and streams are found to be useful in expressing time-dependent behaviour of computational systems. An approximate Church-Rosser Theorem is given. |
