The bidirectional coroutine is introduced as a mechanism for overcoming a shortcoming in the method of specification of the transfer of control between coroutines. An analogy is drawn between subroutines and coroutines by observing that coroutines, like subroutines, should not have to know with whom they are interacting. At present, most coroutine implementations require specific mention of the...

The aim of this paper is to alter the abstract definition of the program of the theoretical programming model which has been developed at Eötvös Loránd University for many years in order to investigate methods that support designing correct programs. The motivation of this modification was that the dynamic properties of programs appear in the model. This new definition of the program gives a ha...

This chapter presents a review of various interpretations of the fuzzy membership function together with ways of obtaining a membership function. We emphasize that different interpretations of the membership function call for different elicitation methods. We try to make this distinction clear using techniques from measurement theory. 3.

In [2], two of the authors and W. Meeks found examples of translation-invariant, embedded minimal surfaces with an infinite number of topological ends. For each k > 0, a surfaceMk was constructed, which was invariant with respect to a translation parallel to the x3-axis, and under a rotation group of order k+ 1 around the x3-axis. The method of construction was generalized in [3] to obtain the ...

This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a "modulariza tion is dependent upon the criteria used in dividing the system into modules. Two system design problems are presented, and for each, both a conventional and unconventional decomposition are d...

An algorithm is presented for computing a “Pythagorean sum” a 0 b = d m directly from a and b without computing their squares or taking a square root. No destructive floating point overflows or underflows are possible. The algorithm can be extended to compute the Euclidean norm of a vector. The resulting subroutine is short, portable, robust, and accurate, but not as eficient as some other poss...

Atomic components are sets of related variables, types, and subprograms, e.g., abstract data types and objects. Many techniques exist to detect them automatically. However, as an evaluation has shown, none of them has the precision needed [9]. One approach to achieve a higher precision is to integrate the user into the detection cycle. This paper describes a method in which computer and human w...

Since its beginnings half a century ago, the technology applied to the development of software has continually evolved. Object technology is the result of a long progression of improvements, from the closed subroutine, through structured development techniques and data abstractions, to object-oriented languages, design patterns, and frameworks. In this essay, the author reflects on this evoluti...

MP is a package of ANSI Standard Fortran (ANS X3.9-1966) subroutines for performing multiple-precision floating-point arithmetic and evaluating elementary and special functions. The subroutines are machine independent and the precision is arbitrary, subject to storage limitations. The User's Guide describes the routines and their calling sequences, example and test programs, use of the Augment ...