Add to ORKGAbstract. Programming languages are not an ideal vehicle for expressing algorithms. This paper sketches how a language Abstracto might be developed for "algorithmic expressions " that may be manipulated by the rules of "algorithmics", quite similar to the manipulation of mathematical expres-sions in mathematics. Two examples are given of "abstract " algorithmic expressions that are not ex-ecutable in the ordinary sense, but may be used in the derivation of programs. It appears that the no-tion of "refinement " may be replaced by a weaker notion for abstract algorithmic expressions, correspondin also to a weaker notion of "weakest precondition ~. i. THE ABSTRACTO PROJEC
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
. The goal of foundational thinking in computer science is to understand the methods and practices o...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...
Algorithmics is the study and practice of taking a high-level description of a program’s purpose an...
Of the various approaches to program correctness, that of "Transformational Programming " ...
A large part of the effort in formal program developments is expended on repeating the same derivati...
Over the years, mathematical models have become increasingly complex. Rarely can we accurately model...
A large part of the effort in formal program developments i expended on repeating the same derivatio...
Basic definition of algorithm in mathematics is step by step procedure to solve a problem. Algorithm...
Abstract—Instructors typically explain algorithms in com-puter science by tracing their behavior, of...
In a sufficiently rich programming language it is possible to express a very substantial amount of ...
Abstract- In Introduction to Analysis of Algorithms students ’ traditionally apply a combination of ...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/2...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
As idealized descriptions of mathematical language, there is a sense in which formal systems specify...
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
. The goal of foundational thinking in computer science is to understand the methods and practices o...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...
Algorithmics is the study and practice of taking a high-level description of a program’s purpose an...
Of the various approaches to program correctness, that of "Transformational Programming " ...
A large part of the effort in formal program developments is expended on repeating the same derivati...
Over the years, mathematical models have become increasingly complex. Rarely can we accurately model...
A large part of the effort in formal program developments i expended on repeating the same derivatio...
Basic definition of algorithm in mathematics is step by step procedure to solve a problem. Algorithm...
Abstract—Instructors typically explain algorithms in com-puter science by tracing their behavior, of...
In a sufficiently rich programming language it is possible to express a very substantial amount of ...
Abstract- In Introduction to Analysis of Algorithms students ’ traditionally apply a combination of ...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/2...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
As idealized descriptions of mathematical language, there is a sense in which formal systems specify...
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
. The goal of foundational thinking in computer science is to understand the methods and practices o...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...