7 citations · 11 across the 10 of their papers we have counts for
6 papers · 1 filter
Correct by construction
M. H. van Emden
Matrix code allows one to discover algorithms and to render them in code that is both compilable and is correct by construction. In this way the difficulty of verifying existing co…
Beyond Structured Programming
M. H. van Emden
The correctness of a structured program is, at best, plausible. Though this is a step forward compared to what came before, it falls short of verified correctness. To verify a stru…
The lambda mechanism in lambda calculus and in other calculi
M. H. van Emden
A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments in…
Towards Applicative Relational Programming
H. Ibrahim, M. H. van Emden
Functional programming comes in two flavours: one where ``functions are first-class citizens'' (we call this applicative) and one which is based on equations (we call this declarat…
Compositional Semantics for the Procedural Interpretation of Logic
M. H. van Emden
Semantics of logic programs has been given by proof theory, model theory and by fixpoint of the immediate-consequence operator. If clausal logic is a programming language, then it…
Computing Functional and Relational Box Consistency by Structured Propagation in Atomic Constraint Systems
M. H. van Emden
Box consistency has been observed to yield exponentially better performance than chaotic constraint propagation in the interval constraint system obtained by decomposing the origin…