Engineering topics
Publications and source records attributed to Mesztenyi, C. K..
Implementation of FGRAAL, a FORTRAN-extended graph algorithmic language for the Univac 1108 is described. The report contains the description of the implemented data structures for sets, lists and graphs. It summarizes the changes made for the RALPH compiler to accommodate the special statements of FGRAAL; gives the calling sequences generated by the changed compiler; and describes the object time subroutine package.
The FORTRAN version FGRAAL of the graph algorithmic language GRAAL as it has been implemented for the Univac 1108 is described. FBRAAL is an extension of FORTRAN 5 and is intended for describing and implementing graph algorithms of the type primarily arising in applications. The formal description contained in this report represents a supplement to the FORTRAN 5 manual for the Univac 1108 (UP-4060), that is, only the new features of the language are described. Several typical graph algorithms, written in FGRAAL, are included to illustrate various features of the language and to show its applicability.
FORTRAN-based version, FGRAAL, of graph algorithmic language GRAAL
Computer language for implementation of graphic theoretical algorithms
An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.
Development documentation programs are considered. A document tree is defined as the syntactic representation of a document when it is divided into subdivisions such as chapters and sections; a developmental tree is also defined as a tree of information obtained during the course of the development of the computer program. A developmental subtree is emphasized and described. A printed subprogram is also included.
FORMAL programming system with language capability for performing symbolic algebraic manipulations
Input/output routines for symbolic programming with FORMAL on Univac 1108 computer
System of computer programs for testing iterative methods for solving nonlinear systems of equations
Orthogonal polynomials on finite pointset - algorithm for polynomial least square fit