Zobrazeno 1 - 10
of 300
pro vyhledávání: '"D'Emden, M."'
Autor:
van Emden, M. H.
Multiplication and exponentiation can be defined by equations in which one of the operands is written as the sum of powers of two. When these powers are non-negative integers, the operand is integer; without this restriction it is a fraction. The def
Externí odkaz:
http://arxiv.org/abs/1901.10961
Autor:
van Emden, M. H.
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 code is avoided. The method is especially important for logically dense
Externí odkaz:
http://arxiv.org/abs/1812.09411
Autor:
van Emden, M. H.
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 structured program according to Hoare's method one is faced with the probl
Externí odkaz:
http://arxiv.org/abs/1810.11673
Autor:
Kelly, Philip, van Emden, M. H.
Henkin, Monk and Tarski gave a compositional semantics for first-order predicate logic. We extend this work by including function symbols in the language and by giving the denotation of the atomic formula as a composition of the denotations of its pr
Externí odkaz:
http://arxiv.org/abs/1512.06282
Autor:
van Emden, M. H.
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 indexed by variables to the usual kind of function where the arguments a
Externí odkaz:
http://arxiv.org/abs/1503.00375
Autor:
van Emden, M. H.
A logic program is an executable specification. For example, merge sort in pure Prolog is a logical formula, yet shows creditable performance on long linked lists. But such executable specifications are a compromise: the logic is distorted by algorit
Externí odkaz:
http://arxiv.org/abs/1412.3480
Autor:
van Emden, M. H.
Logic can be made useful for programming and for databases independently of logic programming. To be useful in this way, logic has to provide a mechanism for the definition of new functions and new relations on the basis of those given in the interpr
Externí odkaz:
http://arxiv.org/abs/1206.2037
Autor:
van Emden, M. H.
In first-year programming courses it is often difficult to show students how an algorithm can be discovered. In this paper we present a program format that supports the development from specification to code in small and obvious steps; that is, a dis
Externí odkaz:
http://arxiv.org/abs/1203.2296
Autor:
Kelly, Philip, van Emden, M. H.
The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that are adequa
Externí odkaz:
http://arxiv.org/abs/1202.0474
Autor:
Abdallah, A. Nait, van Emden, M. H.
This paper draws on diverse areas of computer science to develop a unified view of computation: (1) Optimization in operations research, where a numerical objective function is maximized under constraints, is generalized from the numerical total orde
Externí odkaz:
http://arxiv.org/abs/1201.5426